./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-ext/40_barrier_vf.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-ext/40_barrier_vf.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 5eef73b6b2655059556d731e3a5babc181132142f2417a2cf863165dd8efda84 --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:07:43,144 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:07:43,146 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:07:43,178 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:07:43,180 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:07:43,182 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:07:43,183 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:07:43,185 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:07:43,187 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:07:43,190 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:07:43,191 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:07:43,192 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:07:43,193 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:07:43,194 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:07:43,195 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:07:43,199 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:07:43,199 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:07:43,200 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:07:43,201 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:07:43,204 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:07:43,211 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:07:43,211 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:07:43,212 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:07:43,213 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:07:43,217 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:07:43,217 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:07:43,218 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:07:43,219 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:07:43,219 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:07:43,220 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:07:43,220 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:07:43,224 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:07:43,225 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:07:43,226 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:07:43,226 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:07:43,227 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:07:43,227 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:07:43,227 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:07:43,227 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:07:43,228 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:07:43,228 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:07:43,229 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:07:43,254 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:07:43,254 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:07:43,255 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:07:43,255 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:07:43,256 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:07:43,256 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:07:43,256 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:07:43,256 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:07:43,257 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:07:43,257 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:07:43,257 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:07:43,257 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:07:43,258 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:07:43,258 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:07:43,258 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:07:43,258 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:07:43,258 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:07:43,258 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:07:43,258 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:07:43,259 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:07:43,259 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:07:43,259 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:07:43,259 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:07:43,259 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:07:43,259 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:07:43,259 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:07:43,260 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:07:43,260 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:07:43,260 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 20:07:43,260 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 20:07:43,260 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:07:43,260 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:07:43,261 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:07:43,261 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:07:43,261 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 -> 5eef73b6b2655059556d731e3a5babc181132142f2417a2cf863165dd8efda84 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:07:43,473 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:07:43,488 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:07:43,489 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:07:43,490 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:07:43,490 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:07:43,491 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/40_barrier_vf.i [2023-08-29 20:07:44,400 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:07:44,587 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:07:44,587 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/40_barrier_vf.i [2023-08-29 20:07:44,598 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bd8b76b9/d6aa9c6c6dc646f5b6027a67d3ff1bc5/FLAG7e6a46562 [2023-08-29 20:07:44,607 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bd8b76b9/d6aa9c6c6dc646f5b6027a67d3ff1bc5 [2023-08-29 20:07:44,608 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:07:44,609 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:07:44,610 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:07:44,610 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:07:44,612 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:07:44,613 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:07:44" (1/1) ... [2023-08-29 20:07:44,613 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48f608b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:07:44, skipping insertion in model container [2023-08-29 20:07:44,613 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:07:44" (1/1) ... [2023-08-29 20:07:44,617 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:07:44,639 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:07:44,732 WARN L633 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-08-29 20:07:44,799 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-ext/40_barrier_vf.i[31163,31176] [2023-08-29 20:07:44,804 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:07:44,810 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:07:44,819 WARN L633 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-08-29 20:07:44,832 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-ext/40_barrier_vf.i[31163,31176] [2023-08-29 20:07:44,834 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:07:44,857 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:07:44,857 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:07:44,857 WARN L667 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:07:44,861 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:07:44,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:07:44 WrapperNode [2023-08-29 20:07:44,862 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:07:44,863 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:07:44,863 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:07:44,863 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:07:44,884 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:07:44" (1/1) ... [2023-08-29 20:07:44,924 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:07:44" (1/1) ... [2023-08-29 20:07:44,943 INFO L138 Inliner]: procedures = 174, calls = 25, calls flagged for inlining = 10, calls inlined = 12, statements flattened = 78 [2023-08-29 20:07:44,944 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:07:44,945 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:07:44,945 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:07:44,945 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:07:44,950 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:07:44" (1/1) ... [2023-08-29 20:07:44,950 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:07:44" (1/1) ... [2023-08-29 20:07:44,954 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:07:44" (1/1) ... [2023-08-29 20:07:44,955 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:07:44" (1/1) ... [2023-08-29 20:07:44,967 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:07:44" (1/1) ... [2023-08-29 20:07:44,970 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:07:44" (1/1) ... [2023-08-29 20:07:44,973 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:07:44" (1/1) ... [2023-08-29 20:07:44,975 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:07:44" (1/1) ... [2023-08-29 20:07:44,977 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:07:44,981 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:07:44,981 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:07:44,981 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:07:44,982 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:07:44" (1/1) ... [2023-08-29 20:07:44,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:07:44,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:07:45,003 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:07:45,024 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:07:45,033 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-08-29 20:07:45,033 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-08-29 20:07:45,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 20:07:45,033 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:07:45,034 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:07:45,034 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:07:45,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:07:45,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-29 20:07:45,034 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:07:45,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:07:45,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:07:45,035 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:07:45,166 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:07:45,168 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:07:45,273 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:07:45,319 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:07:45,319 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-29 20:07:45,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:07:45 BoogieIcfgContainer [2023-08-29 20:07:45,321 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:07:45,322 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:07:45,322 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:07:45,324 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:07:45,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:07:44" (1/3) ... [2023-08-29 20:07:45,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4de519e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:07:45, skipping insertion in model container [2023-08-29 20:07:45,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:07:44" (2/3) ... [2023-08-29 20:07:45,325 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4de519e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:07:45, skipping insertion in model container [2023-08-29 20:07:45,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:07:45" (3/3) ... [2023-08-29 20:07:45,326 INFO L112 eAbstractionObserver]: Analyzing ICFG 40_barrier_vf.i [2023-08-29 20:07:45,336 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:07:45,336 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2023-08-29 20:07:45,336 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:07:45,376 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:07:45,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 55 transitions, 115 flow [2023-08-29 20:07:45,416 INFO L130 PetriNetUnfolder]: 4/70 cut-off events. [2023-08-29 20:07:45,416 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:07:45,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 70 events. 4/70 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 107 event pairs, 0 based on Foata normal form. 0/57 useless extension candidates. Maximal degree in co-relation 39. Up to 4 conditions per place. [2023-08-29 20:07:45,419 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 55 transitions, 115 flow [2023-08-29 20:07:45,421 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 55 transitions, 115 flow [2023-08-29 20:07:45,423 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:07:45,429 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 55 transitions, 115 flow [2023-08-29 20:07:45,431 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 55 transitions, 115 flow [2023-08-29 20:07:45,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 55 transitions, 115 flow [2023-08-29 20:07:45,441 INFO L130 PetriNetUnfolder]: 4/70 cut-off events. [2023-08-29 20:07:45,441 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:07:45,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 70 events. 4/70 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 107 event pairs, 0 based on Foata normal form. 0/57 useless extension candidates. Maximal degree in co-relation 39. Up to 4 conditions per place. [2023-08-29 20:07:45,442 INFO L119 LiptonReduction]: Number of co-enabled transitions 792 [2023-08-29 20:07:47,287 INFO L134 LiptonReduction]: Checked pairs total: 685 [2023-08-29 20:07:47,287 INFO L136 LiptonReduction]: Total number of compositions: 55 [2023-08-29 20:07:47,297 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:07:47,301 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;@3e89f9f4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:07:47,301 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-08-29 20:07:47,302 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-29 20:07:47,303 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:07:47,303 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:07:47,303 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-29 20:07:47,303 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 2 more)] === [2023-08-29 20:07:47,306 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:07:47,306 INFO L85 PathProgramCache]: Analyzing trace with hash 10449, now seen corresponding path program 1 times [2023-08-29 20:07:47,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:07:47,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164746749] [2023-08-29 20:07:47,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:07:47,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:07:47,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:07:47,412 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:07:47,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:07:47,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164746749] [2023-08-29 20:07:47,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164746749] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:07:47,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:07:47,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:07:47,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12829883] [2023-08-29 20:07:47,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:07:47,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:07:47,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:07:47,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:07:47,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:07:47,435 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 110 [2023-08-29 20:07:47,436 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 14 places, 11 transitions, 27 flow. Second operand has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:47,436 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:07:47,436 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 110 [2023-08-29 20:07:47,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:07:47,459 INFO L130 PetriNetUnfolder]: 4/19 cut-off events. [2023-08-29 20:07:47,459 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:07:47,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 19 events. 4/19 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 34 event pairs, 4 based on Foata normal form. 0/13 useless extension candidates. Maximal degree in co-relation 26. Up to 19 conditions per place. [2023-08-29 20:07:47,460 INFO L137 encePairwiseOnDemand]: 107/110 looper letters, 7 selfloop transitions, 0 changer transitions 0/8 dead transitions. [2023-08-29 20:07:47,460 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 12 places, 8 transitions, 35 flow [2023-08-29 20:07:47,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:07:47,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:07:47,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 98 transitions. [2023-08-29 20:07:47,468 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44545454545454544 [2023-08-29 20:07:47,468 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 98 transitions. [2023-08-29 20:07:47,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 98 transitions. [2023-08-29 20:07:47,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:07:47,471 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 98 transitions. [2023-08-29 20:07:47,472 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 49.0) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:47,474 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:47,475 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:47,476 INFO L175 Difference]: Start difference. First operand has 14 places, 11 transitions, 27 flow. Second operand 2 states and 98 transitions. [2023-08-29 20:07:47,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 12 places, 8 transitions, 35 flow [2023-08-29 20:07:47,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 12 places, 8 transitions, 35 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:07:47,478 INFO L231 Difference]: Finished difference. Result has 12 places, 8 transitions, 21 flow [2023-08-29 20:07:47,479 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=21, PETRI_DIFFERENCE_MINUEND_PLACES=11, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=8, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=21, PETRI_PLACES=12, PETRI_TRANSITIONS=8} [2023-08-29 20:07:47,481 INFO L281 CegarLoopForPetriNet]: 14 programPoint places, -2 predicate places. [2023-08-29 20:07:47,481 INFO L495 AbstractCegarLoop]: Abstraction has has 12 places, 8 transitions, 21 flow [2023-08-29 20:07:47,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:47,482 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:07:47,482 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-29 20:07:47,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 20:07:47,482 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 2 more)] === [2023-08-29 20:07:47,483 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:07:47,483 INFO L85 PathProgramCache]: Analyzing trace with hash 10456, now seen corresponding path program 1 times [2023-08-29 20:07:47,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:07:47,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402455830] [2023-08-29 20:07:47,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:07:47,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:07:47,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:07:47,577 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:07:47,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:07:47,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402455830] [2023-08-29 20:07:47,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402455830] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:07:47,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:07:47,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:07:47,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730691835] [2023-08-29 20:07:47,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:07:47,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:07:47,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:07:47,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:07:47,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:07:47,590 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 110 [2023-08-29 20:07:47,590 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 12 places, 8 transitions, 21 flow. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:47,590 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:07:47,590 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 110 [2023-08-29 20:07:47,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:07:47,601 INFO L130 PetriNetUnfolder]: 3/15 cut-off events. [2023-08-29 20:07:47,601 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:07:47,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 15 events. 3/15 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 20 event pairs, 3 based on Foata normal form. 0/12 useless extension candidates. Maximal degree in co-relation 32. Up to 14 conditions per place. [2023-08-29 20:07:47,601 INFO L137 encePairwiseOnDemand]: 108/110 looper letters, 5 selfloop transitions, 1 changer transitions 0/7 dead transitions. [2023-08-29 20:07:47,601 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 13 places, 7 transitions, 31 flow [2023-08-29 20:07:47,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:07:47,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:07:47,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2023-08-29 20:07:47,604 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38484848484848483 [2023-08-29 20:07:47,605 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 127 transitions. [2023-08-29 20:07:47,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 127 transitions. [2023-08-29 20:07:47,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:07:47,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 127 transitions. [2023-08-29 20:07:47,606 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:47,607 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:47,607 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:47,607 INFO L175 Difference]: Start difference. First operand has 12 places, 8 transitions, 21 flow. Second operand 3 states and 127 transitions. [2023-08-29 20:07:47,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 13 places, 7 transitions, 31 flow [2023-08-29 20:07:47,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 13 places, 7 transitions, 31 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:07:47,608 INFO L231 Difference]: Finished difference. Result has 13 places, 7 transitions, 21 flow [2023-08-29 20:07:47,608 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=19, PETRI_DIFFERENCE_MINUEND_PLACES=11, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=7, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=6, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=21, PETRI_PLACES=13, PETRI_TRANSITIONS=7} [2023-08-29 20:07:47,609 INFO L281 CegarLoopForPetriNet]: 14 programPoint places, -1 predicate places. [2023-08-29 20:07:47,609 INFO L495 AbstractCegarLoop]: Abstraction has has 13 places, 7 transitions, 21 flow [2023-08-29 20:07:47,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:47,609 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:07:47,609 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-29 20:07:47,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-29 20:07:47,610 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 2 more)] === [2023-08-29 20:07:47,610 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:07:47,610 INFO L85 PathProgramCache]: Analyzing trace with hash 10455, now seen corresponding path program 1 times [2023-08-29 20:07:47,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:07:47,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401608679] [2023-08-29 20:07:47,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:07:47,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:07:47,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:07:47,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:07:47,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:07:47,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401608679] [2023-08-29 20:07:47,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401608679] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:07:47,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:07:47,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:07:47,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834970415] [2023-08-29 20:07:47,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:07:47,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:07:47,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:07:47,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:07:47,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:07:47,652 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 110 [2023-08-29 20:07:47,652 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 13 places, 7 transitions, 21 flow. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:47,652 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:07:47,652 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 110 [2023-08-29 20:07:47,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:07:47,659 INFO L130 PetriNetUnfolder]: 2/11 cut-off events. [2023-08-29 20:07:47,659 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:07:47,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 11 events. 2/11 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 9 event pairs, 2 based on Foata normal form. 0/11 useless extension candidates. Maximal degree in co-relation 25. Up to 10 conditions per place. [2023-08-29 20:07:47,659 INFO L137 encePairwiseOnDemand]: 108/110 looper letters, 4 selfloop transitions, 1 changer transitions 0/6 dead transitions. [2023-08-29 20:07:47,659 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 14 places, 6 transitions, 29 flow [2023-08-29 20:07:47,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:07:47,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:07:47,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2023-08-29 20:07:47,661 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2023-08-29 20:07:47,661 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 120 transitions. [2023-08-29 20:07:47,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 120 transitions. [2023-08-29 20:07:47,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:07:47,661 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 120 transitions. [2023-08-29 20:07:47,662 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:47,663 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:47,663 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:47,663 INFO L175 Difference]: Start difference. First operand has 13 places, 7 transitions, 21 flow. Second operand 3 states and 120 transitions. [2023-08-29 20:07:47,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 14 places, 6 transitions, 29 flow [2023-08-29 20:07:47,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 13 places, 6 transitions, 28 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:07:47,664 INFO L231 Difference]: Finished difference. Result has 13 places, 6 transitions, 20 flow [2023-08-29 20:07:47,664 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=18, PETRI_DIFFERENCE_MINUEND_PLACES=11, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=6, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=5, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=20, PETRI_PLACES=13, PETRI_TRANSITIONS=6} [2023-08-29 20:07:47,664 INFO L281 CegarLoopForPetriNet]: 14 programPoint places, -1 predicate places. [2023-08-29 20:07:47,664 INFO L495 AbstractCegarLoop]: Abstraction has has 13 places, 6 transitions, 20 flow [2023-08-29 20:07:47,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:47,665 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:07:47,665 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-29 20:07:47,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-29 20:07:47,665 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 2 more)] === [2023-08-29 20:07:47,665 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:07:47,666 INFO L85 PathProgramCache]: Analyzing trace with hash 10054156, now seen corresponding path program 1 times [2023-08-29 20:07:47,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:07:47,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697151287] [2023-08-29 20:07:47,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:07:47,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:07:47,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:07:47,779 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:07:47,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:07:47,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697151287] [2023-08-29 20:07:47,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697151287] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:07:47,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:07:47,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:07:47,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022478099] [2023-08-29 20:07:47,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:07:47,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:07:47,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:07:47,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:07:47,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:07:47,791 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 110 [2023-08-29 20:07:47,791 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 13 places, 6 transitions, 20 flow. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:47,791 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:07:47,791 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 110 [2023-08-29 20:07:47,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:07:47,796 INFO L130 PetriNetUnfolder]: 0/6 cut-off events. [2023-08-29 20:07:47,796 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:07:47,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21 conditions, 6 events. 0/6 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 3/9 useless extension candidates. Maximal degree in co-relation 0. Up to 5 conditions per place. [2023-08-29 20:07:47,796 INFO L137 encePairwiseOnDemand]: 108/110 looper letters, 0 selfloop transitions, 0 changer transitions 5/5 dead transitions. [2023-08-29 20:07:47,796 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 14 places, 5 transitions, 26 flow [2023-08-29 20:07:47,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:07:47,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:07:47,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2023-08-29 20:07:47,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3878787878787879 [2023-08-29 20:07:47,798 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 128 transitions. [2023-08-29 20:07:47,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 128 transitions. [2023-08-29 20:07:47,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:07:47,798 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 128 transitions. [2023-08-29 20:07:47,799 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:47,799 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:47,800 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:47,800 INFO L175 Difference]: Start difference. First operand has 13 places, 6 transitions, 20 flow. Second operand 3 states and 128 transitions. [2023-08-29 20:07:47,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 14 places, 5 transitions, 26 flow [2023-08-29 20:07:47,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 13 places, 5 transitions, 25 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:07:47,800 INFO L231 Difference]: Finished difference. Result has 13 places, 0 transitions, 0 flow [2023-08-29 20:07:47,800 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=17, PETRI_DIFFERENCE_MINUEND_PLACES=11, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=5, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=5, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=13, PETRI_TRANSITIONS=0} [2023-08-29 20:07:47,801 INFO L281 CegarLoopForPetriNet]: 14 programPoint places, -1 predicate places. [2023-08-29 20:07:47,801 INFO L495 AbstractCegarLoop]: Abstraction has has 13 places, 0 transitions, 0 flow [2023-08-29 20:07:47,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:47,803 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 5 remaining) [2023-08-29 20:07:47,803 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2023-08-29 20:07:47,803 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 5 remaining) [2023-08-29 20:07:47,804 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 5 remaining) [2023-08-29 20:07:47,804 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 5 remaining) [2023-08-29 20:07:47,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-29 20:07:47,804 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-08-29 20:07:47,805 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE,SAFE,SAFE (1/2) [2023-08-29 20:07:47,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 55 transitions, 115 flow [2023-08-29 20:07:47,819 INFO L130 PetriNetUnfolder]: 4/70 cut-off events. [2023-08-29 20:07:47,820 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:07:47,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 70 events. 4/70 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 107 event pairs, 0 based on Foata normal form. 0/57 useless extension candidates. Maximal degree in co-relation 39. Up to 4 conditions per place. [2023-08-29 20:07:47,820 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 55 transitions, 115 flow [2023-08-29 20:07:47,821 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 55 transitions, 115 flow [2023-08-29 20:07:47,821 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:07:47,821 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 55 transitions, 115 flow [2023-08-29 20:07:47,821 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 55 transitions, 115 flow [2023-08-29 20:07:47,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 55 transitions, 115 flow [2023-08-29 20:07:47,827 INFO L130 PetriNetUnfolder]: 4/70 cut-off events. [2023-08-29 20:07:47,827 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:07:47,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 70 events. 4/70 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 107 event pairs, 0 based on Foata normal form. 0/57 useless extension candidates. Maximal degree in co-relation 39. Up to 4 conditions per place. [2023-08-29 20:07:47,828 INFO L119 LiptonReduction]: Number of co-enabled transitions 792 [2023-08-29 20:07:49,449 INFO L134 LiptonReduction]: Checked pairs total: 685 [2023-08-29 20:07:49,449 INFO L136 LiptonReduction]: Total number of compositions: 55 [2023-08-29 20:07:49,450 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-29 20:07:49,451 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;@3e89f9f4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:07:49,451 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-29 20:07:49,453 INFO L130 PetriNetUnfolder]: 0/15 cut-off events. [2023-08-29 20:07:49,453 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:07:49,453 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:07:49,454 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-29 20:07:49,454 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-29 20:07:49,454 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:07:49,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1595595406, now seen corresponding path program 1 times [2023-08-29 20:07:49,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:07:49,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075661256] [2023-08-29 20:07:49,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:07:49,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:07:49,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:07:49,461 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:07:49,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:07:49,475 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 20:07:49,475 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:07:49,475 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-29 20:07:49,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-29 20:07:49,476 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-29 20:07:49,476 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-29 20:07:49,477 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-29 20:07:49,477 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-29 20:07:49,486 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:07:49,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 78 transitions, 168 flow [2023-08-29 20:07:49,496 INFO L130 PetriNetUnfolder]: 7/110 cut-off events. [2023-08-29 20:07:49,500 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-29 20:07:49,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 7/110 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 255 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 71. Up to 6 conditions per place. [2023-08-29 20:07:49,502 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 78 transitions, 168 flow [2023-08-29 20:07:49,502 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 78 places, 78 transitions, 168 flow [2023-08-29 20:07:49,503 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:07:49,503 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 78 transitions, 168 flow [2023-08-29 20:07:49,503 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 78 transitions, 168 flow [2023-08-29 20:07:49,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 78 transitions, 168 flow [2023-08-29 20:07:49,511 INFO L130 PetriNetUnfolder]: 7/110 cut-off events. [2023-08-29 20:07:49,512 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-29 20:07:49,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 7/110 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 255 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 71. Up to 6 conditions per place. [2023-08-29 20:07:49,516 INFO L119 LiptonReduction]: Number of co-enabled transitions 2596 [2023-08-29 20:07:50,195 INFO L134 LiptonReduction]: Checked pairs total: 9478 [2023-08-29 20:07:50,195 INFO L136 LiptonReduction]: Total number of compositions: 54 [2023-08-29 20:07:50,197 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:07:50,198 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;@3e89f9f4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:07:50,198 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-08-29 20:07:50,199 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-29 20:07:50,199 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:07:50,199 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:07:50,199 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-29 20:07:50,199 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2023-08-29 20:07:50,200 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:07:50,200 INFO L85 PathProgramCache]: Analyzing trace with hash 17234, now seen corresponding path program 1 times [2023-08-29 20:07:50,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:07:50,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941224887] [2023-08-29 20:07:50,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:07:50,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:07:50,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:07:50,208 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:07:50,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:07:50,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941224887] [2023-08-29 20:07:50,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941224887] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:07:50,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:07:50,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:07:50,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233159988] [2023-08-29 20:07:50,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:07:50,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:07:50,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:07:50,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:07:50,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:07:50,210 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 132 [2023-08-29 20:07:50,211 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 39 transitions, 90 flow. Second operand has 2 states, 2 states have (on average 59.0) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:50,211 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:07:50,211 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 132 [2023-08-29 20:07:50,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:07:50,327 INFO L130 PetriNetUnfolder]: 561/1074 cut-off events. [2023-08-29 20:07:50,327 INFO L131 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2023-08-29 20:07:50,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2015 conditions, 1074 events. 561/1074 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 6973 event pairs, 485 based on Foata normal form. 0/797 useless extension candidates. Maximal degree in co-relation 824. Up to 902 conditions per place. [2023-08-29 20:07:50,334 INFO L137 encePairwiseOnDemand]: 128/132 looper letters, 22 selfloop transitions, 0 changer transitions 0/35 dead transitions. [2023-08-29 20:07:50,334 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 35 transitions, 126 flow [2023-08-29 20:07:50,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:07:50,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:07:50,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 142 transitions. [2023-08-29 20:07:50,338 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5378787878787878 [2023-08-29 20:07:50,338 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 142 transitions. [2023-08-29 20:07:50,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 142 transitions. [2023-08-29 20:07:50,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:07:50,339 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 142 transitions. [2023-08-29 20:07:50,341 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 71.0) internal successors, (142), 2 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:50,342 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:50,342 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:50,343 INFO L175 Difference]: Start difference. First operand has 42 places, 39 transitions, 90 flow. Second operand 2 states and 142 transitions. [2023-08-29 20:07:50,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 35 transitions, 126 flow [2023-08-29 20:07:50,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 35 transitions, 124 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-29 20:07:50,347 INFO L231 Difference]: Finished difference. Result has 39 places, 35 transitions, 80 flow [2023-08-29 20:07:50,347 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=80, PETRI_PLACES=39, PETRI_TRANSITIONS=35} [2023-08-29 20:07:50,348 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2023-08-29 20:07:50,348 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 35 transitions, 80 flow [2023-08-29 20:07:50,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 59.0) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:50,348 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:07:50,349 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-29 20:07:50,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-29 20:07:50,349 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2023-08-29 20:07:50,349 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:07:50,349 INFO L85 PathProgramCache]: Analyzing trace with hash 17241, now seen corresponding path program 1 times [2023-08-29 20:07:50,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:07:50,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554725095] [2023-08-29 20:07:50,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:07:50,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:07:50,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:07:50,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:07:50,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:07:50,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554725095] [2023-08-29 20:07:50,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554725095] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:07:50,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:07:50,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:07:50,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854207195] [2023-08-29 20:07:50,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:07:50,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:07:50,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:07:50,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:07:50,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:07:50,407 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 132 [2023-08-29 20:07:50,407 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 35 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:50,407 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:07:50,408 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 132 [2023-08-29 20:07:50,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:07:50,459 INFO L130 PetriNetUnfolder]: 402/791 cut-off events. [2023-08-29 20:07:50,459 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2023-08-29 20:07:50,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1484 conditions, 791 events. 402/791 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4845 event pairs, 345 based on Foata normal form. 0/623 useless extension candidates. Maximal degree in co-relation 1479. Up to 657 conditions per place. [2023-08-29 20:07:50,462 INFO L137 encePairwiseOnDemand]: 130/132 looper letters, 20 selfloop transitions, 1 changer transitions 0/34 dead transitions. [2023-08-29 20:07:50,462 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 34 transitions, 120 flow [2023-08-29 20:07:50,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:07:50,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:07:50,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 178 transitions. [2023-08-29 20:07:50,463 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4494949494949495 [2023-08-29 20:07:50,463 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 178 transitions. [2023-08-29 20:07:50,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 178 transitions. [2023-08-29 20:07:50,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:07:50,463 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 178 transitions. [2023-08-29 20:07:50,463 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:50,464 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:50,464 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:50,464 INFO L175 Difference]: Start difference. First operand has 39 places, 35 transitions, 80 flow. Second operand 3 states and 178 transitions. [2023-08-29 20:07:50,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 34 transitions, 120 flow [2023-08-29 20:07:50,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 34 transitions, 120 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:07:50,465 INFO L231 Difference]: Finished difference. Result has 40 places, 34 transitions, 80 flow [2023-08-29 20:07:50,465 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=40, PETRI_TRANSITIONS=34} [2023-08-29 20:07:50,466 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -2 predicate places. [2023-08-29 20:07:50,466 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 80 flow [2023-08-29 20:07:50,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:50,466 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:07:50,466 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-29 20:07:50,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-29 20:07:50,466 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2023-08-29 20:07:50,466 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:07:50,466 INFO L85 PathProgramCache]: Analyzing trace with hash 17242, now seen corresponding path program 1 times [2023-08-29 20:07:50,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:07:50,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899140786] [2023-08-29 20:07:50,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:07:50,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:07:50,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:07:50,497 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:07:50,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:07:50,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899140786] [2023-08-29 20:07:50,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899140786] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:07:50,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:07:50,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:07:50,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338839296] [2023-08-29 20:07:50,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:07:50,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:07:50,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:07:50,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:07:50,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:07:50,509 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 132 [2023-08-29 20:07:50,509 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:50,509 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:07:50,509 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 132 [2023-08-29 20:07:50,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:07:50,561 INFO L130 PetriNetUnfolder]: 243/508 cut-off events. [2023-08-29 20:07:50,562 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2023-08-29 20:07:50,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 959 conditions, 508 events. 243/508 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2850 event pairs, 205 based on Foata normal form. 0/449 useless extension candidates. Maximal degree in co-relation 953. Up to 413 conditions per place. [2023-08-29 20:07:50,563 INFO L137 encePairwiseOnDemand]: 130/132 looper letters, 19 selfloop transitions, 1 changer transitions 0/33 dead transitions. [2023-08-29 20:07:50,563 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 33 transitions, 118 flow [2023-08-29 20:07:50,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:07:50,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:07:50,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 183 transitions. [2023-08-29 20:07:50,564 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4621212121212121 [2023-08-29 20:07:50,565 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 183 transitions. [2023-08-29 20:07:50,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 183 transitions. [2023-08-29 20:07:50,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:07:50,565 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 183 transitions. [2023-08-29 20:07:50,565 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:50,567 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:50,567 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:50,567 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 80 flow. Second operand 3 states and 183 transitions. [2023-08-29 20:07:50,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 33 transitions, 118 flow [2023-08-29 20:07:50,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 33 transitions, 117 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:07:50,569 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 79 flow [2023-08-29 20:07:50,569 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=79, PETRI_PLACES=40, PETRI_TRANSITIONS=33} [2023-08-29 20:07:50,570 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -2 predicate places. [2023-08-29 20:07:50,570 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 79 flow [2023-08-29 20:07:50,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:50,570 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:07:50,570 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:07:50,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-29 20:07:50,571 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2023-08-29 20:07:50,571 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:07:50,571 INFO L85 PathProgramCache]: Analyzing trace with hash -560510734, now seen corresponding path program 1 times [2023-08-29 20:07:50,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:07:50,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358074878] [2023-08-29 20:07:50,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:07:50,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:07:50,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:07:50,630 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:07:50,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:07:50,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358074878] [2023-08-29 20:07:50,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358074878] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:07:50,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:07:50,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:07:50,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577532494] [2023-08-29 20:07:50,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:07:50,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:07:50,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:07:50,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:07:50,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:07:50,649 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 132 [2023-08-29 20:07:50,649 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 79 flow. Second operand has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:50,649 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:07:50,649 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 132 [2023-08-29 20:07:50,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:07:50,804 INFO L130 PetriNetUnfolder]: 661/1247 cut-off events. [2023-08-29 20:07:50,805 INFO L131 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2023-08-29 20:07:50,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2440 conditions, 1247 events. 661/1247 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 8017 event pairs, 95 based on Foata normal form. 0/1180 useless extension candidates. Maximal degree in co-relation 2434. Up to 457 conditions per place. [2023-08-29 20:07:50,809 INFO L137 encePairwiseOnDemand]: 123/132 looper letters, 73 selfloop transitions, 18 changer transitions 0/99 dead transitions. [2023-08-29 20:07:50,809 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 99 transitions, 408 flow [2023-08-29 20:07:50,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:07:50,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:07:50,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 433 transitions. [2023-08-29 20:07:50,811 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4686147186147186 [2023-08-29 20:07:50,811 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 433 transitions. [2023-08-29 20:07:50,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 433 transitions. [2023-08-29 20:07:50,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:07:50,811 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 433 transitions. [2023-08-29 20:07:50,812 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 61.857142857142854) internal successors, (433), 7 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:50,813 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 132.0) internal successors, (1056), 8 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:50,813 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 132.0) internal successors, (1056), 8 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:50,813 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 79 flow. Second operand 7 states and 433 transitions. [2023-08-29 20:07:50,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 99 transitions, 408 flow [2023-08-29 20:07:50,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 99 transitions, 407 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:07:50,817 INFO L231 Difference]: Finished difference. Result has 51 places, 50 transitions, 210 flow [2023-08-29 20:07:50,817 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=210, PETRI_PLACES=51, PETRI_TRANSITIONS=50} [2023-08-29 20:07:50,819 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 9 predicate places. [2023-08-29 20:07:50,819 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 50 transitions, 210 flow [2023-08-29 20:07:50,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:50,819 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:07:50,819 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:07:50,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-29 20:07:50,819 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2023-08-29 20:07:50,820 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:07:50,820 INFO L85 PathProgramCache]: Analyzing trace with hash -862834731, now seen corresponding path program 1 times [2023-08-29 20:07:50,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:07:50,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834983725] [2023-08-29 20:07:50,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:07:50,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:07:50,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:07:50,974 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:07:50,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:07:50,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834983725] [2023-08-29 20:07:50,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834983725] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:07:50,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:07:50,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:07:50,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930490493] [2023-08-29 20:07:50,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:07:50,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:07:50,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:07:50,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:07:50,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:07:50,982 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 132 [2023-08-29 20:07:50,982 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 50 transitions, 210 flow. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:50,983 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:07:50,983 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 132 [2023-08-29 20:07:50,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:07:51,062 INFO L130 PetriNetUnfolder]: 416/837 cut-off events. [2023-08-29 20:07:51,063 INFO L131 PetriNetUnfolder]: For 454/482 co-relation queries the response was YES. [2023-08-29 20:07:51,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1989 conditions, 837 events. 416/837 cut-off events. For 454/482 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5108 event pairs, 177 based on Foata normal form. 59/858 useless extension candidates. Maximal degree in co-relation 1978. Up to 395 conditions per place. [2023-08-29 20:07:51,066 INFO L137 encePairwiseOnDemand]: 125/132 looper letters, 41 selfloop transitions, 5 changer transitions 0/67 dead transitions. [2023-08-29 20:07:51,066 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 67 transitions, 364 flow [2023-08-29 20:07:51,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:07:51,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:07:51,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 199 transitions. [2023-08-29 20:07:51,067 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5025252525252525 [2023-08-29 20:07:51,067 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 199 transitions. [2023-08-29 20:07:51,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 199 transitions. [2023-08-29 20:07:51,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:07:51,067 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 199 transitions. [2023-08-29 20:07:51,067 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:51,068 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:51,068 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:51,068 INFO L175 Difference]: Start difference. First operand has 51 places, 50 transitions, 210 flow. Second operand 3 states and 199 transitions. [2023-08-29 20:07:51,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 67 transitions, 364 flow [2023-08-29 20:07:51,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 67 transitions, 364 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:07:51,070 INFO L231 Difference]: Finished difference. Result has 54 places, 52 transitions, 237 flow [2023-08-29 20:07:51,070 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=237, PETRI_PLACES=54, PETRI_TRANSITIONS=52} [2023-08-29 20:07:51,071 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 12 predicate places. [2023-08-29 20:07:51,071 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 52 transitions, 237 flow [2023-08-29 20:07:51,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:51,071 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:07:51,071 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:07:51,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-29 20:07:51,071 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2023-08-29 20:07:51,071 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:07:51,072 INFO L85 PathProgramCache]: Analyzing trace with hash -435014745, now seen corresponding path program 1 times [2023-08-29 20:07:51,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:07:51,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981544198] [2023-08-29 20:07:51,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:07:51,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:07:51,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:07:51,114 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 20:07:51,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:07:51,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981544198] [2023-08-29 20:07:51,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981544198] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:07:51,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:07:51,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:07:51,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548132701] [2023-08-29 20:07:51,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:07:51,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:07:51,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:07:51,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:07:51,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:07:51,134 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 132 [2023-08-29 20:07:51,134 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 52 transitions, 237 flow. Second operand has 5 states, 5 states have (on average 50.2) internal successors, (251), 5 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:07:51,134 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:07:51,134 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 132 [2023-08-29 20:07:51,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:07:51,249 INFO L130 PetriNetUnfolder]: 332/644 cut-off events. [2023-08-29 20:07:51,249 INFO L131 PetriNetUnfolder]: For 415/433 co-relation queries the response was YES. [2023-08-29 20:07:51,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1691 conditions, 644 events. 332/644 cut-off events. For 415/433 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3561 event pairs, 99 based on Foata normal form. 26/657 useless extension candidates. Maximal degree in co-relation 1678. Up to 279 conditions per place. [2023-08-29 20:07:51,251 INFO L137 encePairwiseOnDemand]: 123/132 looper letters, 56 selfloop transitions, 14 changer transitions 11/92 dead transitions. [2023-08-29 20:07:51,252 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 92 transitions, 526 flow [2023-08-29 20:07:51,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:07:51,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:07:51,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 409 transitions. [2023-08-29 20:07:51,253 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44264069264069267 [2023-08-29 20:07:51,253 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 409 transitions. [2023-08-29 20:07:51,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 409 transitions. [2023-08-29 20:07:51,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:07:51,253 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 409 transitions. [2023-08-29 20:07:51,254 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 58.42857142857143) internal successors, (409), 7 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:51,255 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 132.0) internal successors, (1056), 8 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:51,255 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 132.0) internal successors, (1056), 8 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:51,255 INFO L175 Difference]: Start difference. First operand has 54 places, 52 transitions, 237 flow. Second operand 7 states and 409 transitions. [2023-08-29 20:07:51,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 92 transitions, 526 flow [2023-08-29 20:07:51,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 92 transitions, 521 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:07:51,258 INFO L231 Difference]: Finished difference. Result has 63 places, 55 transitions, 292 flow [2023-08-29 20:07:51,258 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=292, PETRI_PLACES=63, PETRI_TRANSITIONS=55} [2023-08-29 20:07:51,258 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 21 predicate places. [2023-08-29 20:07:51,258 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 55 transitions, 292 flow [2023-08-29 20:07:51,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.2) internal successors, (251), 5 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:07:51,258 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:07:51,258 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:07:51,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-29 20:07:51,259 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2023-08-29 20:07:51,259 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:07:51,259 INFO L85 PathProgramCache]: Analyzing trace with hash -127818097, now seen corresponding path program 1 times [2023-08-29 20:07:51,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:07:51,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677215937] [2023-08-29 20:07:51,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:07:51,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:07:51,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:07:51,321 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 20:07:51,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:07:51,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677215937] [2023-08-29 20:07:51,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677215937] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:07:51,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:07:51,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:07:51,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976487238] [2023-08-29 20:07:51,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:07:51,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:07:51,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:07:51,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:07:51,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:07:51,353 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 132 [2023-08-29 20:07:51,353 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 55 transitions, 292 flow. Second operand has 7 states, 7 states have (on average 47.0) internal successors, (329), 7 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:51,353 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:07:51,353 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 132 [2023-08-29 20:07:51,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:07:51,523 INFO L130 PetriNetUnfolder]: 268/530 cut-off events. [2023-08-29 20:07:51,524 INFO L131 PetriNetUnfolder]: For 692/706 co-relation queries the response was YES. [2023-08-29 20:07:51,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1495 conditions, 530 events. 268/530 cut-off events. For 692/706 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2768 event pairs, 104 based on Foata normal form. 12/537 useless extension candidates. Maximal degree in co-relation 1478. Up to 266 conditions per place. [2023-08-29 20:07:51,526 INFO L137 encePairwiseOnDemand]: 121/132 looper letters, 40 selfloop transitions, 5 changer transitions 34/88 dead transitions. [2023-08-29 20:07:51,526 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 88 transitions, 519 flow [2023-08-29 20:07:51,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-29 20:07:51,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-29 20:07:51,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 620 transitions. [2023-08-29 20:07:51,528 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39141414141414144 [2023-08-29 20:07:51,528 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 620 transitions. [2023-08-29 20:07:51,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 620 transitions. [2023-08-29 20:07:51,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:07:51,529 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 620 transitions. [2023-08-29 20:07:51,530 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 51.666666666666664) internal successors, (620), 12 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:51,531 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 132.0) internal successors, (1716), 13 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:51,531 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 132.0) internal successors, (1716), 13 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:51,531 INFO L175 Difference]: Start difference. First operand has 63 places, 55 transitions, 292 flow. Second operand 12 states and 620 transitions. [2023-08-29 20:07:51,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 88 transitions, 519 flow [2023-08-29 20:07:51,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 88 transitions, 493 flow, removed 6 selfloop flow, removed 5 redundant places. [2023-08-29 20:07:51,534 INFO L231 Difference]: Finished difference. Result has 69 places, 42 transitions, 193 flow [2023-08-29 20:07:51,534 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=193, PETRI_PLACES=69, PETRI_TRANSITIONS=42} [2023-08-29 20:07:51,535 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 27 predicate places. [2023-08-29 20:07:51,535 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 42 transitions, 193 flow [2023-08-29 20:07:51,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 47.0) internal successors, (329), 7 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:51,535 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:07:51,535 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:07:51,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-29 20:07:51,535 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2023-08-29 20:07:51,536 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:07:51,536 INFO L85 PathProgramCache]: Analyzing trace with hash -27654782, now seen corresponding path program 1 times [2023-08-29 20:07:51,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:07:51,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930176621] [2023-08-29 20:07:51,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:07:51,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:07:51,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:07:51,600 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 20:07:51,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:07:51,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930176621] [2023-08-29 20:07:51,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930176621] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:07:51,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:07:51,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:07:51,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838431727] [2023-08-29 20:07:51,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:07:51,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:07:51,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:07:51,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:07:51,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:07:51,637 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 132 [2023-08-29 20:07:51,638 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 42 transitions, 193 flow. Second operand has 7 states, 7 states have (on average 47.0) internal successors, (329), 7 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:51,638 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:07:51,638 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 132 [2023-08-29 20:07:51,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:07:51,752 INFO L130 PetriNetUnfolder]: 51/113 cut-off events. [2023-08-29 20:07:51,753 INFO L131 PetriNetUnfolder]: For 74/74 co-relation queries the response was YES. [2023-08-29 20:07:51,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 302 conditions, 113 events. 51/113 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 366 event pairs, 7 based on Foata normal form. 12/122 useless extension candidates. Maximal degree in co-relation 289. Up to 27 conditions per place. [2023-08-29 20:07:51,754 INFO L137 encePairwiseOnDemand]: 123/132 looper letters, 0 selfloop transitions, 0 changer transitions 39/39 dead transitions. [2023-08-29 20:07:51,754 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 39 transitions, 204 flow [2023-08-29 20:07:51,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-29 20:07:51,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-29 20:07:51,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 580 transitions. [2023-08-29 20:07:51,757 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3661616161616162 [2023-08-29 20:07:51,757 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 580 transitions. [2023-08-29 20:07:51,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 580 transitions. [2023-08-29 20:07:51,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:07:51,758 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 580 transitions. [2023-08-29 20:07:51,761 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 48.333333333333336) internal successors, (580), 12 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:51,763 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 132.0) internal successors, (1716), 13 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:51,763 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 132.0) internal successors, (1716), 13 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:51,764 INFO L175 Difference]: Start difference. First operand has 69 places, 42 transitions, 193 flow. Second operand 12 states and 580 transitions. [2023-08-29 20:07:51,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 39 transitions, 204 flow [2023-08-29 20:07:51,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 39 transitions, 174 flow, removed 2 selfloop flow, removed 11 redundant places. [2023-08-29 20:07:51,764 INFO L231 Difference]: Finished difference. Result has 42 places, 0 transitions, 0 flow [2023-08-29 20:07:51,765 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=59, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=0, PETRI_PLACES=42, PETRI_TRANSITIONS=0} [2023-08-29 20:07:51,766 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2023-08-29 20:07:51,766 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 0 transitions, 0 flow [2023-08-29 20:07:51,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 47.0) internal successors, (329), 7 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:51,766 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 6 remaining) [2023-08-29 20:07:51,766 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2023-08-29 20:07:51,767 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2023-08-29 20:07:51,767 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (2 of 6 remaining) [2023-08-29 20:07:51,767 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 6 remaining) [2023-08-29 20:07:51,767 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 6 remaining) [2023-08-29 20:07:51,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-29 20:07:51,767 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:07:51,768 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (1/2) [2023-08-29 20:07:51,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 78 transitions, 168 flow [2023-08-29 20:07:51,779 INFO L130 PetriNetUnfolder]: 7/110 cut-off events. [2023-08-29 20:07:51,779 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-29 20:07:51,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 7/110 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 255 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 71. Up to 6 conditions per place. [2023-08-29 20:07:51,780 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 78 transitions, 168 flow [2023-08-29 20:07:51,780 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 78 places, 78 transitions, 168 flow [2023-08-29 20:07:51,780 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:07:51,781 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 78 transitions, 168 flow [2023-08-29 20:07:51,781 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 78 transitions, 168 flow [2023-08-29 20:07:51,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 78 transitions, 168 flow [2023-08-29 20:07:51,787 INFO L130 PetriNetUnfolder]: 7/110 cut-off events. [2023-08-29 20:07:51,788 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-29 20:07:51,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 7/110 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 255 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 71. Up to 6 conditions per place. [2023-08-29 20:07:51,789 INFO L119 LiptonReduction]: Number of co-enabled transitions 2596 [2023-08-29 20:07:52,449 INFO L134 LiptonReduction]: Checked pairs total: 9478 [2023-08-29 20:07:52,449 INFO L136 LiptonReduction]: Total number of compositions: 54 [2023-08-29 20:07:52,450 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-29 20:07:52,450 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;@3e89f9f4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:07:52,450 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-29 20:07:52,453 INFO L130 PetriNetUnfolder]: 1/37 cut-off events. [2023-08-29 20:07:52,453 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-29 20:07:52,453 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:07:52,453 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-29 20:07:52,453 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-29 20:07:52,453 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:07:52,453 INFO L85 PathProgramCache]: Analyzing trace with hash -2008030538, now seen corresponding path program 1 times [2023-08-29 20:07:52,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:07:52,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101550620] [2023-08-29 20:07:52,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:07:52,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:07:52,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:07:52,462 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:07:52,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:07:52,474 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 20:07:52,474 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:07:52,474 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-29 20:07:52,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-29 20:07:52,474 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-29 20:07:52,475 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-29 20:07:52,475 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-29 20:07:52,475 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-08-29 20:07:52,494 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:07:52,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 101 transitions, 223 flow [2023-08-29 20:07:52,504 INFO L130 PetriNetUnfolder]: 10/150 cut-off events. [2023-08-29 20:07:52,504 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2023-08-29 20:07:52,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 150 events. 10/150 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 400 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 114. Up to 8 conditions per place. [2023-08-29 20:07:52,505 INFO L82 GeneralOperation]: Start removeDead. Operand has 101 places, 101 transitions, 223 flow [2023-08-29 20:07:52,506 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 101 transitions, 223 flow [2023-08-29 20:07:52,506 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:07:52,506 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 101 transitions, 223 flow [2023-08-29 20:07:52,506 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 101 transitions, 223 flow [2023-08-29 20:07:52,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 101 transitions, 223 flow [2023-08-29 20:07:52,514 INFO L130 PetriNetUnfolder]: 10/150 cut-off events. [2023-08-29 20:07:52,514 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2023-08-29 20:07:52,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 150 events. 10/150 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 400 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 114. Up to 8 conditions per place. [2023-08-29 20:07:52,517 INFO L119 LiptonReduction]: Number of co-enabled transitions 5412 [2023-08-29 20:07:53,288 INFO L134 LiptonReduction]: Checked pairs total: 20068 [2023-08-29 20:07:53,288 INFO L136 LiptonReduction]: Total number of compositions: 66 [2023-08-29 20:07:53,289 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:07:53,289 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;@3e89f9f4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:07:53,290 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-29 20:07:53,290 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-29 20:07:53,290 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:07:53,290 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:07:53,290 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-29 20:07:53,290 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2023-08-29 20:07:53,291 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:07:53,291 INFO L85 PathProgramCache]: Analyzing trace with hash 25040, now seen corresponding path program 1 times [2023-08-29 20:07:53,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:07:53,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772414346] [2023-08-29 20:07:53,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:07:53,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:07:53,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:07:53,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:07:53,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:07:53,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772414346] [2023-08-29 20:07:53,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772414346] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:07:53,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:07:53,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:07:53,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312327966] [2023-08-29 20:07:53,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:07:53,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:07:53,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:07:53,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:07:53,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:07:53,306 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 167 [2023-08-29 20:07:53,306 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 54 transitions, 129 flow. Second operand has 2 states, 2 states have (on average 73.0) internal successors, (146), 2 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:53,306 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:07:53,306 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 167 [2023-08-29 20:07:53,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:07:53,970 INFO L130 PetriNetUnfolder]: 7162/11374 cut-off events. [2023-08-29 20:07:53,971 INFO L131 PetriNetUnfolder]: For 529/529 co-relation queries the response was YES. [2023-08-29 20:07:53,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21671 conditions, 11374 events. 7162/11374 cut-off events. For 529/529 co-relation queries the response was YES. Maximal size of possible extension queue 656. Compared 85358 event pairs, 6210 based on Foata normal form. 0/9152 useless extension candidates. Maximal degree in co-relation 1818. Up to 9879 conditions per place. [2023-08-29 20:07:54,015 INFO L137 encePairwiseOnDemand]: 162/167 looper letters, 30 selfloop transitions, 0 changer transitions 0/49 dead transitions. [2023-08-29 20:07:54,015 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 49 transitions, 179 flow [2023-08-29 20:07:54,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:07:54,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:07:54,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 179 transitions. [2023-08-29 20:07:54,016 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5359281437125748 [2023-08-29 20:07:54,016 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 179 transitions. [2023-08-29 20:07:54,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 179 transitions. [2023-08-29 20:07:54,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:07:54,017 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 179 transitions. [2023-08-29 20:07:54,017 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 89.5) internal successors, (179), 2 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:54,017 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:54,018 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:54,018 INFO L175 Difference]: Start difference. First operand has 58 places, 54 transitions, 129 flow. Second operand 2 states and 179 transitions. [2023-08-29 20:07:54,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 49 transitions, 179 flow [2023-08-29 20:07:54,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 49 transitions, 173 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-08-29 20:07:54,019 INFO L231 Difference]: Finished difference. Result has 54 places, 49 transitions, 113 flow [2023-08-29 20:07:54,019 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=113, PETRI_PLACES=54, PETRI_TRANSITIONS=49} [2023-08-29 20:07:54,020 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -4 predicate places. [2023-08-29 20:07:54,020 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 49 transitions, 113 flow [2023-08-29 20:07:54,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 73.0) internal successors, (146), 2 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:54,020 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:07:54,020 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-29 20:07:54,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-29 20:07:54,020 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2023-08-29 20:07:54,021 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:07:54,021 INFO L85 PathProgramCache]: Analyzing trace with hash 25049, now seen corresponding path program 1 times [2023-08-29 20:07:54,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:07:54,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068340393] [2023-08-29 20:07:54,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:07:54,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:07:54,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:07:54,032 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:07:54,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:07:54,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068340393] [2023-08-29 20:07:54,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068340393] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:07:54,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:07:54,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:07:54,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496885614] [2023-08-29 20:07:54,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:07:54,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:07:54,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:07:54,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:07:54,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:07:54,045 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 167 [2023-08-29 20:07:54,045 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 49 transitions, 113 flow. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:54,045 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:07:54,045 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 167 [2023-08-29 20:07:54,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:07:54,542 INFO L130 PetriNetUnfolder]: 5221/8413 cut-off events. [2023-08-29 20:07:54,542 INFO L131 PetriNetUnfolder]: For 213/213 co-relation queries the response was YES. [2023-08-29 20:07:54,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15944 conditions, 8413 events. 5221/8413 cut-off events. For 213/213 co-relation queries the response was YES. Maximal size of possible extension queue 486. Compared 61361 event pairs, 4507 based on Foata normal form. 0/7063 useless extension candidates. Maximal degree in co-relation 15938. Up to 7258 conditions per place. [2023-08-29 20:07:54,571 INFO L137 encePairwiseOnDemand]: 165/167 looper letters, 28 selfloop transitions, 1 changer transitions 0/48 dead transitions. [2023-08-29 20:07:54,571 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 48 transitions, 169 flow [2023-08-29 20:07:54,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:07:54,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:07:54,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 228 transitions. [2023-08-29 20:07:54,572 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4550898203592814 [2023-08-29 20:07:54,572 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 228 transitions. [2023-08-29 20:07:54,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 228 transitions. [2023-08-29 20:07:54,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:07:54,573 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 228 transitions. [2023-08-29 20:07:54,573 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:54,574 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 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:07:54,574 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 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:07:54,574 INFO L175 Difference]: Start difference. First operand has 54 places, 49 transitions, 113 flow. Second operand 3 states and 228 transitions. [2023-08-29 20:07:54,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 48 transitions, 169 flow [2023-08-29 20:07:54,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 48 transitions, 169 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:07:54,575 INFO L231 Difference]: Finished difference. Result has 55 places, 48 transitions, 113 flow [2023-08-29 20:07:54,575 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=113, PETRI_PLACES=55, PETRI_TRANSITIONS=48} [2023-08-29 20:07:54,576 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places. [2023-08-29 20:07:54,576 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 113 flow [2023-08-29 20:07:54,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:54,576 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:07:54,576 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-29 20:07:54,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-29 20:07:54,576 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2023-08-29 20:07:54,577 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:07:54,577 INFO L85 PathProgramCache]: Analyzing trace with hash 25050, now seen corresponding path program 1 times [2023-08-29 20:07:54,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:07:54,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88566590] [2023-08-29 20:07:54,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:07:54,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:07:54,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:07:54,592 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:07:54,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:07:54,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88566590] [2023-08-29 20:07:54,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88566590] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:07:54,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:07:54,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:07:54,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571443237] [2023-08-29 20:07:54,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:07:54,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:07:54,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:07:54,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:07:54,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:07:54,603 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 167 [2023-08-29 20:07:54,603 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 48 transitions, 113 flow. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:54,603 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:07:54,603 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 167 [2023-08-29 20:07:54,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:07:54,920 INFO L130 PetriNetUnfolder]: 3280/5452 cut-off events. [2023-08-29 20:07:54,921 INFO L131 PetriNetUnfolder]: For 213/213 co-relation queries the response was YES. [2023-08-29 20:07:54,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10365 conditions, 5452 events. 3280/5452 cut-off events. For 213/213 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 38200 event pairs, 2804 based on Foata normal form. 0/4974 useless extension candidates. Maximal degree in co-relation 10358. Up to 4638 conditions per place. [2023-08-29 20:07:54,936 INFO L137 encePairwiseOnDemand]: 165/167 looper letters, 27 selfloop transitions, 1 changer transitions 0/47 dead transitions. [2023-08-29 20:07:54,937 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 47 transitions, 167 flow [2023-08-29 20:07:54,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:07:54,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:07:54,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 233 transitions. [2023-08-29 20:07:54,938 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46506986027944114 [2023-08-29 20:07:54,938 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 233 transitions. [2023-08-29 20:07:54,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 233 transitions. [2023-08-29 20:07:54,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:07:54,938 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 233 transitions. [2023-08-29 20:07:54,939 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:54,939 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 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:07:54,940 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 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:07:54,940 INFO L175 Difference]: Start difference. First operand has 55 places, 48 transitions, 113 flow. Second operand 3 states and 233 transitions. [2023-08-29 20:07:54,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 47 transitions, 167 flow [2023-08-29 20:07:54,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 47 transitions, 166 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:07:54,941 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 112 flow [2023-08-29 20:07:54,941 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=55, PETRI_TRANSITIONS=47} [2023-08-29 20:07:54,941 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places. [2023-08-29 20:07:54,941 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 47 transitions, 112 flow [2023-08-29 20:07:54,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:54,942 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:07:54,942 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:07:54,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-29 20:07:54,942 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2023-08-29 20:07:54,942 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:07:54,942 INFO L85 PathProgramCache]: Analyzing trace with hash 916764677, now seen corresponding path program 1 times [2023-08-29 20:07:54,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:07:54,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592191974] [2023-08-29 20:07:54,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:07:54,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:07:54,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:07:54,978 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:07:54,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:07:54,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592191974] [2023-08-29 20:07:54,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592191974] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:07:54,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:07:54,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:07:54,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579951855] [2023-08-29 20:07:54,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:07:54,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:07:54,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:07:54,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:07:54,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:07:55,009 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 167 [2023-08-29 20:07:55,010 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 47 transitions, 112 flow. Second operand has 5 states, 5 states have (on average 61.0) internal successors, (305), 5 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:55,010 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:07:55,010 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 167 [2023-08-29 20:07:55,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:07:56,183 INFO L130 PetriNetUnfolder]: 12355/19121 cut-off events. [2023-08-29 20:07:56,183 INFO L131 PetriNetUnfolder]: For 657/657 co-relation queries the response was YES. [2023-08-29 20:07:56,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37606 conditions, 19121 events. 12355/19121 cut-off events. For 657/657 co-relation queries the response was YES. Maximal size of possible extension queue 1107. Compared 144714 event pairs, 2185 based on Foata normal form. 280/18732 useless extension candidates. Maximal degree in co-relation 37599. Up to 7379 conditions per place. [2023-08-29 20:07:56,275 INFO L137 encePairwiseOnDemand]: 155/167 looper letters, 130 selfloop transitions, 26 changer transitions 0/168 dead transitions. [2023-08-29 20:07:56,275 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 168 transitions, 706 flow [2023-08-29 20:07:56,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:07:56,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:07:56,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 580 transitions. [2023-08-29 20:07:56,277 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49615055603079555 [2023-08-29 20:07:56,277 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 580 transitions. [2023-08-29 20:07:56,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 580 transitions. [2023-08-29 20:07:56,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:07:56,278 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 580 transitions. [2023-08-29 20:07:56,279 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 82.85714285714286) internal successors, (580), 7 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:56,281 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 167.0) internal successors, (1336), 8 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:56,281 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 167.0) internal successors, (1336), 8 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:56,281 INFO L175 Difference]: Start difference. First operand has 55 places, 47 transitions, 112 flow. Second operand 7 states and 580 transitions. [2023-08-29 20:07:56,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 168 transitions, 706 flow [2023-08-29 20:07:56,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 168 transitions, 705 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:07:56,286 INFO L231 Difference]: Finished difference. Result has 66 places, 77 transitions, 325 flow [2023-08-29 20:07:56,286 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=325, PETRI_PLACES=66, PETRI_TRANSITIONS=77} [2023-08-29 20:07:56,286 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 8 predicate places. [2023-08-29 20:07:56,286 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 77 transitions, 325 flow [2023-08-29 20:07:56,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 61.0) internal successors, (305), 5 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:56,287 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:07:56,287 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:07:56,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-29 20:07:56,287 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2023-08-29 20:07:56,287 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:07:56,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1459606408, now seen corresponding path program 1 times [2023-08-29 20:07:56,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:07:56,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062645536] [2023-08-29 20:07:56,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:07:56,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:07:56,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:07:56,482 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:07:56,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:07:56,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062645536] [2023-08-29 20:07:56,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062645536] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:07:56,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:07:56,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:07:56,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881256742] [2023-08-29 20:07:56,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:07:56,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:07:56,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:07:56,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:07:56,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:07:56,489 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 167 [2023-08-29 20:07:56,489 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 77 transitions, 325 flow. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:56,489 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:07:56,489 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 167 [2023-08-29 20:07:56,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:07:57,195 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([713] L719-1-->L724: Formula: (not (= 3 (mod v_~count~0_149 4294967296))) InVars {~count~0=v_~count~0_149} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_149} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [Black: 118#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), 113#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 121#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), thr1Thread1of3ForFork0InUse, Black: 119#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 104#true, 88#L724true, 133#(= ~COND~0 0), 109#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 115#true, 15#L724-5true, 12#L733-5true, 11#L725true, Black: 123#(and (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 117#(= ~count~0 0)]) [2023-08-29 20:07:57,196 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-29 20:07:57,196 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-29 20:07:57,196 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-29 20:07:57,196 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-29 20:07:57,200 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([712] L719-1-->L721: Formula: (= (mod v_~count~0_147 4294967296) 3) InVars {~count~0=v_~count~0_147} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_147} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [Black: 118#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), 113#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 121#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), thr1Thread1of3ForFork0InUse, Black: 119#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 104#true, 84#L721true, 133#(= ~COND~0 0), 109#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 115#true, 15#L724-5true, 12#L733-5true, 11#L725true, Black: 123#(and (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 117#(= ~count~0 0)]) [2023-08-29 20:07:57,200 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-29 20:07:57,200 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-29 20:07:57,200 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-29 20:07:57,200 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-29 20:07:57,221 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([710] L719-1-->L724: Formula: (not (= (mod v_~count~0_145 4294967296) 3)) InVars {~count~0=v_~count~0_145} OutVars{thr1Thread3of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_145} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_Barrier2_#t~post4#1][39], [Black: 118#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 121#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), 113#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 119#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 104#true, 77#L724true, 70#L725true, 133#(= ~COND~0 0), 109#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 115#true, 15#L724-5true, 12#L733-5true, Black: 123#(and (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 117#(= ~count~0 0)]) [2023-08-29 20:07:57,221 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-29 20:07:57,221 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-29 20:07:57,221 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-29 20:07:57,221 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-29 20:07:57,221 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([709] L719-1-->L721: Formula: (= (mod v_~count~0_143 4294967296) 3) InVars {~count~0=v_~count~0_143} OutVars{thr1Thread3of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_143} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_Barrier2_#t~post4#1][40], [Black: 118#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), 113#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 121#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 119#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 104#true, 70#L725true, 133#(= ~COND~0 0), 109#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 94#L721true, 115#true, 15#L724-5true, 12#L733-5true, Black: 123#(and (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 117#(= ~count~0 0)]) [2023-08-29 20:07:57,222 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-29 20:07:57,222 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-29 20:07:57,222 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-29 20:07:57,222 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-29 20:07:57,290 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([713] L719-1-->L724: Formula: (not (= 3 (mod v_~count~0_149 4294967296))) InVars {~count~0=v_~count~0_149} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_149} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [Black: 118#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), 113#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 121#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), thr1Thread1of3ForFork0InUse, Black: 119#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 88#L724true, 104#true, 133#(= ~COND~0 0), 109#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 115#true, 15#L724-5true, 12#L733-5true, 93#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 123#(and (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 117#(= ~count~0 0)]) [2023-08-29 20:07:57,290 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-29 20:07:57,290 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-29 20:07:57,291 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-29 20:07:57,291 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-29 20:07:57,295 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([712] L719-1-->L721: Formula: (= (mod v_~count~0_147 4294967296) 3) InVars {~count~0=v_~count~0_147} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_147} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [Black: 118#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), 113#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 121#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), thr1Thread1of3ForFork0InUse, Black: 119#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 104#true, 84#L721true, 133#(= ~COND~0 0), 109#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 115#true, 15#L724-5true, 12#L733-5true, 93#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 123#(and (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 117#(= ~count~0 0)]) [2023-08-29 20:07:57,295 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-29 20:07:57,295 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-29 20:07:57,295 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-29 20:07:57,296 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-29 20:07:57,316 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([710] L719-1-->L724: Formula: (not (= (mod v_~count~0_145 4294967296) 3)) InVars {~count~0=v_~count~0_145} OutVars{thr1Thread3of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_145} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_Barrier2_#t~post4#1][39], [Black: 118#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 121#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), 113#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 119#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 104#true, 77#L724true, 133#(= ~COND~0 0), 109#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 115#true, 15#L724-5true, 12#L733-5true, Black: 123#(and (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1))), 89#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 117#(= ~count~0 0)]) [2023-08-29 20:07:57,316 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-29 20:07:57,316 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-29 20:07:57,316 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-29 20:07:57,316 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-29 20:07:57,316 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([709] L719-1-->L721: Formula: (= (mod v_~count~0_143 4294967296) 3) InVars {~count~0=v_~count~0_143} OutVars{thr1Thread3of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_143} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_Barrier2_#t~post4#1][40], [Black: 118#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), 113#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 121#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 119#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 104#true, 133#(= ~COND~0 0), 109#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 94#L721true, 115#true, 15#L724-5true, 12#L733-5true, Black: 123#(and (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1))), 89#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 117#(= ~count~0 0)]) [2023-08-29 20:07:57,316 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-29 20:07:57,317 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-29 20:07:57,317 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-29 20:07:57,317 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-29 20:07:57,324 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([712] L719-1-->L721: Formula: (= (mod v_~count~0_147 4294967296) 3) InVars {~count~0=v_~count~0_147} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_147} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [Black: 118#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 121#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), 113#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 119#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 104#true, 84#L721true, 133#(= ~COND~0 0), 109#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 115#true, 15#L724-5true, 12#L733-5true, 93#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 123#(and (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 117#(= ~count~0 0)]) [2023-08-29 20:07:57,324 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-29 20:07:57,324 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-29 20:07:57,324 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-29 20:07:57,324 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-29 20:07:57,324 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-29 20:07:57,324 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([713] L719-1-->L724: Formula: (not (= 3 (mod v_~count~0_149 4294967296))) InVars {~count~0=v_~count~0_149} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_149} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [Black: 118#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), 113#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 121#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 119#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 104#true, 88#L724true, 133#(= ~COND~0 0), 109#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 115#true, 15#L724-5true, 12#L733-5true, 93#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 123#(and (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 117#(= ~count~0 0)]) [2023-08-29 20:07:57,324 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-29 20:07:57,325 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-29 20:07:57,325 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-29 20:07:57,325 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-29 20:07:57,325 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-29 20:07:57,373 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([712] L719-1-->L721: Formula: (= (mod v_~count~0_147 4294967296) 3) InVars {~count~0=v_~count~0_147} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_147} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [Black: 118#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), 113#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 121#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 119#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 104#true, 84#L721true, 133#(= ~COND~0 0), 109#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 115#true, 34#L733-4true, 15#L724-5true, 11#L725true, Black: 123#(and (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 117#(= ~count~0 0)]) [2023-08-29 20:07:57,374 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-29 20:07:57,374 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 20:07:57,374 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 20:07:57,374 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 20:07:57,374 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([713] L719-1-->L724: Formula: (not (= 3 (mod v_~count~0_149 4294967296))) InVars {~count~0=v_~count~0_149} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_149} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [Black: 118#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 121#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), 113#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 119#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 104#true, 88#L724true, 133#(= ~COND~0 0), 109#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 34#L733-4true, 115#true, 15#L724-5true, 11#L725true, Black: 123#(and (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 117#(= ~count~0 0)]) [2023-08-29 20:07:57,374 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-29 20:07:57,374 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 20:07:57,375 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 20:07:57,375 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 20:07:57,412 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([712] L719-1-->L721: Formula: (= (mod v_~count~0_147 4294967296) 3) InVars {~count~0=v_~count~0_147} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_147} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [Black: 118#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), 113#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 121#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 119#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 104#true, 84#L721true, 133#(= ~COND~0 0), 109#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 115#true, 39#L725true, 12#L733-5true, 93#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 123#(and (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 117#(= ~count~0 0)]) [2023-08-29 20:07:57,412 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-29 20:07:57,412 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-29 20:07:57,412 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-29 20:07:57,412 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-29 20:07:57,412 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([713] L719-1-->L724: Formula: (not (= 3 (mod v_~count~0_149 4294967296))) InVars {~count~0=v_~count~0_149} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_149} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [Black: 118#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), 113#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 121#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 119#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 104#true, 88#L724true, 133#(= ~COND~0 0), 109#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 115#true, 39#L725true, 12#L733-5true, 93#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 123#(and (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 117#(= ~count~0 0)]) [2023-08-29 20:07:57,412 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-29 20:07:57,412 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-29 20:07:57,412 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-29 20:07:57,412 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-29 20:07:57,454 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([710] L719-1-->L724: Formula: (not (= (mod v_~count~0_145 4294967296) 3)) InVars {~count~0=v_~count~0_145} OutVars{thr1Thread3of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_145} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_Barrier2_#t~post4#1][39], [Black: 118#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 121#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), 113#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 119#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 104#true, 77#L724true, 70#L725true, 133#(= ~COND~0 0), 109#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 34#L733-4true, 115#true, 15#L724-5true, Black: 123#(and (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 117#(= ~count~0 0)]) [2023-08-29 20:07:57,455 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-29 20:07:57,455 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 20:07:57,455 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 20:07:57,455 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 20:07:57,455 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([709] L719-1-->L721: Formula: (= (mod v_~count~0_143 4294967296) 3) InVars {~count~0=v_~count~0_143} OutVars{thr1Thread3of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_143} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_Barrier2_#t~post4#1][40], [Black: 118#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), 113#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 121#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 119#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 104#true, 70#L725true, 133#(= ~COND~0 0), 109#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 94#L721true, 115#true, 34#L733-4true, 15#L724-5true, Black: 123#(and (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 117#(= ~count~0 0)]) [2023-08-29 20:07:57,455 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-29 20:07:57,455 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 20:07:57,455 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 20:07:57,455 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 20:07:57,463 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([712] L719-1-->L721: Formula: (= (mod v_~count~0_147 4294967296) 3) InVars {~count~0=v_~count~0_147} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_147} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [Black: 118#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), 113#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 121#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 119#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 104#true, 84#L721true, 133#(= ~COND~0 0), 109#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 115#true, 34#L733-4true, 15#L724-5true, 93#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 123#(and (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 117#(= ~count~0 0)]) [2023-08-29 20:07:57,464 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-29 20:07:57,464 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 20:07:57,464 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 20:07:57,464 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 20:07:57,464 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([713] L719-1-->L724: Formula: (not (= 3 (mod v_~count~0_149 4294967296))) InVars {~count~0=v_~count~0_149} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_149} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [Black: 118#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 121#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), 113#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 119#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 104#true, 88#L724true, 133#(= ~COND~0 0), 109#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 34#L733-4true, 115#true, 15#L724-5true, 93#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 123#(and (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 117#(= ~count~0 0)]) [2023-08-29 20:07:57,464 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-29 20:07:57,464 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 20:07:57,464 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 20:07:57,464 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 20:07:57,619 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([712] L719-1-->L721: Formula: (= (mod v_~count~0_147 4294967296) 3) InVars {~count~0=v_~count~0_147} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_147} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [75#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 118#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), 113#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 121#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 119#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 104#true, 84#L721true, 133#(= ~COND~0 0), 109#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 115#true, 12#L733-5true, 93#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 123#(and (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 117#(= ~count~0 0)]) [2023-08-29 20:07:57,619 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-29 20:07:57,619 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 20:07:57,619 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 20:07:57,619 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 20:07:57,620 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([713] L719-1-->L724: Formula: (not (= 3 (mod v_~count~0_149 4294967296))) InVars {~count~0=v_~count~0_149} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_149} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [Black: 118#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), 75#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, 113#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 121#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 119#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 104#true, 88#L724true, 133#(= ~COND~0 0), 109#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 115#true, 12#L733-5true, 93#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 123#(and (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 117#(= ~count~0 0)]) [2023-08-29 20:07:57,620 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-29 20:07:57,620 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 20:07:57,620 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 20:07:57,620 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 20:07:57,682 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([710] L719-1-->L724: Formula: (not (= (mod v_~count~0_145 4294967296) 3)) InVars {~count~0=v_~count~0_145} OutVars{thr1Thread3of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_145} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_Barrier2_#t~post4#1][39], [Black: 118#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 121#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), 113#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 119#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 104#true, 77#L724true, 133#(= ~COND~0 0), 109#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 34#L733-4true, 115#true, 15#L724-5true, Black: 123#(and (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1))), 89#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 117#(= ~count~0 0)]) [2023-08-29 20:07:57,682 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-29 20:07:57,682 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 20:07:57,682 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 20:07:57,682 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 20:07:57,683 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([709] L719-1-->L721: Formula: (= (mod v_~count~0_143 4294967296) 3) InVars {~count~0=v_~count~0_143} OutVars{thr1Thread3of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_143} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_Barrier2_#t~post4#1][40], [Black: 118#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), 113#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 121#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 119#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 104#true, 133#(= ~COND~0 0), 109#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 94#L721true, 34#L733-4true, 115#true, 15#L724-5true, 89#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 123#(and (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 117#(= ~count~0 0)]) [2023-08-29 20:07:57,683 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-29 20:07:57,683 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 20:07:57,683 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 20:07:57,683 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 20:07:57,690 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([712] L719-1-->L721: Formula: (= (mod v_~count~0_147 4294967296) 3) InVars {~count~0=v_~count~0_147} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_147} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [Black: 118#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), 113#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 121#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 119#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 104#true, 84#L721true, 133#(= ~COND~0 0), 109#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 115#true, 34#L733-4true, 15#L724-5true, 93#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 123#(and (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 117#(= ~count~0 0)]) [2023-08-29 20:07:57,690 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-29 20:07:57,690 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 20:07:57,690 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 20:07:57,691 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 20:07:57,691 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 20:07:57,691 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([713] L719-1-->L724: Formula: (not (= 3 (mod v_~count~0_149 4294967296))) InVars {~count~0=v_~count~0_149} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_149} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [Black: 118#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), 113#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 121#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 119#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 104#true, 88#L724true, 133#(= ~COND~0 0), 109#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 34#L733-4true, 115#true, 15#L724-5true, 93#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 123#(and (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 117#(= ~count~0 0)]) [2023-08-29 20:07:57,691 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-29 20:07:57,691 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 20:07:57,691 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 20:07:57,691 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 20:07:57,691 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 20:07:57,762 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([712] L719-1-->L721: Formula: (= (mod v_~count~0_147 4294967296) 3) InVars {~count~0=v_~count~0_147} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_147} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [Black: 118#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), 113#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 121#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 119#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 104#true, 84#L721true, 133#(= ~COND~0 0), 109#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 115#true, 34#L733-4true, 39#L725true, 93#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 123#(and (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 117#(= ~count~0 0)]) [2023-08-29 20:07:57,763 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-29 20:07:57,763 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 20:07:57,763 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 20:07:57,763 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 20:07:57,763 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([713] L719-1-->L724: Formula: (not (= 3 (mod v_~count~0_149 4294967296))) InVars {~count~0=v_~count~0_149} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_149} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [Black: 118#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), 113#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 121#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 119#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 88#L724true, 104#true, 133#(= ~COND~0 0), 109#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 115#true, 34#L733-4true, 39#L725true, 93#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 123#(and (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 117#(= ~count~0 0)]) [2023-08-29 20:07:57,763 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-29 20:07:57,763 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 20:07:57,763 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 20:07:57,763 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 20:07:57,809 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([712] L719-1-->L721: Formula: (= (mod v_~count~0_147 4294967296) 3) InVars {~count~0=v_~count~0_147} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_147} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [Black: 118#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), 75#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 121#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), 113#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 119#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 104#true, 84#L721true, 133#(= ~COND~0 0), 109#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 115#true, 34#L733-4true, 93#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 123#(and (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 117#(= ~count~0 0)]) [2023-08-29 20:07:57,810 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-29 20:07:57,810 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 20:07:57,810 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 20:07:57,810 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 20:07:57,810 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([713] L719-1-->L724: Formula: (not (= 3 (mod v_~count~0_149 4294967296))) InVars {~count~0=v_~count~0_149} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_149} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [Black: 118#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), 75#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, 113#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 121#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 119#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 104#true, 88#L724true, 133#(= ~COND~0 0), 109#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 115#true, 34#L733-4true, 93#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 123#(and (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 117#(= ~count~0 0)]) [2023-08-29 20:07:57,810 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-29 20:07:57,810 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 20:07:57,810 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 20:07:57,810 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 20:07:57,854 INFO L130 PetriNetUnfolder]: 13836/21473 cut-off events. [2023-08-29 20:07:57,854 INFO L131 PetriNetUnfolder]: For 13240/14855 co-relation queries the response was YES. [2023-08-29 20:07:57,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50631 conditions, 21473 events. 13836/21473 cut-off events. For 13240/14855 co-relation queries the response was YES. Maximal size of possible extension queue 1401. Compared 167808 event pairs, 5116 based on Foata normal form. 1145/21851 useless extension candidates. Maximal degree in co-relation 50619. Up to 9908 conditions per place. [2023-08-29 20:07:57,971 INFO L137 encePairwiseOnDemand]: 157/167 looper letters, 75 selfloop transitions, 7 changer transitions 0/115 dead transitions. [2023-08-29 20:07:57,972 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 115 transitions, 626 flow [2023-08-29 20:07:57,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:07:57,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:07:57,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 260 transitions. [2023-08-29 20:07:57,973 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5189620758483033 [2023-08-29 20:07:57,973 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 260 transitions. [2023-08-29 20:07:57,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 260 transitions. [2023-08-29 20:07:57,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:07:57,974 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 260 transitions. [2023-08-29 20:07:57,974 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:57,975 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 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:07:57,975 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 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:07:57,975 INFO L175 Difference]: Start difference. First operand has 66 places, 77 transitions, 325 flow. Second operand 3 states and 260 transitions. [2023-08-29 20:07:57,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 115 transitions, 626 flow [2023-08-29 20:07:57,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 115 transitions, 626 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:07:57,997 INFO L231 Difference]: Finished difference. Result has 70 places, 83 transitions, 383 flow [2023-08-29 20:07:57,997 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=383, PETRI_PLACES=70, PETRI_TRANSITIONS=83} [2023-08-29 20:07:57,997 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 12 predicate places. [2023-08-29 20:07:57,997 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 83 transitions, 383 flow [2023-08-29 20:07:57,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:57,998 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:07:57,998 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:07:57,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-29 20:07:57,998 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2023-08-29 20:07:57,998 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:07:57,999 INFO L85 PathProgramCache]: Analyzing trace with hash -276883892, now seen corresponding path program 1 times [2023-08-29 20:07:57,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:07:57,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464363295] [2023-08-29 20:07:57,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:07:57,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:07:58,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:07:58,054 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 20:07:58,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:07:58,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464363295] [2023-08-29 20:07:58,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464363295] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:07:58,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:07:58,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:07:58,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628946702] [2023-08-29 20:07:58,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:07:58,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:07:58,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:07:58,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:07:58,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:07:58,074 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 167 [2023-08-29 20:07:58,075 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 83 transitions, 383 flow. Second operand has 5 states, 5 states have (on average 61.2) internal successors, (306), 5 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:07:58,075 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:07:58,075 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 167 [2023-08-29 20:07:58,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:07:59,687 INFO L130 PetriNetUnfolder]: 15487/24744 cut-off events. [2023-08-29 20:07:59,688 INFO L131 PetriNetUnfolder]: For 18749/19057 co-relation queries the response was YES. [2023-08-29 20:07:59,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63875 conditions, 24744 events. 15487/24744 cut-off events. For 18749/19057 co-relation queries the response was YES. Maximal size of possible extension queue 1551. Compared 202753 event pairs, 3869 based on Foata normal form. 590/24909 useless extension candidates. Maximal degree in co-relation 63861. Up to 10226 conditions per place. [2023-08-29 20:07:59,811 INFO L137 encePairwiseOnDemand]: 156/167 looper letters, 136 selfloop transitions, 39 changer transitions 0/194 dead transitions. [2023-08-29 20:07:59,812 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 194 transitions, 1138 flow [2023-08-29 20:07:59,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:07:59,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:07:59,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 491 transitions. [2023-08-29 20:07:59,813 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49001996007984033 [2023-08-29 20:07:59,813 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 491 transitions. [2023-08-29 20:07:59,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 491 transitions. [2023-08-29 20:07:59,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:07:59,814 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 491 transitions. [2023-08-29 20:07:59,815 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 81.83333333333333) internal successors, (491), 6 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:59,816 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 167.0) internal successors, (1169), 7 states have internal predecessors, (1169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:59,816 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 167.0) internal successors, (1169), 7 states have internal predecessors, (1169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:07:59,816 INFO L175 Difference]: Start difference. First operand has 70 places, 83 transitions, 383 flow. Second operand 6 states and 491 transitions. [2023-08-29 20:07:59,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 194 transitions, 1138 flow [2023-08-29 20:07:59,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 194 transitions, 1124 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:07:59,861 INFO L231 Difference]: Finished difference. Result has 76 places, 106 transitions, 643 flow [2023-08-29 20:07:59,861 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=369, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=643, PETRI_PLACES=76, PETRI_TRANSITIONS=106} [2023-08-29 20:07:59,861 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 18 predicate places. [2023-08-29 20:07:59,861 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 106 transitions, 643 flow [2023-08-29 20:07:59,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 61.2) internal successors, (306), 5 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:07:59,862 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:07:59,862 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:07:59,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-29 20:07:59,862 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2023-08-29 20:07:59,862 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:07:59,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1414551233, now seen corresponding path program 1 times [2023-08-29 20:07:59,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:07:59,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642231013] [2023-08-29 20:07:59,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:07:59,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:07:59,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:07:59,923 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 20:07:59,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:07:59,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642231013] [2023-08-29 20:07:59,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642231013] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:07:59,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:07:59,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:07:59,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226614906] [2023-08-29 20:07:59,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:07:59,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:07:59,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:07:59,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:07:59,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:07:59,967 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 167 [2023-08-29 20:07:59,968 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 106 transitions, 643 flow. Second operand has 7 states, 7 states have (on average 58.0) internal successors, (406), 7 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:07:59,968 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:07:59,968 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 167 [2023-08-29 20:07:59,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:08:02,278 INFO L130 PetriNetUnfolder]: 17656/28305 cut-off events. [2023-08-29 20:08:02,278 INFO L131 PetriNetUnfolder]: For 42667/43029 co-relation queries the response was YES. [2023-08-29 20:08:02,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78266 conditions, 28305 events. 17656/28305 cut-off events. For 42667/43029 co-relation queries the response was YES. Maximal size of possible extension queue 1779. Compared 237909 event pairs, 3801 based on Foata normal form. 432/28405 useless extension candidates. Maximal degree in co-relation 78249. Up to 9666 conditions per place. [2023-08-29 20:08:02,442 INFO L137 encePairwiseOnDemand]: 154/167 looper letters, 216 selfloop transitions, 68 changer transitions 6/307 dead transitions. [2023-08-29 20:08:02,442 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 307 transitions, 1904 flow [2023-08-29 20:08:02,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-29 20:08:02,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-29 20:08:02,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1114 transitions. [2023-08-29 20:08:02,445 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44471057884231535 [2023-08-29 20:08:02,445 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1114 transitions. [2023-08-29 20:08:02,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1114 transitions. [2023-08-29 20:08:02,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:08:02,446 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1114 transitions. [2023-08-29 20:08:02,448 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 74.26666666666667) internal successors, (1114), 15 states have internal predecessors, (1114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:02,451 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 167.0) internal successors, (2672), 16 states have internal predecessors, (2672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:02,451 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 167.0) internal successors, (2672), 16 states have internal predecessors, (2672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:02,451 INFO L175 Difference]: Start difference. First operand has 76 places, 106 transitions, 643 flow. Second operand 15 states and 1114 transitions. [2023-08-29 20:08:02,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 307 transitions, 1904 flow [2023-08-29 20:08:02,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 307 transitions, 1904 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:08:02,529 INFO L231 Difference]: Finished difference. Result has 96 places, 130 transitions, 1017 flow [2023-08-29 20:08:02,529 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=643, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1017, PETRI_PLACES=96, PETRI_TRANSITIONS=130} [2023-08-29 20:08:02,530 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 38 predicate places. [2023-08-29 20:08:02,530 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 130 transitions, 1017 flow [2023-08-29 20:08:02,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 58.0) internal successors, (406), 7 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:08:02,530 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:08:02,530 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:08:02,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-29 20:08:02,530 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2023-08-29 20:08:02,531 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:08:02,531 INFO L85 PathProgramCache]: Analyzing trace with hash 2045698817, now seen corresponding path program 2 times [2023-08-29 20:08:02,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:08:02,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110641445] [2023-08-29 20:08:02,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:08:02,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:08:02,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:08:02,600 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 20:08:02,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:08:02,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110641445] [2023-08-29 20:08:02,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110641445] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:08:02,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:08:02,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:08:02,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192105196] [2023-08-29 20:08:02,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:08:02,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:08:02,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:08:02,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:08:02,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:08:02,632 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 167 [2023-08-29 20:08:02,632 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 130 transitions, 1017 flow. Second operand has 7 states, 7 states have (on average 58.0) internal successors, (406), 7 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:08:02,633 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:08:02,633 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 167 [2023-08-29 20:08:02,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:08:05,161 INFO L130 PetriNetUnfolder]: 19289/30949 cut-off events. [2023-08-29 20:08:05,162 INFO L131 PetriNetUnfolder]: For 73769/74063 co-relation queries the response was YES. [2023-08-29 20:08:05,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92744 conditions, 30949 events. 19289/30949 cut-off events. For 73769/74063 co-relation queries the response was YES. Maximal size of possible extension queue 2005. Compared 263865 event pairs, 4233 based on Foata normal form. 448/31159 useless extension candidates. Maximal degree in co-relation 92720. Up to 12290 conditions per place. [2023-08-29 20:08:05,361 INFO L137 encePairwiseOnDemand]: 154/167 looper letters, 224 selfloop transitions, 67 changer transitions 2/310 dead transitions. [2023-08-29 20:08:05,361 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 310 transitions, 2289 flow [2023-08-29 20:08:05,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-29 20:08:05,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-29 20:08:05,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 850 transitions. [2023-08-29 20:08:05,365 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46271094175285793 [2023-08-29 20:08:05,365 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 850 transitions. [2023-08-29 20:08:05,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 850 transitions. [2023-08-29 20:08:05,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:08:05,366 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 850 transitions. [2023-08-29 20:08:05,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 77.27272727272727) internal successors, (850), 11 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:05,370 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 167.0) internal successors, (2004), 12 states have internal predecessors, (2004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:05,370 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 167.0) internal successors, (2004), 12 states have internal predecessors, (2004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:05,370 INFO L175 Difference]: Start difference. First operand has 96 places, 130 transitions, 1017 flow. Second operand 11 states and 850 transitions. [2023-08-29 20:08:05,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 310 transitions, 2289 flow [2023-08-29 20:08:05,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 310 transitions, 2234 flow, removed 12 selfloop flow, removed 2 redundant places. [2023-08-29 20:08:05,522 INFO L231 Difference]: Finished difference. Result has 109 places, 147 transitions, 1307 flow [2023-08-29 20:08:05,522 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=967, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1307, PETRI_PLACES=109, PETRI_TRANSITIONS=147} [2023-08-29 20:08:05,522 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 51 predicate places. [2023-08-29 20:08:05,522 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 147 transitions, 1307 flow [2023-08-29 20:08:05,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 58.0) internal successors, (406), 7 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:08:05,523 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:08:05,523 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:08:05,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-29 20:08:05,523 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2023-08-29 20:08:05,523 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:08:05,524 INFO L85 PathProgramCache]: Analyzing trace with hash -751911103, now seen corresponding path program 1 times [2023-08-29 20:08:05,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:08:05,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798709143] [2023-08-29 20:08:05,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:08:05,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:08:05,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:08:05,563 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-29 20:08:05,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:08:05,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798709143] [2023-08-29 20:08:05,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798709143] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:08:05,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:08:05,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:08:05,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277045700] [2023-08-29 20:08:05,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:08:05,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:08:05,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:08:05,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:08:05,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:08:05,590 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 167 [2023-08-29 20:08:05,591 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 147 transitions, 1307 flow. Second operand has 5 states, 5 states have (on average 61.4) internal successors, (307), 5 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:05,591 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:08:05,591 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 167 [2023-08-29 20:08:05,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:08:08,397 INFO L130 PetriNetUnfolder]: 18107/29203 cut-off events. [2023-08-29 20:08:08,397 INFO L131 PetriNetUnfolder]: For 103482/103986 co-relation queries the response was YES. [2023-08-29 20:08:08,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93556 conditions, 29203 events. 18107/29203 cut-off events. For 103482/103986 co-relation queries the response was YES. Maximal size of possible extension queue 1887. Compared 248532 event pairs, 4521 based on Foata normal form. 504/29360 useless extension candidates. Maximal degree in co-relation 93526. Up to 15962 conditions per place. [2023-08-29 20:08:08,558 INFO L137 encePairwiseOnDemand]: 155/167 looper letters, 154 selfloop transitions, 70 changer transitions 32/279 dead transitions. [2023-08-29 20:08:08,558 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 279 transitions, 2638 flow [2023-08-29 20:08:08,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:08:08,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:08:08,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 543 transitions. [2023-08-29 20:08:08,559 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4644995722840034 [2023-08-29 20:08:08,560 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 543 transitions. [2023-08-29 20:08:08,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 543 transitions. [2023-08-29 20:08:08,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:08:08,560 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 543 transitions. [2023-08-29 20:08:08,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 77.57142857142857) internal successors, (543), 7 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:08,562 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 167.0) internal successors, (1336), 8 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:08,562 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 167.0) internal successors, (1336), 8 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:08,562 INFO L175 Difference]: Start difference. First operand has 109 places, 147 transitions, 1307 flow. Second operand 7 states and 543 transitions. [2023-08-29 20:08:08,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 279 transitions, 2638 flow [2023-08-29 20:08:08,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 279 transitions, 2428 flow, removed 26 selfloop flow, removed 5 redundant places. [2023-08-29 20:08:08,759 INFO L231 Difference]: Finished difference. Result has 114 places, 170 transitions, 1651 flow [2023-08-29 20:08:08,759 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=1097, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1651, PETRI_PLACES=114, PETRI_TRANSITIONS=170} [2023-08-29 20:08:08,759 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 56 predicate places. [2023-08-29 20:08:08,759 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 170 transitions, 1651 flow [2023-08-29 20:08:08,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 61.4) internal successors, (307), 5 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:08,760 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:08:08,760 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:08:08,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-29 20:08:08,760 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2023-08-29 20:08:08,760 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:08:08,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1936970294, now seen corresponding path program 1 times [2023-08-29 20:08:08,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:08:08,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597110193] [2023-08-29 20:08:08,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:08:08,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:08:08,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:08:08,821 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-29 20:08:08,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:08:08,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597110193] [2023-08-29 20:08:08,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597110193] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:08:08,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:08:08,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:08:08,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952200830] [2023-08-29 20:08:08,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:08:08,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:08:08,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:08:08,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:08:08,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:08:08,869 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 167 [2023-08-29 20:08:08,869 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 170 transitions, 1651 flow. Second operand has 7 states, 7 states have (on average 58.142857142857146) internal successors, (407), 7 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:08,869 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:08:08,870 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 167 [2023-08-29 20:08:08,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:08:11,390 INFO L130 PetriNetUnfolder]: 16180/25862 cut-off events. [2023-08-29 20:08:11,390 INFO L131 PetriNetUnfolder]: For 111475/111915 co-relation queries the response was YES. [2023-08-29 20:08:11,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86431 conditions, 25862 events. 16180/25862 cut-off events. For 111475/111915 co-relation queries the response was YES. Maximal size of possible extension queue 1642. Compared 214444 event pairs, 3679 based on Foata normal form. 298/25881 useless extension candidates. Maximal degree in co-relation 86397. Up to 10917 conditions per place. [2023-08-29 20:08:11,531 INFO L137 encePairwiseOnDemand]: 153/167 looper letters, 214 selfloop transitions, 87 changer transitions 28/349 dead transitions. [2023-08-29 20:08:11,531 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 349 transitions, 3030 flow [2023-08-29 20:08:11,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-29 20:08:11,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-29 20:08:11,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1203 transitions. [2023-08-29 20:08:11,533 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4237407537865446 [2023-08-29 20:08:11,533 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1203 transitions. [2023-08-29 20:08:11,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1203 transitions. [2023-08-29 20:08:11,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:08:11,534 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1203 transitions. [2023-08-29 20:08:11,535 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 70.76470588235294) internal successors, (1203), 17 states have internal predecessors, (1203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:11,538 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 167.0) internal successors, (3006), 18 states have internal predecessors, (3006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:11,539 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 167.0) internal successors, (3006), 18 states have internal predecessors, (3006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:11,539 INFO L175 Difference]: Start difference. First operand has 114 places, 170 transitions, 1651 flow. Second operand 17 states and 1203 transitions. [2023-08-29 20:08:11,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 349 transitions, 3030 flow [2023-08-29 20:08:11,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 349 transitions, 2944 flow, removed 18 selfloop flow, removed 2 redundant places. [2023-08-29 20:08:11,739 INFO L231 Difference]: Finished difference. Result has 136 places, 175 transitions, 1843 flow [2023-08-29 20:08:11,739 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=1390, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1843, PETRI_PLACES=136, PETRI_TRANSITIONS=175} [2023-08-29 20:08:11,740 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 78 predicate places. [2023-08-29 20:08:11,740 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 175 transitions, 1843 flow [2023-08-29 20:08:11,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 58.142857142857146) internal successors, (407), 7 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:11,740 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:08:11,740 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:08:11,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-29 20:08:11,740 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2023-08-29 20:08:11,741 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:08:11,741 INFO L85 PathProgramCache]: Analyzing trace with hash 2042674746, now seen corresponding path program 1 times [2023-08-29 20:08:11,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:08:11,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694787389] [2023-08-29 20:08:11,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:08:11,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:08:11,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:08:11,800 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-29 20:08:11,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:08:11,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694787389] [2023-08-29 20:08:11,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694787389] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:08:11,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:08:11,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:08:11,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203781662] [2023-08-29 20:08:11,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:08:11,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:08:11,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:08:11,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:08:11,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:08:11,842 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 167 [2023-08-29 20:08:11,843 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 175 transitions, 1843 flow. Second operand has 7 states, 7 states have (on average 58.142857142857146) internal successors, (407), 7 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:11,843 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:08:11,843 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 167 [2023-08-29 20:08:11,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:08:14,759 INFO L130 PetriNetUnfolder]: 15561/24657 cut-off events. [2023-08-29 20:08:14,760 INFO L131 PetriNetUnfolder]: For 152655/152953 co-relation queries the response was YES. [2023-08-29 20:08:14,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86490 conditions, 24657 events. 15561/24657 cut-off events. For 152655/152953 co-relation queries the response was YES. Maximal size of possible extension queue 1550. Compared 200530 event pairs, 3804 based on Foata normal form. 434/24847 useless extension candidates. Maximal degree in co-relation 86445. Up to 10636 conditions per place. [2023-08-29 20:08:14,903 INFO L137 encePairwiseOnDemand]: 153/167 looper letters, 242 selfloop transitions, 84 changer transitions 26/372 dead transitions. [2023-08-29 20:08:14,904 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 372 transitions, 3546 flow [2023-08-29 20:08:14,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-29 20:08:14,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-29 20:08:14,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1208 transitions. [2023-08-29 20:08:14,905 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42550193730186686 [2023-08-29 20:08:14,905 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1208 transitions. [2023-08-29 20:08:14,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1208 transitions. [2023-08-29 20:08:14,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:08:14,906 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1208 transitions. [2023-08-29 20:08:14,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 71.05882352941177) internal successors, (1208), 17 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:14,909 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 167.0) internal successors, (3006), 18 states have internal predecessors, (3006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:14,910 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 167.0) internal successors, (3006), 18 states have internal predecessors, (3006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:14,910 INFO L175 Difference]: Start difference. First operand has 136 places, 175 transitions, 1843 flow. Second operand 17 states and 1208 transitions. [2023-08-29 20:08:14,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 372 transitions, 3546 flow [2023-08-29 20:08:15,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 372 transitions, 3478 flow, removed 34 selfloop flow, removed 2 redundant places. [2023-08-29 20:08:15,146 INFO L231 Difference]: Finished difference. Result has 158 places, 195 transitions, 2218 flow [2023-08-29 20:08:15,146 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=1655, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=2218, PETRI_PLACES=158, PETRI_TRANSITIONS=195} [2023-08-29 20:08:15,146 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 100 predicate places. [2023-08-29 20:08:15,147 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 195 transitions, 2218 flow [2023-08-29 20:08:15,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 58.142857142857146) internal successors, (407), 7 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:15,147 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:08:15,147 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:08:15,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-08-29 20:08:15,147 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2023-08-29 20:08:15,147 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:08:15,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1736981554, now seen corresponding path program 1 times [2023-08-29 20:08:15,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:08:15,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539075161] [2023-08-29 20:08:15,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:08:15,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:08:15,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:08:15,204 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-29 20:08:15,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:08:15,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539075161] [2023-08-29 20:08:15,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539075161] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:08:15,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:08:15,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:08:15,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268388465] [2023-08-29 20:08:15,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:08:15,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:08:15,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:08:15,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:08:15,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:08:15,251 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 167 [2023-08-29 20:08:15,252 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 195 transitions, 2218 flow. Second operand has 7 states, 7 states have (on average 58.142857142857146) internal successors, (407), 7 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:15,252 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:08:15,252 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 167 [2023-08-29 20:08:15,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:08:17,673 INFO L130 PetriNetUnfolder]: 13356/21154 cut-off events. [2023-08-29 20:08:17,674 INFO L131 PetriNetUnfolder]: For 167237/167573 co-relation queries the response was YES. [2023-08-29 20:08:17,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79782 conditions, 21154 events. 13356/21154 cut-off events. For 167237/167573 co-relation queries the response was YES. Maximal size of possible extension queue 1321. Compared 167965 event pairs, 3404 based on Foata normal form. 280/21221 useless extension candidates. Maximal degree in co-relation 79728. Up to 10841 conditions per place. [2023-08-29 20:08:17,814 INFO L137 encePairwiseOnDemand]: 154/167 looper letters, 186 selfloop transitions, 50 changer transitions 45/302 dead transitions. [2023-08-29 20:08:17,815 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 302 transitions, 3345 flow [2023-08-29 20:08:17,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-29 20:08:17,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-29 20:08:17,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 768 transitions. [2023-08-29 20:08:17,816 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4180729450190528 [2023-08-29 20:08:17,816 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 768 transitions. [2023-08-29 20:08:17,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 768 transitions. [2023-08-29 20:08:17,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:08:17,816 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 768 transitions. [2023-08-29 20:08:17,817 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 69.81818181818181) internal successors, (768), 11 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:08:17,818 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 167.0) internal successors, (2004), 12 states have internal predecessors, (2004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:17,819 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 167.0) internal successors, (2004), 12 states have internal predecessors, (2004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:17,819 INFO L175 Difference]: Start difference. First operand has 158 places, 195 transitions, 2218 flow. Second operand 11 states and 768 transitions. [2023-08-29 20:08:17,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 302 transitions, 3345 flow [2023-08-29 20:08:18,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 302 transitions, 3162 flow, removed 62 selfloop flow, removed 4 redundant places. [2023-08-29 20:08:18,091 INFO L231 Difference]: Finished difference. Result has 169 places, 189 transitions, 2098 flow [2023-08-29 20:08:18,091 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=1947, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2098, PETRI_PLACES=169, PETRI_TRANSITIONS=189} [2023-08-29 20:08:18,092 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 111 predicate places. [2023-08-29 20:08:18,092 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 189 transitions, 2098 flow [2023-08-29 20:08:18,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 58.142857142857146) internal successors, (407), 7 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:18,092 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:08:18,092 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:08:18,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-08-29 20:08:18,092 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2023-08-29 20:08:18,092 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:08:18,092 INFO L85 PathProgramCache]: Analyzing trace with hash 2065604696, now seen corresponding path program 1 times [2023-08-29 20:08:18,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:08:18,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028618847] [2023-08-29 20:08:18,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:08:18,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:08:18,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:08:18,168 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-29 20:08:18,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:08:18,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028618847] [2023-08-29 20:08:18,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028618847] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:08:18,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:08:18,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:08:18,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413783841] [2023-08-29 20:08:18,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:08:18,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:08:18,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:08:18,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:08:18,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:08:18,222 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 167 [2023-08-29 20:08:18,223 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 189 transitions, 2098 flow. Second operand has 7 states, 7 states have (on average 58.142857142857146) internal successors, (407), 7 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:18,223 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:08:18,223 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 167 [2023-08-29 20:08:18,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:08:19,591 INFO L130 PetriNetUnfolder]: 6853/10663 cut-off events. [2023-08-29 20:08:19,591 INFO L131 PetriNetUnfolder]: For 99230/99446 co-relation queries the response was YES. [2023-08-29 20:08:19,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40992 conditions, 10663 events. 6853/10663 cut-off events. For 99230/99446 co-relation queries the response was YES. Maximal size of possible extension queue 638. Compared 73569 event pairs, 2146 based on Foata normal form. 172/10738 useless extension candidates. Maximal degree in co-relation 40932. Up to 5982 conditions per place. [2023-08-29 20:08:19,663 INFO L137 encePairwiseOnDemand]: 154/167 looper letters, 170 selfloop transitions, 42 changer transitions 62/295 dead transitions. [2023-08-29 20:08:19,664 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 295 transitions, 2970 flow [2023-08-29 20:08:19,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-29 20:08:19,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-29 20:08:19,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 895 transitions. [2023-08-29 20:08:19,665 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4122524182404422 [2023-08-29 20:08:19,665 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 895 transitions. [2023-08-29 20:08:19,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 895 transitions. [2023-08-29 20:08:19,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:08:19,666 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 895 transitions. [2023-08-29 20:08:19,667 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 68.84615384615384) internal successors, (895), 13 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:19,668 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 167.0) internal successors, (2338), 14 states have internal predecessors, (2338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:19,669 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 167.0) internal successors, (2338), 14 states have internal predecessors, (2338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:19,669 INFO L175 Difference]: Start difference. First operand has 169 places, 189 transitions, 2098 flow. Second operand 13 states and 895 transitions. [2023-08-29 20:08:19,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 295 transitions, 2970 flow [2023-08-29 20:08:19,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 295 transitions, 2865 flow, removed 48 selfloop flow, removed 4 redundant places. [2023-08-29 20:08:19,793 INFO L231 Difference]: Finished difference. Result has 181 places, 162 transitions, 1646 flow [2023-08-29 20:08:19,793 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=1676, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1646, PETRI_PLACES=181, PETRI_TRANSITIONS=162} [2023-08-29 20:08:19,793 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 123 predicate places. [2023-08-29 20:08:19,793 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 162 transitions, 1646 flow [2023-08-29 20:08:19,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 58.142857142857146) internal successors, (407), 7 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:19,794 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:08:19,794 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:08:19,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-08-29 20:08:19,794 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2023-08-29 20:08:19,794 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:08:19,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1817162973, now seen corresponding path program 1 times [2023-08-29 20:08:19,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:08:19,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203824530] [2023-08-29 20:08:19,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:08:19,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:08:19,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:08:19,877 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-29 20:08:19,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:08:19,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203824530] [2023-08-29 20:08:19,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203824530] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:08:19,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:08:19,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:08:19,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080669340] [2023-08-29 20:08:19,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:08:19,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:08:19,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:08:19,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:08:19,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:08:19,880 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 167 [2023-08-29 20:08:19,880 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 162 transitions, 1646 flow. Second operand has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:19,880 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:08:19,880 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 167 [2023-08-29 20:08:19,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:08:20,023 INFO L130 PetriNetUnfolder]: 408/893 cut-off events. [2023-08-29 20:08:20,023 INFO L131 PetriNetUnfolder]: For 1993/1993 co-relation queries the response was YES. [2023-08-29 20:08:20,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2466 conditions, 893 events. 408/893 cut-off events. For 1993/1993 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4899 event pairs, 146 based on Foata normal form. 110/986 useless extension candidates. Maximal degree in co-relation 2402. Up to 395 conditions per place. [2023-08-29 20:08:20,029 INFO L137 encePairwiseOnDemand]: 155/167 looper letters, 33 selfloop transitions, 12 changer transitions 2/86 dead transitions. [2023-08-29 20:08:20,029 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 86 transitions, 764 flow [2023-08-29 20:08:20,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:08:20,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:08:20,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 256 transitions. [2023-08-29 20:08:20,030 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5109780439121756 [2023-08-29 20:08:20,030 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 256 transitions. [2023-08-29 20:08:20,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 256 transitions. [2023-08-29 20:08:20,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:08:20,030 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 256 transitions. [2023-08-29 20:08:20,031 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:20,031 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 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:08:20,032 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 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:08:20,032 INFO L175 Difference]: Start difference. First operand has 181 places, 162 transitions, 1646 flow. Second operand 3 states and 256 transitions. [2023-08-29 20:08:20,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 86 transitions, 764 flow [2023-08-29 20:08:20,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 86 transitions, 544 flow, removed 61 selfloop flow, removed 37 redundant places. [2023-08-29 20:08:20,039 INFO L231 Difference]: Finished difference. Result has 117 places, 75 transitions, 424 flow [2023-08-29 20:08:20,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=424, PETRI_PLACES=117, PETRI_TRANSITIONS=75} [2023-08-29 20:08:20,039 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 59 predicate places. [2023-08-29 20:08:20,039 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 75 transitions, 424 flow [2023-08-29 20:08:20,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:20,040 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:08:20,040 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:08:20,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-08-29 20:08:20,040 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2023-08-29 20:08:20,040 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:08:20,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1050818817, now seen corresponding path program 1 times [2023-08-29 20:08:20,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:08:20,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989828493] [2023-08-29 20:08:20,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:08:20,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:08:20,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:08:20,065 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:08:20,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:08:20,101 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 20:08:20,101 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:08:20,101 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2023-08-29 20:08:20,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 7 remaining) [2023-08-29 20:08:20,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2023-08-29 20:08:20,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 7 remaining) [2023-08-29 20:08:20,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 7 remaining) [2023-08-29 20:08:20,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2023-08-29 20:08:20,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 7 remaining) [2023-08-29 20:08:20,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-08-29 20:08:20,104 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:08:20,104 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2023-08-29 20:08:20,105 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 3 thread instances [2023-08-29 20:08:20,105 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:08:20,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:08:20 BasicIcfg [2023-08-29 20:08:20,146 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:08:20,146 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:08:20,146 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:08:20,147 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:08:20,147 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:07:45" (3/4) ... [2023-08-29 20:08:20,149 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:08:20,149 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:08:20,149 INFO L158 Benchmark]: Toolchain (without parser) took 35539.75ms. Allocated memory was 83.9MB in the beginning and 10.9GB in the end (delta: 10.8GB). Free memory was 60.9MB in the beginning and 8.7GB in the end (delta: -8.6GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. [2023-08-29 20:08:20,149 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 67.1MB. Free memory was 45.2MB in the beginning and 45.1MB in the end (delta: 78.1kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:08:20,149 INFO L158 Benchmark]: CACSL2BoogieTranslator took 252.02ms. Allocated memory is still 83.9MB. Free memory was 60.7MB in the beginning and 41.0MB in the end (delta: 19.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-08-29 20:08:20,150 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.96ms. Allocated memory is still 83.9MB. Free memory was 40.9MB in the beginning and 62.3MB in the end (delta: -21.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-29 20:08:20,150 INFO L158 Benchmark]: Boogie Preprocessor took 36.00ms. Allocated memory is still 83.9MB. Free memory was 62.3MB in the beginning and 60.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:08:20,151 INFO L158 Benchmark]: RCFGBuilder took 339.74ms. Allocated memory is still 83.9MB. Free memory was 60.9MB in the beginning and 43.1MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-08-29 20:08:20,151 INFO L158 Benchmark]: TraceAbstraction took 34824.08ms. Allocated memory was 83.9MB in the beginning and 10.9GB in the end (delta: 10.8GB). Free memory was 42.4MB in the beginning and 8.7GB in the end (delta: -8.6GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. [2023-08-29 20:08:20,151 INFO L158 Benchmark]: Witness Printer took 2.36ms. Allocated memory is still 10.9GB. Free memory is still 8.7GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:08:20,152 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.14ms. Allocated memory is still 67.1MB. Free memory was 45.2MB in the beginning and 45.1MB in the end (delta: 78.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 252.02ms. Allocated memory is still 83.9MB. Free memory was 60.7MB in the beginning and 41.0MB in the end (delta: 19.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.96ms. Allocated memory is still 83.9MB. Free memory was 40.9MB in the beginning and 62.3MB in the end (delta: -21.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.00ms. Allocated memory is still 83.9MB. Free memory was 62.3MB in the beginning and 60.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 339.74ms. Allocated memory is still 83.9MB. Free memory was 60.9MB in the beginning and 43.1MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 34824.08ms. Allocated memory was 83.9MB in the beginning and 10.9GB in the end (delta: 10.8GB). Free memory was 42.4MB in the beginning and 8.7GB in the end (delta: -8.6GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. * Witness Printer took 2.36ms. Allocated memory is still 10.9GB. Free memory is still 8.7GB. 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: 1.9s, 55 PlacesBefore, 14 PlacesAfterwards, 55 TransitionsBefore, 11 TransitionsAfterwards, 792 CoEnabledTransitionPairs, 5 FixpointIterations, 13 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 3 ChoiceCompositions, 55 TotalNumberOfCompositions, 685 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 685, independent: 685, independent conditional: 0, independent unconditional: 685, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 428, independent: 428, independent conditional: 0, independent unconditional: 428, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 685, independent: 257, independent conditional: 0, independent unconditional: 257, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 428, unknown conditional: 0, unknown unconditional: 428] , Statistics on independence cache: Total cache size (in pairs): 2, Positive cache size: 2, Positive conditional cache size: 0, Positive unconditional cache size: 2, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.6s, 55 PlacesBefore, 14 PlacesAfterwards, 55 TransitionsBefore, 11 TransitionsAfterwards, 792 CoEnabledTransitionPairs, 5 FixpointIterations, 13 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 3 ChoiceCompositions, 55 TotalNumberOfCompositions, 685 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 685, independent: 685, independent conditional: 0, independent unconditional: 685, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 430, independent: 430, independent conditional: 0, independent unconditional: 430, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 685, independent: 255, independent conditional: 0, independent unconditional: 255, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 430, unknown conditional: 0, unknown unconditional: 430] , Statistics on independence cache: Total cache size (in pairs): 2, Positive cache size: 2, Positive conditional cache size: 0, Positive unconditional cache size: 2, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 78 PlacesBefore, 42 PlacesAfterwards, 78 TransitionsBefore, 39 TransitionsAfterwards, 2596 CoEnabledTransitionPairs, 5 FixpointIterations, 13 TrivialSequentialCompositions, 30 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 3 ChoiceCompositions, 54 TotalNumberOfCompositions, 9478 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3453, independent: 3185, independent conditional: 0, independent unconditional: 3185, dependent: 268, dependent conditional: 0, dependent unconditional: 268, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1235, independent: 1208, independent conditional: 0, independent unconditional: 1208, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3453, independent: 1977, independent conditional: 0, independent unconditional: 1977, dependent: 241, dependent conditional: 0, dependent unconditional: 241, unknown: 1235, unknown conditional: 0, unknown unconditional: 1235] , Statistics on independence cache: Total cache size (in pairs): 169, Positive cache size: 149, Positive conditional cache size: 0, Positive unconditional cache size: 149, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 78 PlacesBefore, 42 PlacesAfterwards, 78 TransitionsBefore, 39 TransitionsAfterwards, 2596 CoEnabledTransitionPairs, 5 FixpointIterations, 13 TrivialSequentialCompositions, 30 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 3 ChoiceCompositions, 54 TotalNumberOfCompositions, 9478 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4565, independent: 4297, independent conditional: 0, independent unconditional: 4297, dependent: 268, dependent conditional: 0, dependent unconditional: 268, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1317, independent: 1284, independent conditional: 0, independent unconditional: 1284, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4565, independent: 3013, independent conditional: 0, independent unconditional: 3013, dependent: 235, dependent conditional: 0, dependent unconditional: 235, unknown: 1317, unknown conditional: 0, unknown unconditional: 1317] , Statistics on independence cache: Total cache size (in pairs): 239, Positive cache size: 217, Positive conditional cache size: 0, Positive unconditional cache size: 217, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 101 PlacesBefore, 58 PlacesAfterwards, 101 TransitionsBefore, 54 TransitionsAfterwards, 5412 CoEnabledTransitionPairs, 4 FixpointIterations, 13 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 4 ChoiceCompositions, 66 TotalNumberOfCompositions, 20068 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5379, independent: 5036, independent conditional: 0, independent unconditional: 5036, dependent: 343, dependent conditional: 0, dependent unconditional: 343, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2194, independent: 2145, independent conditional: 0, independent unconditional: 2145, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5379, independent: 2891, independent conditional: 0, independent unconditional: 2891, dependent: 294, dependent conditional: 0, dependent unconditional: 294, unknown: 2194, unknown conditional: 0, unknown unconditional: 2194] , Statistics on independence cache: Total cache size (in pairs): 212, Positive cache size: 180, Positive conditional cache size: 0, Positive unconditional cache size: 180, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 728]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 728. Possible FailurePath: [L704] 0 volatile unsigned int count = 0; [L705] 0 _Bool MTX = 0; [L706] 0 _Bool COND = 0; [L732] 0 pthread_t t; VAL [COND=0, MTX=0, count=0, t={3:0}] [L733] COND TRUE 0 1 [L733] FCALL, FORK 0 pthread_create(&t, 0, thr1, 0) VAL [COND=0, MTX=0, count=0, pthread_create(&t, 0, thr1, 0)=5, t={3:0}] [L733] COND TRUE 0 1 [L727] CALL 1 Barrier2() [L718] CALL 1 __VERIFIER_atomic_acquire() [L709] CALL 1 assume_abort_if_not(MTX==0) [L3] COND FALSE 1 !(!cond) [L709] RET 1 assume_abort_if_not(MTX==0) [L710] 1 MTX = 1 [L718] RET 1 __VERIFIER_atomic_acquire() [L719] 1 count++ [L720] COND FALSE 1 !(count == 3) VAL [COND=0, MTX=1, count=1] [L724] CALL 1 __VERIFIER_atomic_release() [L714] CALL 1 assume_abort_if_not(MTX==1) [L3] COND FALSE 1 !(!cond) [L714] RET 1 assume_abort_if_not(MTX==1) [L715] 1 MTX = 0 [L724] RET 1 __VERIFIER_atomic_release() [L733] FCALL, FORK 0 pthread_create(&t, 0, thr1, 0) VAL [COND=0, MTX=0, count=1, pthread_create(&t, 0, thr1, 0)=6, t={3:0}] [L733] COND TRUE 0 1 [L727] CALL 2 Barrier2() [L718] CALL 2 __VERIFIER_atomic_acquire() [L709] CALL 2 assume_abort_if_not(MTX==0) [L3] COND FALSE 2 !(!cond) [L709] RET 2 assume_abort_if_not(MTX==0) [L710] 2 MTX = 1 [L718] RET 2 __VERIFIER_atomic_acquire() [L719] 2 count++ VAL [COND=0, MTX=1, count=2] [L720] COND FALSE 2 !(count == 3) VAL [COND=0, MTX=1, count=2] [L724] CALL 2 __VERIFIER_atomic_release() [L714] CALL 2 assume_abort_if_not(MTX==1) [L3] COND FALSE 2 !(!cond) [L714] RET 2 assume_abort_if_not(MTX==1) [L715] 2 MTX = 0 [L724] RET 2 __VERIFIER_atomic_release() [L733] FCALL, FORK 0 pthread_create(&t, 0, thr1, 0) VAL [COND=0, MTX=0, count=2, pthread_create(&t, 0, thr1, 0)=7, t={3:0}] [L727] CALL 3 Barrier2() [L718] CALL 3 __VERIFIER_atomic_acquire() [L709] CALL 3 assume_abort_if_not(MTX==0) [L3] COND FALSE 3 !(!cond) [L709] RET 3 assume_abort_if_not(MTX==0) [L710] 3 MTX = 1 [L718] RET 3 __VERIFIER_atomic_acquire() [L719] 3 count++ [L720] COND TRUE 3 count == 3 VAL [COND=0, MTX=1, count=3] [L721] 3 COND = 1 VAL [COND=1, MTX=1, count=3] [L722] 3 count = 0 VAL [COND=1, MTX=1, count=0] [L725] CALL 3 __VERIFIER_atomic_release() [L714] CALL 3 assume_abort_if_not(MTX==1) [L3] COND FALSE 3 !(!cond) [L714] RET 3 assume_abort_if_not(MTX==1) [L715] 3 MTX = 0 [L725] RET 3 __VERIFIER_atomic_release() [L727] RET 3 Barrier2() [L728] 3 reach_error() VAL [COND=1, MTX=0, arg={0:0}, arg={0:0}, count=0] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 731]: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 74 locations, 6 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: 2.4s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 82 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 28 mSDsluCounter, 13 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 73 IncrementalHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 13 mSDtfsCounter, 73 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=0, InterpolantAutomatonStates: 11, 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.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 10 NumberOfCodeBlocks, 10 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 6 ConstructedInterpolants, 0 QuantifiedInterpolants, 36 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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 - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 95 locations, 7 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: 2.3s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 434 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 357 mSDsluCounter, 92 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 69 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 826 IncrementalHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 23 mSDtfsCounter, 826 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=292occurred in iteration=6, InterpolantAutomatonStates: 49, 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.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 81 NumberOfCodeBlocks, 81 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 73 ConstructedInterpolants, 0 QuantifiedInterpolants, 236 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 6/6 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 - StatisticsResult: Ultimate Automizer benchmark data with 3 thread instances CFG has 5 procedures, 116 locations, 8 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: 27.6s, OverallIterations: 15, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 25.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1858 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1610 mSDsluCounter, 667 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 471 mSDsCounter, 145 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4492 IncrementalHoareTripleChecker+Invalid, 4637 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 145 mSolverCounterUnsat, 196 mSDtfsCounter, 4492 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 103 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2218occurred in iteration=11, InterpolantAutomatonStates: 118, 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.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 242 NumberOfCodeBlocks, 242 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 199 ConstructedInterpolants, 0 QuantifiedInterpolants, 709 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 54/54 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 - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 3 procedures, 74 locations, 6 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: 1.7s, OverallIterations: 1, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.6s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=0, InterpolantAutomatonStates: 0, 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.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 6 NumberOfCodeBlocks, 6 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 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 - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 2 thread instances CFG has 4 procedures, 95 locations, 7 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: 0.7s, OverallIterations: 1, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.7s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=0, InterpolantAutomatonStates: 0, 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.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 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:08:20,184 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-ext/40_barrier_vf.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 5eef73b6b2655059556d731e3a5babc181132142f2417a2cf863165dd8efda84 --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:08:22,128 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:08:22,130 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:08:22,159 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:08:22,161 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:08:22,163 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:08:22,164 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:08:22,166 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:08:22,168 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:08:22,171 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:08:22,171 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:08:22,177 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:08:22,177 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:08:22,179 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:08:22,180 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:08:22,184 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:08:22,184 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:08:22,185 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:08:22,186 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:08:22,189 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:08:22,194 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:08:22,195 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:08:22,197 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:08:22,197 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:08:22,202 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:08:22,202 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:08:22,202 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:08:22,204 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:08:22,204 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:08:22,205 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:08:22,205 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:08:22,209 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:08:22,211 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:08:22,211 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:08:22,212 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:08:22,212 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:08:22,212 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:08:22,212 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:08:22,213 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:08:22,213 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:08:22,213 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:08:22,215 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:08:22,240 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:08:22,240 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:08:22,241 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:08:22,241 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:08:22,242 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:08:22,242 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:08:22,242 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:08:22,242 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:08:22,242 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:08:22,242 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:08:22,243 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:08:22,243 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:08:22,243 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:08:22,243 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:08:22,243 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:08:22,244 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:08:22,244 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:08:22,244 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:08:22,244 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:08:22,244 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:08:22,244 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-29 20:08:22,244 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-29 20:08:22,244 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:08:22,244 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:08:22,245 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:08:22,245 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:08:22,245 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:08:22,245 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:08:22,245 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:08:22,245 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:08:22,245 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-29 20:08:22,245 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-29 20:08:22,246 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:08:22,246 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:08:22,246 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:08:22,246 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-29 20:08:22,246 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:08:22,246 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 -> 5eef73b6b2655059556d731e3a5babc181132142f2417a2cf863165dd8efda84 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:08:22,492 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:08:22,510 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:08:22,512 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:08:22,513 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:08:22,513 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:08:22,514 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/40_barrier_vf.i [2023-08-29 20:08:23,484 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:08:23,666 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:08:23,667 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/40_barrier_vf.i [2023-08-29 20:08:23,674 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11c94c5ee/31ec3de77088491886be7b4f96c50f9d/FLAG373e7f383 [2023-08-29 20:08:23,684 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11c94c5ee/31ec3de77088491886be7b4f96c50f9d [2023-08-29 20:08:23,686 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:08:23,686 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:08:23,687 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:08:23,687 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:08:23,697 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:08:23,698 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:08:23" (1/1) ... [2023-08-29 20:08:23,698 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7361c78c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:08:23, skipping insertion in model container [2023-08-29 20:08:23,698 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:08:23" (1/1) ... [2023-08-29 20:08:23,702 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:08:23,732 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:08:23,823 WARN L633 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-08-29 20:08:23,890 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-ext/40_barrier_vf.i[31163,31176] [2023-08-29 20:08:23,895 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:08:23,903 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:08:23,911 WARN L633 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-08-29 20:08:23,924 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-ext/40_barrier_vf.i[31163,31176] [2023-08-29 20:08:23,925 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:08:23,950 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:08:23,950 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:08:23,951 WARN L667 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:08:23,955 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:08:23,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:08:23 WrapperNode [2023-08-29 20:08:23,955 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:08:23,956 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:08:23,956 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:08:23,956 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:08:23,960 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:08:23" (1/1) ... [2023-08-29 20:08:23,969 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:08:23" (1/1) ... [2023-08-29 20:08:23,981 INFO L138 Inliner]: procedures = 177, calls = 25, calls flagged for inlining = 10, calls inlined = 12, statements flattened = 79 [2023-08-29 20:08:23,981 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:08:23,981 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:08:23,981 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:08:23,982 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:08:23,986 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:08:23" (1/1) ... [2023-08-29 20:08:23,986 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:08:23" (1/1) ... [2023-08-29 20:08:23,988 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:08:23" (1/1) ... [2023-08-29 20:08:23,988 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:08:23" (1/1) ... [2023-08-29 20:08:23,992 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:08:23" (1/1) ... [2023-08-29 20:08:23,994 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:08:23" (1/1) ... [2023-08-29 20:08:23,995 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:08:23" (1/1) ... [2023-08-29 20:08:23,996 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:08:23" (1/1) ... [2023-08-29 20:08:23,997 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:08:23,998 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:08:23,998 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:08:23,998 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:08:23,998 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:08:23" (1/1) ... [2023-08-29 20:08:24,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:08:24,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:08:24,025 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:08:24,031 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:08:24,049 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-08-29 20:08:24,049 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-08-29 20:08:24,049 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:08:24,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:08:24,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:08:24,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:08:24,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-29 20:08:24,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-29 20:08:24,049 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:08:24,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:08:24,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:08:24,050 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:08:24,150 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:08:24,151 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:08:24,308 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:08:24,352 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:08:24,352 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-29 20:08:24,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:08:24 BoogieIcfgContainer [2023-08-29 20:08:24,353 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:08:24,355 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:08:24,355 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:08:24,357 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:08:24,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:08:23" (1/3) ... [2023-08-29 20:08:24,357 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ff0d5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:08:24, skipping insertion in model container [2023-08-29 20:08:24,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:08:23" (2/3) ... [2023-08-29 20:08:24,357 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ff0d5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:08:24, skipping insertion in model container [2023-08-29 20:08:24,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:08:24" (3/3) ... [2023-08-29 20:08:24,358 INFO L112 eAbstractionObserver]: Analyzing ICFG 40_barrier_vf.i [2023-08-29 20:08:24,368 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:08:24,368 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2023-08-29 20:08:24,368 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:08:24,398 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:08:24,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 56 transitions, 117 flow [2023-08-29 20:08:24,444 INFO L130 PetriNetUnfolder]: 4/71 cut-off events. [2023-08-29 20:08:24,445 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:08:24,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 71 events. 4/71 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 107 event pairs, 0 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 39. Up to 4 conditions per place. [2023-08-29 20:08:24,448 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 56 transitions, 117 flow [2023-08-29 20:08:24,453 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 56 transitions, 117 flow [2023-08-29 20:08:24,455 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:08:24,462 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 56 transitions, 117 flow [2023-08-29 20:08:24,464 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 56 transitions, 117 flow [2023-08-29 20:08:24,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 56 transitions, 117 flow [2023-08-29 20:08:24,476 INFO L130 PetriNetUnfolder]: 4/71 cut-off events. [2023-08-29 20:08:24,476 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:08:24,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 71 events. 4/71 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 107 event pairs, 0 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 39. Up to 4 conditions per place. [2023-08-29 20:08:24,477 INFO L119 LiptonReduction]: Number of co-enabled transitions 792 [2023-08-29 20:08:26,916 INFO L134 LiptonReduction]: Checked pairs total: 718 [2023-08-29 20:08:26,916 INFO L136 LiptonReduction]: Total number of compositions: 58 [2023-08-29 20:08:26,925 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:08:26,929 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;@6a57f800, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:08:26,929 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-08-29 20:08:26,930 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-29 20:08:26,931 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:08:26,931 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:08:26,931 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-29 20:08:26,931 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 2 more)] === [2023-08-29 20:08:26,934 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:08:26,935 INFO L85 PathProgramCache]: Analyzing trace with hash 10545, now seen corresponding path program 1 times [2023-08-29 20:08:26,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:08:26,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2114876873] [2023-08-29 20:08:26,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:08:26,942 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:08:26,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:08:26,945 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:08:26,964 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:08:27,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:08:27,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-29 20:08:27,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:08:27,018 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:08:27,018 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:08:27,018 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:08:27,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2114876873] [2023-08-29 20:08:27,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2114876873] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:08:27,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:08:27,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:08:27,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690974490] [2023-08-29 20:08:27,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:08:27,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:08:27,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:08:27,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:08:27,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:08:27,045 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 114 [2023-08-29 20:08:27,046 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 14 places, 11 transitions, 27 flow. Second operand has 2 states, 2 states have (on average 46.0) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:27,046 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:08:27,046 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 114 [2023-08-29 20:08:27,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:08:27,079 INFO L130 PetriNetUnfolder]: 4/19 cut-off events. [2023-08-29 20:08:27,079 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:08:27,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 19 events. 4/19 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 32 event pairs, 4 based on Foata normal form. 0/13 useless extension candidates. Maximal degree in co-relation 26. Up to 19 conditions per place. [2023-08-29 20:08:27,080 INFO L137 encePairwiseOnDemand]: 111/114 looper letters, 7 selfloop transitions, 0 changer transitions 0/8 dead transitions. [2023-08-29 20:08:27,080 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 12 places, 8 transitions, 35 flow [2023-08-29 20:08:27,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:08:27,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:08:27,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 100 transitions. [2023-08-29 20:08:27,100 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43859649122807015 [2023-08-29 20:08:27,100 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 100 transitions. [2023-08-29 20:08:27,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 100 transitions. [2023-08-29 20:08:27,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:08:27,102 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 100 transitions. [2023-08-29 20:08:27,104 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 50.0) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:27,106 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:27,106 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:27,107 INFO L175 Difference]: Start difference. First operand has 14 places, 11 transitions, 27 flow. Second operand 2 states and 100 transitions. [2023-08-29 20:08:27,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 12 places, 8 transitions, 35 flow [2023-08-29 20:08:27,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 12 places, 8 transitions, 35 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:08:27,131 INFO L231 Difference]: Finished difference. Result has 12 places, 8 transitions, 21 flow [2023-08-29 20:08:27,132 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=21, PETRI_DIFFERENCE_MINUEND_PLACES=11, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=8, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=21, PETRI_PLACES=12, PETRI_TRANSITIONS=8} [2023-08-29 20:08:27,134 INFO L281 CegarLoopForPetriNet]: 14 programPoint places, -2 predicate places. [2023-08-29 20:08:27,134 INFO L495 AbstractCegarLoop]: Abstraction has has 12 places, 8 transitions, 21 flow [2023-08-29 20:08:27,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 46.0) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:27,134 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:08:27,134 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-29 20:08:27,166 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:08:27,340 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:08:27,341 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 2 more)] === [2023-08-29 20:08:27,341 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:08:27,341 INFO L85 PathProgramCache]: Analyzing trace with hash 10551, now seen corresponding path program 1 times [2023-08-29 20:08:27,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:08:27,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1847991735] [2023-08-29 20:08:27,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:08:27,342 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:08:27,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:08:27,343 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:08:27,364 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:08:27,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:08:27,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-29 20:08:27,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:08:27,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-08-29 20:08:27,416 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:08:27,416 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:08:27,416 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:08:27,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1847991735] [2023-08-29 20:08:27,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1847991735] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:08:27,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:08:27,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:08:27,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334606847] [2023-08-29 20:08:27,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:08:27,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:08:27,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:08:27,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:08:27,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:08:27,437 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 114 [2023-08-29 20:08:27,438 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 12 places, 8 transitions, 21 flow. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:27,438 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:08:27,438 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 114 [2023-08-29 20:08:27,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:08:27,453 INFO L130 PetriNetUnfolder]: 3/15 cut-off events. [2023-08-29 20:08:27,453 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:08:27,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 15 events. 3/15 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 20 event pairs, 3 based on Foata normal form. 0/12 useless extension candidates. Maximal degree in co-relation 32. Up to 14 conditions per place. [2023-08-29 20:08:27,454 INFO L137 encePairwiseOnDemand]: 112/114 looper letters, 5 selfloop transitions, 1 changer transitions 0/7 dead transitions. [2023-08-29 20:08:27,454 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 13 places, 7 transitions, 31 flow [2023-08-29 20:08:27,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:08:27,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:08:27,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2023-08-29 20:08:27,457 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36257309941520466 [2023-08-29 20:08:27,457 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 124 transitions. [2023-08-29 20:08:27,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 124 transitions. [2023-08-29 20:08:27,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:08:27,457 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 124 transitions. [2023-08-29 20:08:27,458 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:27,459 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:27,459 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:27,459 INFO L175 Difference]: Start difference. First operand has 12 places, 8 transitions, 21 flow. Second operand 3 states and 124 transitions. [2023-08-29 20:08:27,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 13 places, 7 transitions, 31 flow [2023-08-29 20:08:27,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 13 places, 7 transitions, 31 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:08:27,459 INFO L231 Difference]: Finished difference. Result has 13 places, 7 transitions, 21 flow [2023-08-29 20:08:27,460 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=19, PETRI_DIFFERENCE_MINUEND_PLACES=11, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=7, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=6, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=21, PETRI_PLACES=13, PETRI_TRANSITIONS=7} [2023-08-29 20:08:27,460 INFO L281 CegarLoopForPetriNet]: 14 programPoint places, -1 predicate places. [2023-08-29 20:08:27,460 INFO L495 AbstractCegarLoop]: Abstraction has has 13 places, 7 transitions, 21 flow [2023-08-29 20:08:27,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:27,460 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:08:27,460 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-29 20:08:27,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-08-29 20:08:27,668 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:08:27,669 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 2 more)] === [2023-08-29 20:08:27,669 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:08:27,669 INFO L85 PathProgramCache]: Analyzing trace with hash 10552, now seen corresponding path program 1 times [2023-08-29 20:08:27,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:08:27,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [262345186] [2023-08-29 20:08:27,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:08:27,670 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:08:27,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:08:27,671 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:08:27,673 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:08:27,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:08:27,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-29 20:08:27,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:08:27,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-29 20:08:27,714 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:08:27,714 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:08:27,714 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:08:27,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [262345186] [2023-08-29 20:08:27,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [262345186] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:08:27,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:08:27,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:08:27,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261156605] [2023-08-29 20:08:27,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:08:27,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:08:27,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:08:27,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:08:27,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:08:27,733 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 114 [2023-08-29 20:08:27,734 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 13 places, 7 transitions, 21 flow. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:27,734 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:08:27,734 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 114 [2023-08-29 20:08:27,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:08:27,745 INFO L130 PetriNetUnfolder]: 2/11 cut-off events. [2023-08-29 20:08:27,745 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:08:27,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 11 events. 2/11 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 9 event pairs, 2 based on Foata normal form. 0/11 useless extension candidates. Maximal degree in co-relation 25. Up to 10 conditions per place. [2023-08-29 20:08:27,745 INFO L137 encePairwiseOnDemand]: 112/114 looper letters, 4 selfloop transitions, 1 changer transitions 0/6 dead transitions. [2023-08-29 20:08:27,746 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 14 places, 6 transitions, 29 flow [2023-08-29 20:08:27,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:08:27,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:08:27,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2023-08-29 20:08:27,750 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37719298245614036 [2023-08-29 20:08:27,750 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 129 transitions. [2023-08-29 20:08:27,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 129 transitions. [2023-08-29 20:08:27,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:08:27,751 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 129 transitions. [2023-08-29 20:08:27,753 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:27,754 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:27,754 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:27,754 INFO L175 Difference]: Start difference. First operand has 13 places, 7 transitions, 21 flow. Second operand 3 states and 129 transitions. [2023-08-29 20:08:27,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 14 places, 6 transitions, 29 flow [2023-08-29 20:08:27,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 13 places, 6 transitions, 28 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:08:27,755 INFO L231 Difference]: Finished difference. Result has 13 places, 6 transitions, 20 flow [2023-08-29 20:08:27,755 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=18, PETRI_DIFFERENCE_MINUEND_PLACES=11, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=6, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=5, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=20, PETRI_PLACES=13, PETRI_TRANSITIONS=6} [2023-08-29 20:08:27,756 INFO L281 CegarLoopForPetriNet]: 14 programPoint places, -1 predicate places. [2023-08-29 20:08:27,757 INFO L495 AbstractCegarLoop]: Abstraction has has 13 places, 6 transitions, 20 flow [2023-08-29 20:08:27,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:27,758 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:08:27,758 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-29 20:08:27,767 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:08:27,965 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:08:27,965 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 2 more)] === [2023-08-29 20:08:27,965 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:08:27,965 INFO L85 PathProgramCache]: Analyzing trace with hash 10146479, now seen corresponding path program 1 times [2023-08-29 20:08:27,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:08:27,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [979998955] [2023-08-29 20:08:27,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:08:27,966 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:08:27,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:08:27,967 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:08:27,969 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:08:28,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:08:28,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-29 20:08:28,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:08:28,018 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:08:28,019 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:08:28,019 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:08:28,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [979998955] [2023-08-29 20:08:28,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [979998955] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:08:28,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:08:28,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:08:28,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683882051] [2023-08-29 20:08:28,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:08:28,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:08:28,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:08:28,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:08:28,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:08:28,031 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 114 [2023-08-29 20:08:28,031 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 13 places, 6 transitions, 20 flow. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:28,031 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:08:28,031 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 114 [2023-08-29 20:08:28,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:08:28,038 INFO L130 PetriNetUnfolder]: 0/6 cut-off events. [2023-08-29 20:08:28,038 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:08:28,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21 conditions, 6 events. 0/6 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 3/9 useless extension candidates. Maximal degree in co-relation 0. Up to 5 conditions per place. [2023-08-29 20:08:28,038 INFO L137 encePairwiseOnDemand]: 112/114 looper letters, 0 selfloop transitions, 0 changer transitions 5/5 dead transitions. [2023-08-29 20:08:28,038 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 14 places, 5 transitions, 26 flow [2023-08-29 20:08:28,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:08:28,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:08:28,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 131 transitions. [2023-08-29 20:08:28,039 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3830409356725146 [2023-08-29 20:08:28,039 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 131 transitions. [2023-08-29 20:08:28,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 131 transitions. [2023-08-29 20:08:28,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:08:28,039 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 131 transitions. [2023-08-29 20:08:28,040 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:28,040 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:28,041 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:28,041 INFO L175 Difference]: Start difference. First operand has 13 places, 6 transitions, 20 flow. Second operand 3 states and 131 transitions. [2023-08-29 20:08:28,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 14 places, 5 transitions, 26 flow [2023-08-29 20:08:28,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 13 places, 5 transitions, 25 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:08:28,041 INFO L231 Difference]: Finished difference. Result has 13 places, 0 transitions, 0 flow [2023-08-29 20:08:28,041 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=17, PETRI_DIFFERENCE_MINUEND_PLACES=11, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=5, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=5, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=13, PETRI_TRANSITIONS=0} [2023-08-29 20:08:28,042 INFO L281 CegarLoopForPetriNet]: 14 programPoint places, -1 predicate places. [2023-08-29 20:08:28,042 INFO L495 AbstractCegarLoop]: Abstraction has has 13 places, 0 transitions, 0 flow [2023-08-29 20:08:28,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:28,043 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 5 remaining) [2023-08-29 20:08:28,044 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2023-08-29 20:08:28,044 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 5 remaining) [2023-08-29 20:08:28,044 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 5 remaining) [2023-08-29 20:08:28,044 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 5 remaining) [2023-08-29 20:08:28,055 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:08:28,250 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:08:28,250 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-08-29 20:08:28,252 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE,SAFE,SAFE (1/2) [2023-08-29 20:08:28,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 56 transitions, 117 flow [2023-08-29 20:08:28,265 INFO L130 PetriNetUnfolder]: 4/71 cut-off events. [2023-08-29 20:08:28,265 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:08:28,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 71 events. 4/71 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 107 event pairs, 0 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 39. Up to 4 conditions per place. [2023-08-29 20:08:28,265 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 56 transitions, 117 flow [2023-08-29 20:08:28,266 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 56 transitions, 117 flow [2023-08-29 20:08:28,266 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:08:28,266 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 56 transitions, 117 flow [2023-08-29 20:08:28,266 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 56 transitions, 117 flow [2023-08-29 20:08:28,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 56 transitions, 117 flow [2023-08-29 20:08:28,282 INFO L130 PetriNetUnfolder]: 4/71 cut-off events. [2023-08-29 20:08:28,282 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:08:28,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 71 events. 4/71 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 107 event pairs, 0 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 39. Up to 4 conditions per place. [2023-08-29 20:08:28,285 INFO L119 LiptonReduction]: Number of co-enabled transitions 792 [2023-08-29 20:08:30,441 INFO L134 LiptonReduction]: Checked pairs total: 718 [2023-08-29 20:08:30,441 INFO L136 LiptonReduction]: Total number of compositions: 58 [2023-08-29 20:08:30,442 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-29 20:08:30,443 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;@6a57f800, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:08:30,443 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-29 20:08:30,444 INFO L130 PetriNetUnfolder]: 0/15 cut-off events. [2023-08-29 20:08:30,444 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:08:30,445 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:08:30,445 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-29 20:08:30,445 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-29 20:08:30,445 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:08:30,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1446843950, now seen corresponding path program 1 times [2023-08-29 20:08:30,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:08:30,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1129256097] [2023-08-29 20:08:30,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:08:30,445 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:08:30,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:08:30,449 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:08:30,451 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:08:30,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:08:30,489 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:08:30,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:08:30,515 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-29 20:08:30,515 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:08:30,515 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-29 20:08:30,524 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:08:30,716 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:08:30,716 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-29 20:08:30,717 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-29 20:08:30,717 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-29 20:08:30,717 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-29 20:08:30,727 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:08:30,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 79 transitions, 170 flow [2023-08-29 20:08:30,741 INFO L130 PetriNetUnfolder]: 7/111 cut-off events. [2023-08-29 20:08:30,741 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-29 20:08:30,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 111 events. 7/111 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 254 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 72. Up to 6 conditions per place. [2023-08-29 20:08:30,742 INFO L82 GeneralOperation]: Start removeDead. Operand has 79 places, 79 transitions, 170 flow [2023-08-29 20:08:30,743 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 79 places, 79 transitions, 170 flow [2023-08-29 20:08:30,743 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:08:30,743 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 79 transitions, 170 flow [2023-08-29 20:08:30,743 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 79 transitions, 170 flow [2023-08-29 20:08:30,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 79 transitions, 170 flow [2023-08-29 20:08:30,752 INFO L130 PetriNetUnfolder]: 7/111 cut-off events. [2023-08-29 20:08:30,752 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-29 20:08:30,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 111 events. 7/111 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 254 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 72. Up to 6 conditions per place. [2023-08-29 20:08:30,753 INFO L119 LiptonReduction]: Number of co-enabled transitions 2596 [2023-08-29 20:08:31,812 INFO L134 LiptonReduction]: Checked pairs total: 9478 [2023-08-29 20:08:31,812 INFO L136 LiptonReduction]: Total number of compositions: 55 [2023-08-29 20:08:31,813 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:08:31,813 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;@6a57f800, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:08:31,814 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-08-29 20:08:31,814 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-29 20:08:31,814 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:08:31,814 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:08:31,814 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-29 20:08:31,814 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2023-08-29 20:08:31,815 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:08:31,815 INFO L85 PathProgramCache]: Analyzing trace with hash 17555, now seen corresponding path program 1 times [2023-08-29 20:08:31,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:08:31,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1310282361] [2023-08-29 20:08:31,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:08:31,815 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:08:31,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:08:31,816 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:08:31,818 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:08:31,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:08:31,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-29 20:08:31,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:08:31,849 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:08:31,850 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:08:31,850 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:08:31,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1310282361] [2023-08-29 20:08:31,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1310282361] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:08:31,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:08:31,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:08:31,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208594947] [2023-08-29 20:08:31,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:08:31,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:08:31,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:08:31,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:08:31,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:08:31,853 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 134 [2023-08-29 20:08:31,854 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 39 transitions, 90 flow. Second operand has 2 states, 2 states have (on average 60.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:31,854 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:08:31,854 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 134 [2023-08-29 20:08:31,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:08:31,972 INFO L130 PetriNetUnfolder]: 561/1074 cut-off events. [2023-08-29 20:08:31,973 INFO L131 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2023-08-29 20:08:31,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2015 conditions, 1074 events. 561/1074 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 6905 event pairs, 485 based on Foata normal form. 0/797 useless extension candidates. Maximal degree in co-relation 824. Up to 902 conditions per place. [2023-08-29 20:08:31,979 INFO L137 encePairwiseOnDemand]: 130/134 looper letters, 22 selfloop transitions, 0 changer transitions 0/35 dead transitions. [2023-08-29 20:08:31,979 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 35 transitions, 126 flow [2023-08-29 20:08:31,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:08:31,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:08:31,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 144 transitions. [2023-08-29 20:08:31,980 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5373134328358209 [2023-08-29 20:08:31,980 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 144 transitions. [2023-08-29 20:08:31,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 144 transitions. [2023-08-29 20:08:31,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:08:31,980 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 144 transitions. [2023-08-29 20:08:31,980 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 72.0) internal successors, (144), 2 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:31,981 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 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:08:31,982 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 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:08:31,982 INFO L175 Difference]: Start difference. First operand has 42 places, 39 transitions, 90 flow. Second operand 2 states and 144 transitions. [2023-08-29 20:08:31,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 35 transitions, 126 flow [2023-08-29 20:08:31,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 35 transitions, 124 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-29 20:08:31,983 INFO L231 Difference]: Finished difference. Result has 39 places, 35 transitions, 80 flow [2023-08-29 20:08:31,983 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=80, PETRI_PLACES=39, PETRI_TRANSITIONS=35} [2023-08-29 20:08:31,985 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2023-08-29 20:08:31,985 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 35 transitions, 80 flow [2023-08-29 20:08:31,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 60.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:31,985 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:08:31,985 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-29 20:08:31,993 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:08:32,191 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:08:32,192 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2023-08-29 20:08:32,192 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:08:32,192 INFO L85 PathProgramCache]: Analyzing trace with hash 17562, now seen corresponding path program 1 times [2023-08-29 20:08:32,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:08:32,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1221239699] [2023-08-29 20:08:32,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:08:32,193 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:08:32,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:08:32,194 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:08:32,197 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:08:32,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:08:32,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-29 20:08:32,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:08:32,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-08-29 20:08:32,230 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:08:32,230 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:08:32,230 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:08:32,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1221239699] [2023-08-29 20:08:32,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1221239699] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:08:32,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:08:32,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:08:32,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070040392] [2023-08-29 20:08:32,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:08:32,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:08:32,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:08:32,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:08:32,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:08:32,257 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 134 [2023-08-29 20:08:32,257 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 35 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:32,257 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:08:32,257 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 134 [2023-08-29 20:08:32,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:08:32,325 INFO L130 PetriNetUnfolder]: 402/791 cut-off events. [2023-08-29 20:08:32,326 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2023-08-29 20:08:32,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1484 conditions, 791 events. 402/791 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4805 event pairs, 345 based on Foata normal form. 0/623 useless extension candidates. Maximal degree in co-relation 1479. Up to 657 conditions per place. [2023-08-29 20:08:32,329 INFO L137 encePairwiseOnDemand]: 132/134 looper letters, 20 selfloop transitions, 1 changer transitions 0/34 dead transitions. [2023-08-29 20:08:32,329 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 34 transitions, 120 flow [2023-08-29 20:08:32,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:08:32,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:08:32,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 181 transitions. [2023-08-29 20:08:32,330 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4502487562189055 [2023-08-29 20:08:32,330 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 181 transitions. [2023-08-29 20:08:32,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 181 transitions. [2023-08-29 20:08:32,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:08:32,331 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 181 transitions. [2023-08-29 20:08:32,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:32,333 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:32,333 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:32,333 INFO L175 Difference]: Start difference. First operand has 39 places, 35 transitions, 80 flow. Second operand 3 states and 181 transitions. [2023-08-29 20:08:32,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 34 transitions, 120 flow [2023-08-29 20:08:32,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 34 transitions, 120 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:08:32,334 INFO L231 Difference]: Finished difference. Result has 40 places, 34 transitions, 80 flow [2023-08-29 20:08:32,334 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=40, PETRI_TRANSITIONS=34} [2023-08-29 20:08:32,335 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -2 predicate places. [2023-08-29 20:08:32,336 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 80 flow [2023-08-29 20:08:32,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:32,336 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:08:32,337 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-29 20:08:32,347 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:08:32,542 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:08:32,545 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2023-08-29 20:08:32,545 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:08:32,545 INFO L85 PathProgramCache]: Analyzing trace with hash 17563, now seen corresponding path program 1 times [2023-08-29 20:08:32,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:08:32,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [459992376] [2023-08-29 20:08:32,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:08:32,546 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:08:32,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:08:32,546 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:08:32,548 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:08:32,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:08:32,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-29 20:08:32,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:08:32,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-29 20:08:32,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:08:32,603 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:08:32,603 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:08:32,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [459992376] [2023-08-29 20:08:32,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [459992376] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:08:32,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:08:32,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:08:32,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944937613] [2023-08-29 20:08:32,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:08:32,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:08:32,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:08:32,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:08:32,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:08:32,618 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 134 [2023-08-29 20:08:32,618 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 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:08:32,618 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:08:32,618 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 134 [2023-08-29 20:08:32,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:08:32,673 INFO L130 PetriNetUnfolder]: 243/508 cut-off events. [2023-08-29 20:08:32,673 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2023-08-29 20:08:32,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 959 conditions, 508 events. 243/508 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2842 event pairs, 205 based on Foata normal form. 0/449 useless extension candidates. Maximal degree in co-relation 953. Up to 413 conditions per place. [2023-08-29 20:08:32,675 INFO L137 encePairwiseOnDemand]: 132/134 looper letters, 19 selfloop transitions, 1 changer transitions 0/33 dead transitions. [2023-08-29 20:08:32,675 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 33 transitions, 118 flow [2023-08-29 20:08:32,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:08:32,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:08:32,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2023-08-29 20:08:32,677 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4626865671641791 [2023-08-29 20:08:32,677 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 186 transitions. [2023-08-29 20:08:32,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 186 transitions. [2023-08-29 20:08:32,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:08:32,677 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 186 transitions. [2023-08-29 20:08:32,677 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:32,679 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:32,679 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:32,679 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 80 flow. Second operand 3 states and 186 transitions. [2023-08-29 20:08:32,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 33 transitions, 118 flow [2023-08-29 20:08:32,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 33 transitions, 117 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:08:32,680 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 79 flow [2023-08-29 20:08:32,680 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=79, PETRI_PLACES=40, PETRI_TRANSITIONS=33} [2023-08-29 20:08:32,681 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -2 predicate places. [2023-08-29 20:08:32,682 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 79 flow [2023-08-29 20:08:32,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 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:08:32,682 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:08:32,682 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:08:32,693 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:08:32,888 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:08:32,888 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2023-08-29 20:08:32,888 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:08:32,889 INFO L85 PathProgramCache]: Analyzing trace with hash -134783910, now seen corresponding path program 1 times [2023-08-29 20:08:32,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:08:32,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [115168531] [2023-08-29 20:08:32,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:08:32,889 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:08:32,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:08:32,891 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:08:32,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-08-29 20:08:32,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:08:32,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-29 20:08:32,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:08:32,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:08:32,956 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:08:32,956 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:08:32,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [115168531] [2023-08-29 20:08:32,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [115168531] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:08:32,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:08:32,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:08:32,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820287116] [2023-08-29 20:08:32,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:08:32,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:08:32,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:08:32,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:08:32,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:08:32,974 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 134 [2023-08-29 20:08:32,974 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 79 flow. Second operand has 5 states, 5 states have (on average 51.0) internal successors, (255), 5 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:32,974 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:08:32,974 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 134 [2023-08-29 20:08:32,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:08:33,169 INFO L130 PetriNetUnfolder]: 661/1247 cut-off events. [2023-08-29 20:08:33,169 INFO L131 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2023-08-29 20:08:33,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2440 conditions, 1247 events. 661/1247 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 7965 event pairs, 95 based on Foata normal form. 0/1180 useless extension candidates. Maximal degree in co-relation 2434. Up to 457 conditions per place. [2023-08-29 20:08:33,174 INFO L137 encePairwiseOnDemand]: 125/134 looper letters, 73 selfloop transitions, 18 changer transitions 0/99 dead transitions. [2023-08-29 20:08:33,174 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 99 transitions, 408 flow [2023-08-29 20:08:33,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:08:33,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:08:33,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 440 transitions. [2023-08-29 20:08:33,175 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4690831556503198 [2023-08-29 20:08:33,175 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 440 transitions. [2023-08-29 20:08:33,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 440 transitions. [2023-08-29 20:08:33,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:08:33,176 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 440 transitions. [2023-08-29 20:08:33,177 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 62.857142857142854) internal successors, (440), 7 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:33,178 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 134.0) internal successors, (1072), 8 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:33,178 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 134.0) internal successors, (1072), 8 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:33,178 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 79 flow. Second operand 7 states and 440 transitions. [2023-08-29 20:08:33,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 99 transitions, 408 flow [2023-08-29 20:08:33,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 99 transitions, 407 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:08:33,181 INFO L231 Difference]: Finished difference. Result has 51 places, 50 transitions, 210 flow [2023-08-29 20:08:33,182 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=210, PETRI_PLACES=51, PETRI_TRANSITIONS=50} [2023-08-29 20:08:33,183 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 9 predicate places. [2023-08-29 20:08:33,183 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 50 transitions, 210 flow [2023-08-29 20:08:33,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.0) internal successors, (255), 5 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:33,184 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:08:33,184 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:08:33,195 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 (10)] Ended with exit code 0 [2023-08-29 20:08:33,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:08:33,390 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2023-08-29 20:08:33,390 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:08:33,390 INFO L85 PathProgramCache]: Analyzing trace with hash 238750301, now seen corresponding path program 1 times [2023-08-29 20:08:33,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:08:33,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [844280027] [2023-08-29 20:08:33,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:08:33,391 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:08:33,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:08:33,392 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:08:33,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-08-29 20:08:33,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:08:33,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-29 20:08:33,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:08:33,459 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:08:33,460 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:08:33,460 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:08:33,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [844280027] [2023-08-29 20:08:33,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [844280027] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:08:33,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:08:33,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:08:33,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917190440] [2023-08-29 20:08:33,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:08:33,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:08:33,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:08:33,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:08:33,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:08:33,466 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 134 [2023-08-29 20:08:33,466 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 50 transitions, 210 flow. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:33,466 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:08:33,466 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 134 [2023-08-29 20:08:33,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:08:33,537 INFO L130 PetriNetUnfolder]: 416/837 cut-off events. [2023-08-29 20:08:33,537 INFO L131 PetriNetUnfolder]: For 391/414 co-relation queries the response was YES. [2023-08-29 20:08:33,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1989 conditions, 837 events. 416/837 cut-off events. For 391/414 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5075 event pairs, 177 based on Foata normal form. 59/858 useless extension candidates. Maximal degree in co-relation 1978. Up to 395 conditions per place. [2023-08-29 20:08:33,547 INFO L137 encePairwiseOnDemand]: 127/134 looper letters, 41 selfloop transitions, 5 changer transitions 0/67 dead transitions. [2023-08-29 20:08:33,547 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 67 transitions, 364 flow [2023-08-29 20:08:33,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:08:33,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:08:33,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 202 transitions. [2023-08-29 20:08:33,548 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5024875621890548 [2023-08-29 20:08:33,548 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 202 transitions. [2023-08-29 20:08:33,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 202 transitions. [2023-08-29 20:08:33,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:08:33,548 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 202 transitions. [2023-08-29 20:08:33,549 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:33,549 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:33,550 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:33,550 INFO L175 Difference]: Start difference. First operand has 51 places, 50 transitions, 210 flow. Second operand 3 states and 202 transitions. [2023-08-29 20:08:33,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 67 transitions, 364 flow [2023-08-29 20:08:33,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 67 transitions, 364 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:08:33,554 INFO L231 Difference]: Finished difference. Result has 54 places, 52 transitions, 237 flow [2023-08-29 20:08:33,554 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=237, PETRI_PLACES=54, PETRI_TRANSITIONS=52} [2023-08-29 20:08:33,555 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 12 predicate places. [2023-08-29 20:08:33,555 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 52 transitions, 237 flow [2023-08-29 20:08:33,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:33,555 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:08:33,555 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:08:33,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-08-29 20:08:33,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:08:33,762 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2023-08-29 20:08:33,762 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:08:33,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1394802708, now seen corresponding path program 1 times [2023-08-29 20:08:33,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:08:33,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [846203832] [2023-08-29 20:08:33,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:08:33,762 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:08:33,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:08:33,763 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:08:33,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-08-29 20:08:33,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:08:33,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-29 20:08:33,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:08:33,827 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 20:08:33,827 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:08:33,827 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:08:33,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [846203832] [2023-08-29 20:08:33,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [846203832] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:08:33,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:08:33,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:08:33,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606022321] [2023-08-29 20:08:33,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:08:33,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:08:33,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:08:33,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:08:33,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:08:33,853 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 134 [2023-08-29 20:08:33,853 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 52 transitions, 237 flow. Second operand has 5 states, 5 states have (on average 51.2) internal successors, (256), 5 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:33,854 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:08:33,854 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 134 [2023-08-29 20:08:33,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:08:33,998 INFO L130 PetriNetUnfolder]: 332/644 cut-off events. [2023-08-29 20:08:33,998 INFO L131 PetriNetUnfolder]: For 431/445 co-relation queries the response was YES. [2023-08-29 20:08:33,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1691 conditions, 644 events. 332/644 cut-off events. For 431/445 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3500 event pairs, 99 based on Foata normal form. 22/653 useless extension candidates. Maximal degree in co-relation 1678. Up to 279 conditions per place. [2023-08-29 20:08:34,001 INFO L137 encePairwiseOnDemand]: 125/134 looper letters, 56 selfloop transitions, 14 changer transitions 11/92 dead transitions. [2023-08-29 20:08:34,001 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 92 transitions, 526 flow [2023-08-29 20:08:34,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:08:34,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:08:34,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 416 transitions. [2023-08-29 20:08:34,002 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44349680170575695 [2023-08-29 20:08:34,002 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 416 transitions. [2023-08-29 20:08:34,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 416 transitions. [2023-08-29 20:08:34,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:08:34,002 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 416 transitions. [2023-08-29 20:08:34,003 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 59.42857142857143) internal successors, (416), 7 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:34,004 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 134.0) internal successors, (1072), 8 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:34,004 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 134.0) internal successors, (1072), 8 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:34,004 INFO L175 Difference]: Start difference. First operand has 54 places, 52 transitions, 237 flow. Second operand 7 states and 416 transitions. [2023-08-29 20:08:34,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 92 transitions, 526 flow [2023-08-29 20:08:34,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 92 transitions, 521 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:08:34,007 INFO L231 Difference]: Finished difference. Result has 63 places, 55 transitions, 292 flow [2023-08-29 20:08:34,007 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=292, PETRI_PLACES=63, PETRI_TRANSITIONS=55} [2023-08-29 20:08:34,007 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 21 predicate places. [2023-08-29 20:08:34,007 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 55 transitions, 292 flow [2023-08-29 20:08:34,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.2) internal successors, (256), 5 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:34,008 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:08:34,008 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:08:34,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-08-29 20:08:34,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:08:34,214 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2023-08-29 20:08:34,214 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:08:34,214 INFO L85 PathProgramCache]: Analyzing trace with hash 2085889641, now seen corresponding path program 1 times [2023-08-29 20:08:34,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:08:34,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [615475112] [2023-08-29 20:08:34,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:08:34,215 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:08:34,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:08:34,216 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:08:34,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-08-29 20:08:34,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:08:34,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-29 20:08:34,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:08:34,269 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-29 20:08:34,269 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:08:34,270 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:08:34,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [615475112] [2023-08-29 20:08:34,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [615475112] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:08:34,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:08:34,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:08:34,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222401852] [2023-08-29 20:08:34,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:08:34,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:08:34,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:08:34,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:08:34,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:08:34,272 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 134 [2023-08-29 20:08:34,272 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 55 transitions, 292 flow. Second operand has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:34,272 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:08:34,272 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 134 [2023-08-29 20:08:34,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:08:34,310 INFO L130 PetriNetUnfolder]: 59/173 cut-off events. [2023-08-29 20:08:34,310 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2023-08-29 20:08:34,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 461 conditions, 173 events. 59/173 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 668 event pairs, 21 based on Foata normal form. 12/184 useless extension candidates. Maximal degree in co-relation 444. Up to 74 conditions per place. [2023-08-29 20:08:34,311 INFO L137 encePairwiseOnDemand]: 126/134 looper letters, 18 selfloop transitions, 8 changer transitions 2/45 dead transitions. [2023-08-29 20:08:34,311 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 45 transitions, 268 flow [2023-08-29 20:08:34,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:08:34,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:08:34,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 204 transitions. [2023-08-29 20:08:34,312 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5074626865671642 [2023-08-29 20:08:34,312 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 204 transitions. [2023-08-29 20:08:34,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 204 transitions. [2023-08-29 20:08:34,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:08:34,313 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 204 transitions. [2023-08-29 20:08:34,313 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:34,313 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:34,314 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:34,314 INFO L175 Difference]: Start difference. First operand has 63 places, 55 transitions, 292 flow. Second operand 3 states and 204 transitions. [2023-08-29 20:08:34,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 45 transitions, 268 flow [2023-08-29 20:08:34,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 45 transitions, 234 flow, removed 9 selfloop flow, removed 7 redundant places. [2023-08-29 20:08:34,315 INFO L231 Difference]: Finished difference. Result has 56 places, 37 transitions, 165 flow [2023-08-29 20:08:34,315 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=165, PETRI_PLACES=56, PETRI_TRANSITIONS=37} [2023-08-29 20:08:34,316 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 14 predicate places. [2023-08-29 20:08:34,316 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 37 transitions, 165 flow [2023-08-29 20:08:34,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:34,316 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:08:34,316 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:08:34,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-08-29 20:08:34,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:08:34,523 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2023-08-29 20:08:34,523 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:08:34,523 INFO L85 PathProgramCache]: Analyzing trace with hash 225228198, now seen corresponding path program 1 times [2023-08-29 20:08:34,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:08:34,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1190952350] [2023-08-29 20:08:34,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:08:34,523 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:08:34,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:08:34,524 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:08:34,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-08-29 20:08:34,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:08:34,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:08:34,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:08:34,625 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-29 20:08:34,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 20:08:34,676 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-29 20:08:34,677 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:08:34,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1190952350] [2023-08-29 20:08:34,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1190952350] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 20:08:34,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-29 20:08:34,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-08-29 20:08:34,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841450595] [2023-08-29 20:08:34,677 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-29 20:08:34,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-29 20:08:34,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:08:34,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-29 20:08:34,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-08-29 20:08:34,695 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 134 [2023-08-29 20:08:34,695 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 37 transitions, 165 flow. Second operand has 12 states, 12 states have (on average 46.416666666666664) internal successors, (557), 12 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:34,695 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:08:34,695 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 134 [2023-08-29 20:08:34,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:08:34,856 INFO L130 PetriNetUnfolder]: 52/140 cut-off events. [2023-08-29 20:08:34,856 INFO L131 PetriNetUnfolder]: For 78/78 co-relation queries the response was YES. [2023-08-29 20:08:34,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 405 conditions, 140 events. 52/140 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 503 event pairs, 22 based on Foata normal form. 2/140 useless extension candidates. Maximal degree in co-relation 392. Up to 64 conditions per place. [2023-08-29 20:08:34,857 INFO L137 encePairwiseOnDemand]: 124/134 looper letters, 19 selfloop transitions, 7 changer transitions 16/47 dead transitions. [2023-08-29 20:08:34,857 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 47 transitions, 276 flow [2023-08-29 20:08:34,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-29 20:08:34,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-29 20:08:34,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 571 transitions. [2023-08-29 20:08:34,859 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35509950248756217 [2023-08-29 20:08:34,859 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 571 transitions. [2023-08-29 20:08:34,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 571 transitions. [2023-08-29 20:08:34,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:08:34,859 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 571 transitions. [2023-08-29 20:08:34,861 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 47.583333333333336) internal successors, (571), 12 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:34,863 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 134.0) internal successors, (1742), 13 states have internal predecessors, (1742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:34,863 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 134.0) internal successors, (1742), 13 states have internal predecessors, (1742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:34,863 INFO L175 Difference]: Start difference. First operand has 56 places, 37 transitions, 165 flow. Second operand 12 states and 571 transitions. [2023-08-29 20:08:34,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 47 transitions, 276 flow [2023-08-29 20:08:34,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 47 transitions, 254 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-29 20:08:34,864 INFO L231 Difference]: Finished difference. Result has 58 places, 25 transitions, 107 flow [2023-08-29 20:08:34,864 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=107, PETRI_PLACES=58, PETRI_TRANSITIONS=25} [2023-08-29 20:08:34,865 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 16 predicate places. [2023-08-29 20:08:34,865 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 25 transitions, 107 flow [2023-08-29 20:08:34,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 46.416666666666664) internal successors, (557), 12 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:34,865 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:08:34,865 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:08:34,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-08-29 20:08:35,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:08:35,072 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2023-08-29 20:08:35,073 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:08:35,073 INFO L85 PathProgramCache]: Analyzing trace with hash -696229358, now seen corresponding path program 1 times [2023-08-29 20:08:35,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:08:35,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [934811056] [2023-08-29 20:08:35,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:08:35,073 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:08:35,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:08:35,074 INFO L229 MonitoredProcess]: Starting monitored process 15 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:08:35,077 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 (15)] Waiting until timeout for monitored process [2023-08-29 20:08:35,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:08:35,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:08:35,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:08:35,152 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 20:08:35,153 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:08:35,153 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:08:35,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [934811056] [2023-08-29 20:08:35,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [934811056] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:08:35,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:08:35,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:08:35,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867521315] [2023-08-29 20:08:35,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:08:35,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:08:35,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:08:35,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:08:35,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:08:35,188 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 134 [2023-08-29 20:08:35,189 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 25 transitions, 107 flow. Second operand has 7 states, 7 states have (on average 48.285714285714285) internal successors, (338), 7 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:35,189 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:08:35,189 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 134 [2023-08-29 20:08:35,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:08:35,258 INFO L130 PetriNetUnfolder]: 11/45 cut-off events. [2023-08-29 20:08:35,259 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2023-08-29 20:08:35,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 45 events. 11/45 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 104 event pairs, 4 based on Foata normal form. 2/45 useless extension candidates. Maximal degree in co-relation 117. Up to 16 conditions per place. [2023-08-29 20:08:35,259 INFO L137 encePairwiseOnDemand]: 127/134 looper letters, 0 selfloop transitions, 0 changer transitions 21/21 dead transitions. [2023-08-29 20:08:35,259 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 21 transitions, 119 flow [2023-08-29 20:08:35,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:08:35,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:08:35,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 387 transitions. [2023-08-29 20:08:35,260 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36100746268656714 [2023-08-29 20:08:35,260 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 387 transitions. [2023-08-29 20:08:35,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 387 transitions. [2023-08-29 20:08:35,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:08:35,261 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 387 transitions. [2023-08-29 20:08:35,261 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 48.375) internal successors, (387), 8 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:35,262 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 134.0) internal successors, (1206), 9 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:35,262 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 134.0) internal successors, (1206), 9 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:35,262 INFO L175 Difference]: Start difference. First operand has 58 places, 25 transitions, 107 flow. Second operand 8 states and 387 transitions. [2023-08-29 20:08:35,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 21 transitions, 119 flow [2023-08-29 20:08:35,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 21 transitions, 98 flow, removed 0 selfloop flow, removed 11 redundant places. [2023-08-29 20:08:35,263 INFO L231 Difference]: Finished difference. Result has 33 places, 0 transitions, 0 flow [2023-08-29 20:08:35,263 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=49, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=0, PETRI_PLACES=33, PETRI_TRANSITIONS=0} [2023-08-29 20:08:35,263 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -9 predicate places. [2023-08-29 20:08:35,264 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 0 transitions, 0 flow [2023-08-29 20:08:35,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 48.285714285714285) internal successors, (338), 7 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:35,264 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 6 remaining) [2023-08-29 20:08:35,264 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2023-08-29 20:08:35,264 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2023-08-29 20:08:35,264 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (2 of 6 remaining) [2023-08-29 20:08:35,265 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 6 remaining) [2023-08-29 20:08:35,265 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 6 remaining) [2023-08-29 20:08:35,271 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 (15)] Forceful destruction successful, exit code 0 [2023-08-29 20:08:35,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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:08:35,471 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:08:35,472 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (1/2) [2023-08-29 20:08:35,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 79 transitions, 170 flow [2023-08-29 20:08:35,479 INFO L130 PetriNetUnfolder]: 7/111 cut-off events. [2023-08-29 20:08:35,479 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-29 20:08:35,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 111 events. 7/111 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 254 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 72. Up to 6 conditions per place. [2023-08-29 20:08:35,479 INFO L82 GeneralOperation]: Start removeDead. Operand has 79 places, 79 transitions, 170 flow [2023-08-29 20:08:35,480 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 79 places, 79 transitions, 170 flow [2023-08-29 20:08:35,480 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:08:35,480 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 79 transitions, 170 flow [2023-08-29 20:08:35,480 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 79 transitions, 170 flow [2023-08-29 20:08:35,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 79 transitions, 170 flow [2023-08-29 20:08:35,485 INFO L130 PetriNetUnfolder]: 7/111 cut-off events. [2023-08-29 20:08:35,485 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-29 20:08:35,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 111 events. 7/111 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 254 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 72. Up to 6 conditions per place. [2023-08-29 20:08:35,486 INFO L119 LiptonReduction]: Number of co-enabled transitions 2596 [2023-08-29 20:08:36,517 INFO L134 LiptonReduction]: Checked pairs total: 9478 [2023-08-29 20:08:36,517 INFO L136 LiptonReduction]: Total number of compositions: 55 [2023-08-29 20:08:36,518 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-29 20:08:36,518 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;@6a57f800, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:08:36,518 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-29 20:08:36,520 INFO L130 PetriNetUnfolder]: 1/37 cut-off events. [2023-08-29 20:08:36,520 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-29 20:08:36,520 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:08:36,521 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-29 20:08:36,521 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-29 20:08:36,521 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:08:36,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1657374181, now seen corresponding path program 1 times [2023-08-29 20:08:36,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:08:36,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1752538504] [2023-08-29 20:08:36,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:08:36,521 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:08:36,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:08:36,522 INFO L229 MonitoredProcess]: Starting monitored process 16 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:08:36,525 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 (16)] Waiting until timeout for monitored process [2023-08-29 20:08:36,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:08:36,569 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:08:36,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:08:36,587 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-29 20:08:36,587 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:08:36,587 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-29 20:08:36,596 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 (16)] Forceful destruction successful, exit code 0 [2023-08-29 20:08:36,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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:08:36,788 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-29 20:08:36,788 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-29 20:08:36,788 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-29 20:08:36,788 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-08-29 20:08:36,800 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:08:36,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 102 transitions, 225 flow [2023-08-29 20:08:36,808 INFO L130 PetriNetUnfolder]: 10/151 cut-off events. [2023-08-29 20:08:36,809 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2023-08-29 20:08:36,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 151 events. 10/151 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 407 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 115. Up to 8 conditions per place. [2023-08-29 20:08:36,809 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 102 transitions, 225 flow [2023-08-29 20:08:36,810 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 102 transitions, 225 flow [2023-08-29 20:08:36,810 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:08:36,810 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 102 transitions, 225 flow [2023-08-29 20:08:36,810 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 102 transitions, 225 flow [2023-08-29 20:08:36,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 102 transitions, 225 flow [2023-08-29 20:08:36,816 INFO L130 PetriNetUnfolder]: 10/151 cut-off events. [2023-08-29 20:08:36,817 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2023-08-29 20:08:36,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 151 events. 10/151 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 407 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 115. Up to 8 conditions per place. [2023-08-29 20:08:36,819 INFO L119 LiptonReduction]: Number of co-enabled transitions 5412 [2023-08-29 20:08:37,950 INFO L134 LiptonReduction]: Checked pairs total: 20068 [2023-08-29 20:08:37,950 INFO L136 LiptonReduction]: Total number of compositions: 67 [2023-08-29 20:08:37,951 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:08:37,951 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;@6a57f800, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:08:37,951 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-29 20:08:37,952 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-29 20:08:37,952 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:08:37,952 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:08:37,952 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-29 20:08:37,952 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2023-08-29 20:08:37,952 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:08:37,952 INFO L85 PathProgramCache]: Analyzing trace with hash 25456, now seen corresponding path program 1 times [2023-08-29 20:08:37,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:08:37,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [42571781] [2023-08-29 20:08:37,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:08:37,952 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:08:37,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:08:37,957 INFO L229 MonitoredProcess]: Starting monitored process 17 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:08:37,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-08-29 20:08:37,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:08:37,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-29 20:08:37,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:08:37,992 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:08:37,992 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:08:37,992 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:08:37,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [42571781] [2023-08-29 20:08:37,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [42571781] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:08:37,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:08:37,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:08:37,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063534693] [2023-08-29 20:08:37,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:08:37,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:08:37,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:08:37,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:08:37,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:08:37,993 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 169 [2023-08-29 20:08:37,993 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 54 transitions, 129 flow. Second operand has 2 states, 2 states have (on average 74.0) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:37,993 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:08:37,993 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 169 [2023-08-29 20:08:37,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:08:38,854 INFO L130 PetriNetUnfolder]: 7162/11374 cut-off events. [2023-08-29 20:08:38,854 INFO L131 PetriNetUnfolder]: For 529/529 co-relation queries the response was YES. [2023-08-29 20:08:38,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21671 conditions, 11374 events. 7162/11374 cut-off events. For 529/529 co-relation queries the response was YES. Maximal size of possible extension queue 659. Compared 85330 event pairs, 6210 based on Foata normal form. 0/9152 useless extension candidates. Maximal degree in co-relation 1818. Up to 9879 conditions per place. [2023-08-29 20:08:38,984 INFO L137 encePairwiseOnDemand]: 164/169 looper letters, 30 selfloop transitions, 0 changer transitions 0/49 dead transitions. [2023-08-29 20:08:38,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 49 transitions, 179 flow [2023-08-29 20:08:38,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:08:38,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:08:38,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 181 transitions. [2023-08-29 20:08:38,986 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5355029585798816 [2023-08-29 20:08:38,986 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 181 transitions. [2023-08-29 20:08:38,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 181 transitions. [2023-08-29 20:08:38,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:08:38,986 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 181 transitions. [2023-08-29 20:08:38,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 90.5) internal successors, (181), 2 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:38,987 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 169.0) internal successors, (507), 3 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:38,987 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 169.0) internal successors, (507), 3 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:38,987 INFO L175 Difference]: Start difference. First operand has 58 places, 54 transitions, 129 flow. Second operand 2 states and 181 transitions. [2023-08-29 20:08:38,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 49 transitions, 179 flow [2023-08-29 20:08:38,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 49 transitions, 173 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-08-29 20:08:38,988 INFO L231 Difference]: Finished difference. Result has 54 places, 49 transitions, 113 flow [2023-08-29 20:08:38,988 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=113, PETRI_PLACES=54, PETRI_TRANSITIONS=49} [2023-08-29 20:08:38,989 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -4 predicate places. [2023-08-29 20:08:38,989 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 49 transitions, 113 flow [2023-08-29 20:08:38,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 74.0) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:38,989 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:08:38,989 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-29 20:08:38,997 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 (17)] Forceful destruction successful, exit code 0 [2023-08-29 20:08:39,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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:08:39,193 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2023-08-29 20:08:39,193 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:08:39,193 INFO L85 PathProgramCache]: Analyzing trace with hash 25466, now seen corresponding path program 1 times [2023-08-29 20:08:39,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:08:39,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [293219453] [2023-08-29 20:08:39,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:08:39,193 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:08:39,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:08:39,194 INFO L229 MonitoredProcess]: Starting monitored process 18 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:08:39,195 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 (18)] Waiting until timeout for monitored process [2023-08-29 20:08:39,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:08:39,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-29 20:08:39,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:08:39,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-29 20:08:39,245 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:08:39,245 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:08:39,245 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:08:39,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [293219453] [2023-08-29 20:08:39,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [293219453] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:08:39,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:08:39,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:08:39,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874496065] [2023-08-29 20:08:39,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:08:39,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:08:39,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:08:39,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:08:39,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:08:39,260 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 169 [2023-08-29 20:08:39,261 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 49 transitions, 113 flow. Second operand has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:39,261 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:08:39,261 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 169 [2023-08-29 20:08:39,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:08:39,692 INFO L130 PetriNetUnfolder]: 5221/8413 cut-off events. [2023-08-29 20:08:39,692 INFO L131 PetriNetUnfolder]: For 213/213 co-relation queries the response was YES. [2023-08-29 20:08:39,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15944 conditions, 8413 events. 5221/8413 cut-off events. For 213/213 co-relation queries the response was YES. Maximal size of possible extension queue 489. Compared 61401 event pairs, 4507 based on Foata normal form. 0/7063 useless extension candidates. Maximal degree in co-relation 15938. Up to 7258 conditions per place. [2023-08-29 20:08:39,719 INFO L137 encePairwiseOnDemand]: 167/169 looper letters, 28 selfloop transitions, 1 changer transitions 0/48 dead transitions. [2023-08-29 20:08:39,719 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 48 transitions, 169 flow [2023-08-29 20:08:39,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:08:39,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:08:39,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 237 transitions. [2023-08-29 20:08:39,721 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46745562130177515 [2023-08-29 20:08:39,721 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 237 transitions. [2023-08-29 20:08:39,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 237 transitions. [2023-08-29 20:08:39,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:08:39,722 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 237 transitions. [2023-08-29 20:08:39,722 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:39,722 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:39,723 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:39,723 INFO L175 Difference]: Start difference. First operand has 54 places, 49 transitions, 113 flow. Second operand 3 states and 237 transitions. [2023-08-29 20:08:39,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 48 transitions, 169 flow [2023-08-29 20:08:39,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 48 transitions, 169 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:08:39,724 INFO L231 Difference]: Finished difference. Result has 55 places, 48 transitions, 113 flow [2023-08-29 20:08:39,724 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=113, PETRI_PLACES=55, PETRI_TRANSITIONS=48} [2023-08-29 20:08:39,724 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places. [2023-08-29 20:08:39,724 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 113 flow [2023-08-29 20:08:39,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:39,724 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:08:39,725 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-29 20:08:39,736 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 (18)] Forceful destruction successful, exit code 0 [2023-08-29 20:08:39,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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:08:39,931 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2023-08-29 20:08:39,931 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:08:39,931 INFO L85 PathProgramCache]: Analyzing trace with hash 25465, now seen corresponding path program 1 times [2023-08-29 20:08:39,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:08:39,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1260468700] [2023-08-29 20:08:39,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:08:39,931 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:08:39,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:08:39,932 INFO L229 MonitoredProcess]: Starting monitored process 19 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:08:39,933 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 (19)] Waiting until timeout for monitored process [2023-08-29 20:08:39,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:08:39,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-29 20:08:39,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:08:39,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-08-29 20:08:39,973 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:08:39,973 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:08:39,973 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:08:39,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1260468700] [2023-08-29 20:08:39,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1260468700] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:08:39,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:08:39,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:08:39,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743303198] [2023-08-29 20:08:39,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:08:39,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:08:39,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:08:39,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:08:39,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:08:39,993 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 169 [2023-08-29 20:08:39,994 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 48 transitions, 113 flow. Second operand has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:39,994 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:08:39,994 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 169 [2023-08-29 20:08:39,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:08:40,292 INFO L130 PetriNetUnfolder]: 3280/5452 cut-off events. [2023-08-29 20:08:40,292 INFO L131 PetriNetUnfolder]: For 213/213 co-relation queries the response was YES. [2023-08-29 20:08:40,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10365 conditions, 5452 events. 3280/5452 cut-off events. For 213/213 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 38278 event pairs, 2804 based on Foata normal form. 0/4974 useless extension candidates. Maximal degree in co-relation 10358. Up to 4638 conditions per place. [2023-08-29 20:08:40,315 INFO L137 encePairwiseOnDemand]: 167/169 looper letters, 27 selfloop transitions, 1 changer transitions 0/47 dead transitions. [2023-08-29 20:08:40,315 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 47 transitions, 167 flow [2023-08-29 20:08:40,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:08:40,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:08:40,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 230 transitions. [2023-08-29 20:08:40,316 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4536489151873767 [2023-08-29 20:08:40,316 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 230 transitions. [2023-08-29 20:08:40,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 230 transitions. [2023-08-29 20:08:40,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:08:40,317 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 230 transitions. [2023-08-29 20:08:40,317 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:40,318 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:40,318 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:40,318 INFO L175 Difference]: Start difference. First operand has 55 places, 48 transitions, 113 flow. Second operand 3 states and 230 transitions. [2023-08-29 20:08:40,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 47 transitions, 167 flow [2023-08-29 20:08:40,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 47 transitions, 166 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:08:40,319 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 112 flow [2023-08-29 20:08:40,319 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=55, PETRI_TRANSITIONS=47} [2023-08-29 20:08:40,319 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places. [2023-08-29 20:08:40,320 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 47 transitions, 112 flow [2023-08-29 20:08:40,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:40,320 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:08:40,320 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:08:40,328 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 (19)] Forceful destruction successful, exit code 0 [2023-08-29 20:08:40,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /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:08:40,526 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2023-08-29 20:08:40,527 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:08:40,527 INFO L85 PathProgramCache]: Analyzing trace with hash -141250224, now seen corresponding path program 1 times [2023-08-29 20:08:40,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:08:40,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1011164606] [2023-08-29 20:08:40,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:08:40,527 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:08:40,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:08:40,528 INFO L229 MonitoredProcess]: Starting monitored process 20 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:08:40,532 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 (20)] Waiting until timeout for monitored process [2023-08-29 20:08:40,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:08:40,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-29 20:08:40,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:08:40,590 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:08:40,590 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:08:40,591 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:08:40,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1011164606] [2023-08-29 20:08:40,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1011164606] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:08:40,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:08:40,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:08:40,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581239984] [2023-08-29 20:08:40,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:08:40,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:08:40,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:08:40,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:08:40,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:08:40,615 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 169 [2023-08-29 20:08:40,617 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 47 transitions, 112 flow. Second operand has 5 states, 5 states have (on average 62.0) internal successors, (310), 5 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:40,617 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:08:40,617 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 169 [2023-08-29 20:08:40,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:08:41,628 INFO L130 PetriNetUnfolder]: 12355/19121 cut-off events. [2023-08-29 20:08:41,629 INFO L131 PetriNetUnfolder]: For 657/657 co-relation queries the response was YES. [2023-08-29 20:08:41,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37606 conditions, 19121 events. 12355/19121 cut-off events. For 657/657 co-relation queries the response was YES. Maximal size of possible extension queue 1107. Compared 144806 event pairs, 2185 based on Foata normal form. 280/18732 useless extension candidates. Maximal degree in co-relation 37599. Up to 7379 conditions per place. [2023-08-29 20:08:41,696 INFO L137 encePairwiseOnDemand]: 157/169 looper letters, 130 selfloop transitions, 26 changer transitions 0/168 dead transitions. [2023-08-29 20:08:41,696 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 168 transitions, 706 flow [2023-08-29 20:08:41,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:08:41,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:08:41,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 587 transitions. [2023-08-29 20:08:41,698 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49619611158072696 [2023-08-29 20:08:41,698 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 587 transitions. [2023-08-29 20:08:41,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 587 transitions. [2023-08-29 20:08:41,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:08:41,699 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 587 transitions. [2023-08-29 20:08:41,699 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 83.85714285714286) internal successors, (587), 7 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:41,701 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 169.0) internal successors, (1352), 8 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:41,701 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 169.0) internal successors, (1352), 8 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:41,701 INFO L175 Difference]: Start difference. First operand has 55 places, 47 transitions, 112 flow. Second operand 7 states and 587 transitions. [2023-08-29 20:08:41,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 168 transitions, 706 flow [2023-08-29 20:08:41,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 168 transitions, 705 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:08:41,703 INFO L231 Difference]: Finished difference. Result has 66 places, 77 transitions, 325 flow [2023-08-29 20:08:41,703 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=325, PETRI_PLACES=66, PETRI_TRANSITIONS=77} [2023-08-29 20:08:41,703 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 8 predicate places. [2023-08-29 20:08:41,704 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 77 transitions, 325 flow [2023-08-29 20:08:41,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 62.0) internal successors, (310), 5 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:41,704 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:08:41,704 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:08:41,713 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 (20)] Forceful destruction successful, exit code 0 [2023-08-29 20:08:41,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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:08:41,910 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2023-08-29 20:08:41,911 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:08:41,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1680431213, now seen corresponding path program 1 times [2023-08-29 20:08:41,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:08:41,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1778100047] [2023-08-29 20:08:41,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:08:41,911 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:08:41,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:08:41,912 INFO L229 MonitoredProcess]: Starting monitored process 21 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:08:41,914 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 (21)] Waiting until timeout for monitored process [2023-08-29 20:08:41,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:08:41,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-29 20:08:41,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:08:41,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:08:41,966 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:08:41,966 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:08:41,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1778100047] [2023-08-29 20:08:41,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1778100047] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:08:41,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:08:41,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:08:41,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675637466] [2023-08-29 20:08:41,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:08:41,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:08:41,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:08:41,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:08:41,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:08:41,973 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 169 [2023-08-29 20:08:41,974 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 77 transitions, 325 flow. Second operand has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:41,974 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:08:41,974 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 169 [2023-08-29 20:08:41,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:08:42,609 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([725] L719-1-->L724: Formula: (not (= v_~count~0_158 (_ bv3 32))) InVars {~count~0=v_~count~0_158} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_158} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [thr1Thread1of3ForFork0InUse, Black: 130#(= ~count~0 (_ bv0 32)), thr1Thread2of3ForFork0InUse, Black: 147#(= ~count~0 (_ bv1 32)), Black: 161#(and (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32)) (= ~count~0 (_ bv0 32))), thr1Thread3of3ForFork0InUse, Black: 143#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32)), Black: 163#(and (= ~count~0 (_ bv1 32)) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32))), 105#true, 125#true, 116#(and (= |ULTIMATE.start_main_~#t~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 15#L724-5true, 12#L733-5true, 123#(= (bvadd (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) (_ bv1 1)) (_ bv0 1)), 11#L725true, 176#(= ~COND~0 (_ bv0 8)), 89#L724true]) [2023-08-29 20:08:42,609 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-29 20:08:42,609 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-29 20:08:42,609 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-29 20:08:42,609 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-29 20:08:42,612 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([724] L719-1-->L721: Formula: (= v_~count~0_156 (_ bv3 32)) InVars {~count~0=v_~count~0_156} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_156} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [thr1Thread1of3ForFork0InUse, Black: 130#(= ~count~0 (_ bv0 32)), thr1Thread2of3ForFork0InUse, Black: 147#(= ~count~0 (_ bv1 32)), Black: 161#(and (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32)) (= ~count~0 (_ bv0 32))), thr1Thread3of3ForFork0InUse, Black: 143#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32)), Black: 163#(and (= ~count~0 (_ bv1 32)) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32))), 105#true, 125#true, 116#(and (= |ULTIMATE.start_main_~#t~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 15#L724-5true, 85#L721true, 12#L733-5true, 123#(= (bvadd (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) (_ bv1 1)) (_ bv0 1)), 11#L725true, 176#(= ~COND~0 (_ bv0 8))]) [2023-08-29 20:08:42,612 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-29 20:08:42,613 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-29 20:08:42,613 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-29 20:08:42,613 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-29 20:08:42,634 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([721] L719-1-->L721: Formula: (= v_~count~0_152 (_ bv3 32)) InVars {~count~0=v_~count~0_152} OutVars{thr1Thread3of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_152} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_Barrier2_#t~post4#1][39], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, Black: 130#(= ~count~0 (_ bv0 32)), Black: 147#(= ~count~0 (_ bv1 32)), thr1Thread3of3ForFork0InUse, Black: 161#(and (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32)) (= ~count~0 (_ bv0 32))), Black: 143#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32)), Black: 163#(and (= ~count~0 (_ bv1 32)) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32))), 71#L725true, 105#true, 95#L721true, 125#true, 116#(and (= |ULTIMATE.start_main_~#t~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 15#L724-5true, 12#L733-5true, 123#(= (bvadd (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) (_ bv1 1)) (_ bv0 1)), 176#(= ~COND~0 (_ bv0 8))]) [2023-08-29 20:08:42,634 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-29 20:08:42,634 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-29 20:08:42,634 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-29 20:08:42,634 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-29 20:08:42,634 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([722] L719-1-->L724: Formula: (not (= v_~count~0_154 (_ bv3 32))) InVars {~count~0=v_~count~0_154} OutVars{thr1Thread3of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_154} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_Barrier2_#t~post4#1][40], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, Black: 130#(= ~count~0 (_ bv0 32)), Black: 147#(= ~count~0 (_ bv1 32)), Black: 161#(and (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32)) (= ~count~0 (_ bv0 32))), thr1Thread3of3ForFork0InUse, Black: 143#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32)), Black: 163#(and (= ~count~0 (_ bv1 32)) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32))), 71#L725true, 105#true, 125#true, 116#(and (= |ULTIMATE.start_main_~#t~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 15#L724-5true, 78#L724true, 12#L733-5true, 123#(= (bvadd (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) (_ bv1 1)) (_ bv0 1)), 176#(= ~COND~0 (_ bv0 8))]) [2023-08-29 20:08:42,635 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-29 20:08:42,635 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-29 20:08:42,635 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-29 20:08:42,635 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-29 20:08:42,779 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([725] L719-1-->L724: Formula: (not (= v_~count~0_158 (_ bv3 32))) InVars {~count~0=v_~count~0_158} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_158} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [thr1Thread1of3ForFork0InUse, Black: 130#(= ~count~0 (_ bv0 32)), thr1Thread2of3ForFork0InUse, Black: 147#(= ~count~0 (_ bv1 32)), Black: 161#(and (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32)) (= ~count~0 (_ bv0 32))), thr1Thread3of3ForFork0InUse, Black: 143#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32)), Black: 163#(and (= ~count~0 (_ bv1 32)) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32))), 105#true, 125#true, 94#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, 116#(and (= |ULTIMATE.start_main_~#t~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 15#L724-5true, 12#L733-5true, 123#(= (bvadd (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) (_ bv1 1)) (_ bv0 1)), 176#(= ~COND~0 (_ bv0 8)), 89#L724true]) [2023-08-29 20:08:42,780 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-29 20:08:42,780 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-29 20:08:42,780 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-29 20:08:42,780 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-29 20:08:42,783 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([724] L719-1-->L721: Formula: (= v_~count~0_156 (_ bv3 32)) InVars {~count~0=v_~count~0_156} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_156} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [thr1Thread1of3ForFork0InUse, Black: 130#(= ~count~0 (_ bv0 32)), thr1Thread2of3ForFork0InUse, Black: 147#(= ~count~0 (_ bv1 32)), Black: 161#(and (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32)) (= ~count~0 (_ bv0 32))), thr1Thread3of3ForFork0InUse, Black: 143#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32)), Black: 163#(and (= ~count~0 (_ bv1 32)) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32))), 105#true, 125#true, 94#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, 116#(and (= |ULTIMATE.start_main_~#t~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 15#L724-5true, 85#L721true, 12#L733-5true, 123#(= (bvadd (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) (_ bv1 1)) (_ bv0 1)), 176#(= ~COND~0 (_ bv0 8))]) [2023-08-29 20:08:42,784 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-29 20:08:42,784 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-29 20:08:42,784 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-29 20:08:42,784 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-29 20:08:42,808 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([721] L719-1-->L721: Formula: (= v_~count~0_152 (_ bv3 32)) InVars {~count~0=v_~count~0_152} OutVars{thr1Thread3of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_152} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_Barrier2_#t~post4#1][39], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, Black: 130#(= ~count~0 (_ bv0 32)), Black: 147#(= ~count~0 (_ bv1 32)), thr1Thread3of3ForFork0InUse, Black: 161#(and (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32)) (= ~count~0 (_ bv0 32))), Black: 143#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32)), Black: 163#(and (= ~count~0 (_ bv1 32)) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32))), 105#true, 95#L721true, 125#true, 116#(and (= |ULTIMATE.start_main_~#t~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 15#L724-5true, 90#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, 12#L733-5true, 123#(= (bvadd (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) (_ bv1 1)) (_ bv0 1)), 176#(= ~COND~0 (_ bv0 8))]) [2023-08-29 20:08:42,808 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-29 20:08:42,808 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-29 20:08:42,808 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-29 20:08:42,809 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-29 20:08:42,809 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([722] L719-1-->L724: Formula: (not (= v_~count~0_154 (_ bv3 32))) InVars {~count~0=v_~count~0_154} OutVars{thr1Thread3of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_154} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_Barrier2_#t~post4#1][40], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, Black: 130#(= ~count~0 (_ bv0 32)), Black: 147#(= ~count~0 (_ bv1 32)), Black: 161#(and (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32)) (= ~count~0 (_ bv0 32))), thr1Thread3of3ForFork0InUse, Black: 143#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32)), Black: 163#(and (= ~count~0 (_ bv1 32)) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32))), 105#true, 125#true, 116#(and (= |ULTIMATE.start_main_~#t~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 15#L724-5true, 90#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, 78#L724true, 12#L733-5true, 123#(= (bvadd (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) (_ bv1 1)) (_ bv0 1)), 176#(= ~COND~0 (_ bv0 8))]) [2023-08-29 20:08:42,809 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-29 20:08:42,809 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-29 20:08:42,809 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-29 20:08:42,809 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-29 20:08:42,816 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([725] L719-1-->L724: Formula: (not (= v_~count~0_158 (_ bv3 32))) InVars {~count~0=v_~count~0_158} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_158} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, Black: 130#(= ~count~0 (_ bv0 32)), Black: 147#(= ~count~0 (_ bv1 32)), thr1Thread3of3ForFork0InUse, Black: 161#(and (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32)) (= ~count~0 (_ bv0 32))), Black: 143#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32)), Black: 163#(and (= ~count~0 (_ bv1 32)) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32))), 105#true, 125#true, 94#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, 116#(and (= |ULTIMATE.start_main_~#t~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 15#L724-5true, 12#L733-5true, 123#(= (bvadd (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) (_ bv1 1)) (_ bv0 1)), 176#(= ~COND~0 (_ bv0 8)), 89#L724true]) [2023-08-29 20:08:42,816 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-29 20:08:42,816 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-29 20:08:42,816 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-29 20:08:42,816 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-29 20:08:42,816 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-29 20:08:42,816 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([724] L719-1-->L721: Formula: (= v_~count~0_156 (_ bv3 32)) InVars {~count~0=v_~count~0_156} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_156} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [thr1Thread1of3ForFork0InUse, Black: 130#(= ~count~0 (_ bv0 32)), thr1Thread2of3ForFork0InUse, Black: 147#(= ~count~0 (_ bv1 32)), Black: 161#(and (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32)) (= ~count~0 (_ bv0 32))), thr1Thread3of3ForFork0InUse, Black: 143#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32)), Black: 163#(and (= ~count~0 (_ bv1 32)) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32))), 105#true, 125#true, 94#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, 116#(and (= |ULTIMATE.start_main_~#t~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 15#L724-5true, 85#L721true, 12#L733-5true, 123#(= (bvadd (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) (_ bv1 1)) (_ bv0 1)), 176#(= ~COND~0 (_ bv0 8))]) [2023-08-29 20:08:42,816 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-29 20:08:42,816 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-29 20:08:42,816 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-29 20:08:42,816 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-29 20:08:42,816 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-29 20:08:42,875 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([725] L719-1-->L724: Formula: (not (= v_~count~0_158 (_ bv3 32))) InVars {~count~0=v_~count~0_158} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_158} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, Black: 130#(= ~count~0 (_ bv0 32)), Black: 147#(= ~count~0 (_ bv1 32)), thr1Thread3of3ForFork0InUse, Black: 161#(and (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32)) (= ~count~0 (_ bv0 32))), Black: 143#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32)), Black: 163#(and (= ~count~0 (_ bv1 32)) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32))), 105#true, 125#true, 34#L733-4true, 116#(and (= |ULTIMATE.start_main_~#t~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 15#L724-5true, 123#(= (bvadd (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) (_ bv1 1)) (_ bv0 1)), 11#L725true, 176#(= ~COND~0 (_ bv0 8)), 89#L724true]) [2023-08-29 20:08:42,875 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-29 20:08:42,876 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 20:08:42,876 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 20:08:42,876 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 20:08:42,876 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([724] L719-1-->L721: Formula: (= v_~count~0_156 (_ bv3 32)) InVars {~count~0=v_~count~0_156} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_156} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, Black: 130#(= ~count~0 (_ bv0 32)), Black: 147#(= ~count~0 (_ bv1 32)), thr1Thread3of3ForFork0InUse, Black: 161#(and (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32)) (= ~count~0 (_ bv0 32))), Black: 143#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32)), Black: 163#(and (= ~count~0 (_ bv1 32)) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32))), 105#true, 125#true, 116#(and (= |ULTIMATE.start_main_~#t~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 34#L733-4true, 15#L724-5true, 85#L721true, 123#(= (bvadd (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) (_ bv1 1)) (_ bv0 1)), 11#L725true, 176#(= ~COND~0 (_ bv0 8))]) [2023-08-29 20:08:42,876 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-29 20:08:42,876 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 20:08:42,876 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 20:08:42,876 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 20:08:42,920 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([725] L719-1-->L724: Formula: (not (= v_~count~0_158 (_ bv3 32))) InVars {~count~0=v_~count~0_158} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_158} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, Black: 130#(= ~count~0 (_ bv0 32)), Black: 147#(= ~count~0 (_ bv1 32)), thr1Thread3of3ForFork0InUse, Black: 161#(and (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32)) (= ~count~0 (_ bv0 32))), Black: 143#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32)), Black: 163#(and (= ~count~0 (_ bv1 32)) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32))), 105#true, 125#true, 94#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, 116#(and (= |ULTIMATE.start_main_~#t~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 39#L725true, 12#L733-5true, 123#(= (bvadd (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) (_ bv1 1)) (_ bv0 1)), 176#(= ~COND~0 (_ bv0 8)), 89#L724true]) [2023-08-29 20:08:42,920 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-29 20:08:42,920 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-29 20:08:42,920 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-29 20:08:42,920 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-29 20:08:42,920 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([724] L719-1-->L721: Formula: (= v_~count~0_156 (_ bv3 32)) InVars {~count~0=v_~count~0_156} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_156} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, Black: 130#(= ~count~0 (_ bv0 32)), Black: 147#(= ~count~0 (_ bv1 32)), thr1Thread3of3ForFork0InUse, Black: 161#(and (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32)) (= ~count~0 (_ bv0 32))), Black: 143#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32)), Black: 163#(and (= ~count~0 (_ bv1 32)) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32))), 105#true, 125#true, 94#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, 116#(and (= |ULTIMATE.start_main_~#t~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 85#L721true, 39#L725true, 12#L733-5true, 123#(= (bvadd (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) (_ bv1 1)) (_ bv0 1)), 176#(= ~COND~0 (_ bv0 8))]) [2023-08-29 20:08:42,921 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-29 20:08:42,921 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-29 20:08:42,921 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-29 20:08:42,921 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-29 20:08:42,973 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([721] L719-1-->L721: Formula: (= v_~count~0_152 (_ bv3 32)) InVars {~count~0=v_~count~0_152} OutVars{thr1Thread3of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_152} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_Barrier2_#t~post4#1][39], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, Black: 130#(= ~count~0 (_ bv0 32)), Black: 147#(= ~count~0 (_ bv1 32)), thr1Thread3of3ForFork0InUse, Black: 161#(and (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32)) (= ~count~0 (_ bv0 32))), Black: 143#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32)), Black: 163#(and (= ~count~0 (_ bv1 32)) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32))), 71#L725true, 105#true, 95#L721true, 125#true, 116#(and (= |ULTIMATE.start_main_~#t~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 34#L733-4true, 15#L724-5true, 123#(= (bvadd (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) (_ bv1 1)) (_ bv0 1)), 176#(= ~COND~0 (_ bv0 8))]) [2023-08-29 20:08:42,973 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-29 20:08:42,973 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 20:08:42,973 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 20:08:42,973 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 20:08:42,973 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([722] L719-1-->L724: Formula: (not (= v_~count~0_154 (_ bv3 32))) InVars {~count~0=v_~count~0_154} OutVars{thr1Thread3of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_154} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_Barrier2_#t~post4#1][40], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, Black: 130#(= ~count~0 (_ bv0 32)), Black: 147#(= ~count~0 (_ bv1 32)), Black: 161#(and (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32)) (= ~count~0 (_ bv0 32))), thr1Thread3of3ForFork0InUse, Black: 143#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32)), Black: 163#(and (= ~count~0 (_ bv1 32)) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32))), 71#L725true, 105#true, 125#true, 34#L733-4true, 116#(and (= |ULTIMATE.start_main_~#t~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 15#L724-5true, 78#L724true, 123#(= (bvadd (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) (_ bv1 1)) (_ bv0 1)), 176#(= ~COND~0 (_ bv0 8))]) [2023-08-29 20:08:42,973 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-29 20:08:42,973 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 20:08:42,974 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 20:08:42,974 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 20:08:42,984 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([725] L719-1-->L724: Formula: (not (= v_~count~0_158 (_ bv3 32))) InVars {~count~0=v_~count~0_158} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_158} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, Black: 130#(= ~count~0 (_ bv0 32)), Black: 147#(= ~count~0 (_ bv1 32)), thr1Thread3of3ForFork0InUse, Black: 161#(and (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32)) (= ~count~0 (_ bv0 32))), Black: 143#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32)), Black: 163#(and (= ~count~0 (_ bv1 32)) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32))), 105#true, 125#true, 94#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, 34#L733-4true, 116#(and (= |ULTIMATE.start_main_~#t~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 15#L724-5true, 123#(= (bvadd (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) (_ bv1 1)) (_ bv0 1)), 176#(= ~COND~0 (_ bv0 8)), 89#L724true]) [2023-08-29 20:08:42,984 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-29 20:08:42,984 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 20:08:42,984 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 20:08:42,984 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 20:08:42,984 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([724] L719-1-->L721: Formula: (= v_~count~0_156 (_ bv3 32)) InVars {~count~0=v_~count~0_156} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_156} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, Black: 130#(= ~count~0 (_ bv0 32)), Black: 147#(= ~count~0 (_ bv1 32)), thr1Thread3of3ForFork0InUse, Black: 161#(and (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32)) (= ~count~0 (_ bv0 32))), Black: 143#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32)), Black: 163#(and (= ~count~0 (_ bv1 32)) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32))), 105#true, 125#true, 94#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, 116#(and (= |ULTIMATE.start_main_~#t~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 34#L733-4true, 15#L724-5true, 85#L721true, 123#(= (bvadd (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) (_ bv1 1)) (_ bv0 1)), 176#(= ~COND~0 (_ bv0 8))]) [2023-08-29 20:08:42,984 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-29 20:08:42,984 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 20:08:42,984 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 20:08:42,984 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 20:08:43,019 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([725] L719-1-->L724: Formula: (not (= v_~count~0_158 (_ bv3 32))) InVars {~count~0=v_~count~0_158} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_158} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, Black: 130#(= ~count~0 (_ bv0 32)), Black: 147#(= ~count~0 (_ bv1 32)), thr1Thread3of3ForFork0InUse, Black: 161#(and (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32)) (= ~count~0 (_ bv0 32))), Black: 143#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32)), Black: 163#(and (= ~count~0 (_ bv1 32)) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32))), 105#true, 125#true, 94#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, 116#(and (= |ULTIMATE.start_main_~#t~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 12#L733-5true, 123#(= (bvadd (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) (_ bv1 1)) (_ bv0 1)), 76#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, 176#(= ~COND~0 (_ bv0 8)), 89#L724true]) [2023-08-29 20:08:43,019 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-29 20:08:43,019 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 20:08:43,019 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 20:08:43,019 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 20:08:43,019 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([724] L719-1-->L721: Formula: (= v_~count~0_156 (_ bv3 32)) InVars {~count~0=v_~count~0_156} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_156} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, Black: 130#(= ~count~0 (_ bv0 32)), Black: 147#(= ~count~0 (_ bv1 32)), thr1Thread3of3ForFork0InUse, Black: 161#(and (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32)) (= ~count~0 (_ bv0 32))), Black: 143#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32)), Black: 163#(and (= ~count~0 (_ bv1 32)) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32))), 105#true, 125#true, 94#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, 116#(and (= |ULTIMATE.start_main_~#t~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 85#L721true, 12#L733-5true, 123#(= (bvadd (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) (_ bv1 1)) (_ bv0 1)), 76#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, 176#(= ~COND~0 (_ bv0 8))]) [2023-08-29 20:08:43,019 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-29 20:08:43,019 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 20:08:43,019 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 20:08:43,019 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 20:08:43,071 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([721] L719-1-->L721: Formula: (= v_~count~0_152 (_ bv3 32)) InVars {~count~0=v_~count~0_152} OutVars{thr1Thread3of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_152} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_Barrier2_#t~post4#1][39], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, Black: 130#(= ~count~0 (_ bv0 32)), Black: 147#(= ~count~0 (_ bv1 32)), thr1Thread3of3ForFork0InUse, Black: 161#(and (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32)) (= ~count~0 (_ bv0 32))), Black: 143#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32)), Black: 163#(and (= ~count~0 (_ bv1 32)) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32))), 105#true, 95#L721true, 125#true, 116#(and (= |ULTIMATE.start_main_~#t~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 34#L733-4true, 15#L724-5true, 90#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, 123#(= (bvadd (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) (_ bv1 1)) (_ bv0 1)), 176#(= ~COND~0 (_ bv0 8))]) [2023-08-29 20:08:43,071 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-29 20:08:43,072 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 20:08:43,072 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 20:08:43,072 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 20:08:43,072 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([722] L719-1-->L724: Formula: (not (= v_~count~0_154 (_ bv3 32))) InVars {~count~0=v_~count~0_154} OutVars{thr1Thread3of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_154} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_Barrier2_#t~post4#1][40], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, Black: 130#(= ~count~0 (_ bv0 32)), Black: 147#(= ~count~0 (_ bv1 32)), Black: 161#(and (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32)) (= ~count~0 (_ bv0 32))), thr1Thread3of3ForFork0InUse, Black: 143#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32)), Black: 163#(and (= ~count~0 (_ bv1 32)) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32))), 105#true, 125#true, 34#L733-4true, 116#(and (= |ULTIMATE.start_main_~#t~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 15#L724-5true, 90#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, 78#L724true, 123#(= (bvadd (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) (_ bv1 1)) (_ bv0 1)), 176#(= ~COND~0 (_ bv0 8))]) [2023-08-29 20:08:43,072 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-29 20:08:43,072 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 20:08:43,072 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 20:08:43,072 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 20:08:43,079 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([725] L719-1-->L724: Formula: (not (= v_~count~0_158 (_ bv3 32))) InVars {~count~0=v_~count~0_158} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_158} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, Black: 130#(= ~count~0 (_ bv0 32)), Black: 147#(= ~count~0 (_ bv1 32)), thr1Thread3of3ForFork0InUse, Black: 161#(and (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32)) (= ~count~0 (_ bv0 32))), Black: 143#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32)), Black: 163#(and (= ~count~0 (_ bv1 32)) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32))), 105#true, 125#true, 94#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, 116#(and (= |ULTIMATE.start_main_~#t~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 34#L733-4true, 15#L724-5true, 123#(= (bvadd (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) (_ bv1 1)) (_ bv0 1)), 176#(= ~COND~0 (_ bv0 8)), 89#L724true]) [2023-08-29 20:08:43,079 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-29 20:08:43,079 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 20:08:43,079 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 20:08:43,079 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 20:08:43,079 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 20:08:43,080 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([724] L719-1-->L721: Formula: (= v_~count~0_156 (_ bv3 32)) InVars {~count~0=v_~count~0_156} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_156} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, Black: 130#(= ~count~0 (_ bv0 32)), Black: 147#(= ~count~0 (_ bv1 32)), thr1Thread3of3ForFork0InUse, Black: 161#(and (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32)) (= ~count~0 (_ bv0 32))), Black: 143#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32)), Black: 163#(and (= ~count~0 (_ bv1 32)) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32))), 105#true, 125#true, 94#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, 116#(and (= |ULTIMATE.start_main_~#t~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 34#L733-4true, 15#L724-5true, 85#L721true, 123#(= (bvadd (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) (_ bv1 1)) (_ bv0 1)), 176#(= ~COND~0 (_ bv0 8))]) [2023-08-29 20:08:43,080 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-29 20:08:43,080 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 20:08:43,080 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 20:08:43,080 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 20:08:43,080 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 20:08:43,152 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([725] L719-1-->L724: Formula: (not (= v_~count~0_158 (_ bv3 32))) InVars {~count~0=v_~count~0_158} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_158} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, Black: 130#(= ~count~0 (_ bv0 32)), Black: 147#(= ~count~0 (_ bv1 32)), thr1Thread3of3ForFork0InUse, Black: 161#(and (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32)) (= ~count~0 (_ bv0 32))), Black: 143#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32)), Black: 163#(and (= ~count~0 (_ bv1 32)) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32))), 105#true, 125#true, 94#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, 116#(and (= |ULTIMATE.start_main_~#t~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 34#L733-4true, 39#L725true, 123#(= (bvadd (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) (_ bv1 1)) (_ bv0 1)), 176#(= ~COND~0 (_ bv0 8)), 89#L724true]) [2023-08-29 20:08:43,152 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-29 20:08:43,152 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 20:08:43,152 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 20:08:43,152 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 20:08:43,152 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([724] L719-1-->L721: Formula: (= v_~count~0_156 (_ bv3 32)) InVars {~count~0=v_~count~0_156} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_156} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [thr1Thread1of3ForFork0InUse, Black: 130#(= ~count~0 (_ bv0 32)), thr1Thread2of3ForFork0InUse, Black: 147#(= ~count~0 (_ bv1 32)), Black: 161#(and (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32)) (= ~count~0 (_ bv0 32))), thr1Thread3of3ForFork0InUse, Black: 143#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32)), Black: 163#(and (= ~count~0 (_ bv1 32)) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32))), 105#true, 125#true, 94#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, 116#(and (= |ULTIMATE.start_main_~#t~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 34#L733-4true, 85#L721true, 39#L725true, 123#(= (bvadd (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) (_ bv1 1)) (_ bv0 1)), 176#(= ~COND~0 (_ bv0 8))]) [2023-08-29 20:08:43,152 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-29 20:08:43,152 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 20:08:43,152 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 20:08:43,152 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 20:08:43,196 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([725] L719-1-->L724: Formula: (not (= v_~count~0_158 (_ bv3 32))) InVars {~count~0=v_~count~0_158} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_158} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, Black: 130#(= ~count~0 (_ bv0 32)), Black: 147#(= ~count~0 (_ bv1 32)), thr1Thread3of3ForFork0InUse, Black: 161#(and (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32)) (= ~count~0 (_ bv0 32))), Black: 143#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32)), Black: 163#(and (= ~count~0 (_ bv1 32)) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32))), 105#true, 125#true, 94#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, 116#(and (= |ULTIMATE.start_main_~#t~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 34#L733-4true, 76#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, 123#(= (bvadd (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) (_ bv1 1)) (_ bv0 1)), 176#(= ~COND~0 (_ bv0 8)), 89#L724true]) [2023-08-29 20:08:43,197 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-29 20:08:43,197 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 20:08:43,197 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 20:08:43,197 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 20:08:43,197 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([724] L719-1-->L721: Formula: (= v_~count~0_156 (_ bv3 32)) InVars {~count~0=v_~count~0_156} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_156} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, Black: 130#(= ~count~0 (_ bv0 32)), Black: 147#(= ~count~0 (_ bv1 32)), thr1Thread3of3ForFork0InUse, Black: 161#(and (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32)) (= ~count~0 (_ bv0 32))), Black: 143#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32)), Black: 163#(and (= ~count~0 (_ bv1 32)) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| (_ bv0 32))), 105#true, 125#true, 94#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, 116#(and (= |ULTIMATE.start_main_~#t~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 34#L733-4true, 85#L721true, 76#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, 123#(= (bvadd (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) (_ bv1 1)) (_ bv0 1)), 176#(= ~COND~0 (_ bv0 8))]) [2023-08-29 20:08:43,197 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-29 20:08:43,197 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 20:08:43,197 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 20:08:43,197 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 20:08:43,240 INFO L130 PetriNetUnfolder]: 13844/21481 cut-off events. [2023-08-29 20:08:43,240 INFO L131 PetriNetUnfolder]: For 13393/14912 co-relation queries the response was YES. [2023-08-29 20:08:43,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50647 conditions, 21481 events. 13844/21481 cut-off events. For 13393/14912 co-relation queries the response was YES. Maximal size of possible extension queue 1401. Compared 168119 event pairs, 5116 based on Foata normal form. 1145/21859 useless extension candidates. Maximal degree in co-relation 50635. Up to 9908 conditions per place. [2023-08-29 20:08:43,360 INFO L137 encePairwiseOnDemand]: 159/169 looper letters, 75 selfloop transitions, 7 changer transitions 0/115 dead transitions. [2023-08-29 20:08:43,360 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 115 transitions, 626 flow [2023-08-29 20:08:43,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:08:43,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:08:43,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 263 transitions. [2023-08-29 20:08:43,361 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5187376725838264 [2023-08-29 20:08:43,361 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 263 transitions. [2023-08-29 20:08:43,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 263 transitions. [2023-08-29 20:08:43,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:08:43,362 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 263 transitions. [2023-08-29 20:08:43,362 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:43,363 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:43,363 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:43,363 INFO L175 Difference]: Start difference. First operand has 66 places, 77 transitions, 325 flow. Second operand 3 states and 263 transitions. [2023-08-29 20:08:43,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 115 transitions, 626 flow [2023-08-29 20:08:43,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 115 transitions, 626 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:08:43,380 INFO L231 Difference]: Finished difference. Result has 70 places, 83 transitions, 383 flow [2023-08-29 20:08:43,380 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=383, PETRI_PLACES=70, PETRI_TRANSITIONS=83} [2023-08-29 20:08:43,380 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 12 predicate places. [2023-08-29 20:08:43,381 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 83 transitions, 383 flow [2023-08-29 20:08:43,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:43,381 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:08:43,381 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:08:43,388 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 (21)] Forceful destruction successful, exit code 0 [2023-08-29 20:08:43,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /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:08:43,588 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2023-08-29 20:08:43,588 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:08:43,588 INFO L85 PathProgramCache]: Analyzing trace with hash 299087254, now seen corresponding path program 1 times [2023-08-29 20:08:43,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:08:43,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1263083318] [2023-08-29 20:08:43,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:08:43,589 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:08:43,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:08:43,590 INFO L229 MonitoredProcess]: Starting monitored process 22 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:08:43,592 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 (22)] Waiting until timeout for monitored process [2023-08-29 20:08:43,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:08:43,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-29 20:08:43,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:08:43,657 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 20:08:43,657 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:08:43,658 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:08:43,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1263083318] [2023-08-29 20:08:43,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1263083318] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:08:43,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:08:43,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:08:43,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578938683] [2023-08-29 20:08:43,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:08:43,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:08:43,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:08:43,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:08:43,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:08:43,682 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 169 [2023-08-29 20:08:43,683 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 83 transitions, 383 flow. Second operand has 5 states, 5 states have (on average 62.2) internal successors, (311), 5 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:43,683 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:08:43,683 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 169 [2023-08-29 20:08:43,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:08:45,443 INFO L130 PetriNetUnfolder]: 15446/24710 cut-off events. [2023-08-29 20:08:45,444 INFO L131 PetriNetUnfolder]: For 18567/18895 co-relation queries the response was YES. [2023-08-29 20:08:45,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63775 conditions, 24710 events. 15446/24710 cut-off events. For 18567/18895 co-relation queries the response was YES. Maximal size of possible extension queue 1551. Compared 203446 event pairs, 3772 based on Foata normal form. 584/24842 useless extension candidates. Maximal degree in co-relation 63761. Up to 10224 conditions per place. [2023-08-29 20:08:45,550 INFO L137 encePairwiseOnDemand]: 158/169 looper letters, 136 selfloop transitions, 39 changer transitions 0/194 dead transitions. [2023-08-29 20:08:45,550 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 194 transitions, 1138 flow [2023-08-29 20:08:45,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:08:45,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:08:45,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 497 transitions. [2023-08-29 20:08:45,552 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.490138067061144 [2023-08-29 20:08:45,552 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 497 transitions. [2023-08-29 20:08:45,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 497 transitions. [2023-08-29 20:08:45,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:08:45,552 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 497 transitions. [2023-08-29 20:08:45,553 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 82.83333333333333) internal successors, (497), 6 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:45,554 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 169.0) internal successors, (1183), 7 states have internal predecessors, (1183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:45,554 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 169.0) internal successors, (1183), 7 states have internal predecessors, (1183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:45,554 INFO L175 Difference]: Start difference. First operand has 70 places, 83 transitions, 383 flow. Second operand 6 states and 497 transitions. [2023-08-29 20:08:45,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 194 transitions, 1138 flow [2023-08-29 20:08:45,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 194 transitions, 1124 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:08:45,589 INFO L231 Difference]: Finished difference. Result has 76 places, 106 transitions, 643 flow [2023-08-29 20:08:45,590 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=369, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=643, PETRI_PLACES=76, PETRI_TRANSITIONS=106} [2023-08-29 20:08:45,590 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 18 predicate places. [2023-08-29 20:08:45,590 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 106 transitions, 643 flow [2023-08-29 20:08:45,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 62.2) internal successors, (311), 5 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:45,590 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:08:45,591 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:08:45,598 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 (22)] Forceful destruction successful, exit code 0 [2023-08-29 20:08:45,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /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:08:45,797 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2023-08-29 20:08:45,797 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:08:45,797 INFO L85 PathProgramCache]: Analyzing trace with hash -748862898, now seen corresponding path program 1 times [2023-08-29 20:08:45,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:08:45,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [825192226] [2023-08-29 20:08:45,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:08:45,798 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:08:45,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:08:45,799 INFO L229 MonitoredProcess]: Starting monitored process 23 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:08:45,800 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 (23)] Waiting until timeout for monitored process [2023-08-29 20:08:45,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:08:45,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-29 20:08:45,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:08:45,850 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-29 20:08:45,850 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:08:45,851 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:08:45,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [825192226] [2023-08-29 20:08:45,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [825192226] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:08:45,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:08:45,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:08:45,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408615112] [2023-08-29 20:08:45,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:08:45,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:08:45,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:08:45,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:08:45,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:08:45,852 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 169 [2023-08-29 20:08:45,852 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 106 transitions, 643 flow. Second operand has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:45,852 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:08:45,852 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 169 [2023-08-29 20:08:45,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:08:46,104 INFO L130 PetriNetUnfolder]: 2057/4181 cut-off events. [2023-08-29 20:08:46,104 INFO L131 PetriNetUnfolder]: For 2157/2165 co-relation queries the response was YES. [2023-08-29 20:08:46,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9776 conditions, 4181 events. 2057/4181 cut-off events. For 2157/2165 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 33388 event pairs, 831 based on Foata normal form. 354/4474 useless extension candidates. Maximal degree in co-relation 9759. Up to 1784 conditions per place. [2023-08-29 20:08:46,122 INFO L137 encePairwiseOnDemand]: 157/169 looper letters, 28 selfloop transitions, 12 changer transitions 0/72 dead transitions. [2023-08-29 20:08:46,122 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 72 transitions, 417 flow [2023-08-29 20:08:46,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:08:46,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:08:46,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 259 transitions. [2023-08-29 20:08:46,123 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5108481262327417 [2023-08-29 20:08:46,123 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 259 transitions. [2023-08-29 20:08:46,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 259 transitions. [2023-08-29 20:08:46,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:08:46,123 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 259 transitions. [2023-08-29 20:08:46,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:46,124 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:46,124 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:46,124 INFO L175 Difference]: Start difference. First operand has 76 places, 106 transitions, 643 flow. Second operand 3 states and 259 transitions. [2023-08-29 20:08:46,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 72 transitions, 417 flow [2023-08-29 20:08:46,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 72 transitions, 362 flow, removed 17 selfloop flow, removed 6 redundant places. [2023-08-29 20:08:46,129 INFO L231 Difference]: Finished difference. Result has 70 places, 63 transitions, 272 flow [2023-08-29 20:08:46,129 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=272, PETRI_PLACES=70, PETRI_TRANSITIONS=63} [2023-08-29 20:08:46,129 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 12 predicate places. [2023-08-29 20:08:46,129 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 63 transitions, 272 flow [2023-08-29 20:08:46,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:46,129 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:08:46,129 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:08:46,137 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 (23)] Forceful destruction successful, exit code 0 [2023-08-29 20:08:46,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /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:08:46,336 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2023-08-29 20:08:46,336 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:08:46,336 INFO L85 PathProgramCache]: Analyzing trace with hash -136755512, now seen corresponding path program 1 times [2023-08-29 20:08:46,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:08:46,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [610294949] [2023-08-29 20:08:46,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:08:46,336 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:08:46,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:08:46,337 INFO L229 MonitoredProcess]: Starting monitored process 24 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:08:46,339 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 (24)] Waiting until timeout for monitored process [2023-08-29 20:08:46,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:08:46,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-29 20:08:46,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:08:46,403 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-29 20:08:46,403 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:08:46,403 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:08:46,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [610294949] [2023-08-29 20:08:46,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [610294949] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:08:46,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:08:46,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:08:46,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079352943] [2023-08-29 20:08:46,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:08:46,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:08:46,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:08:46,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:08:46,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:08:46,432 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 169 [2023-08-29 20:08:46,432 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 63 transitions, 272 flow. Second operand has 5 states, 5 states have (on average 62.4) internal successors, (312), 5 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:46,432 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:08:46,433 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 169 [2023-08-29 20:08:46,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:08:46,834 INFO L130 PetriNetUnfolder]: 1757/3356 cut-off events. [2023-08-29 20:08:46,834 INFO L131 PetriNetUnfolder]: For 1376/1404 co-relation queries the response was YES. [2023-08-29 20:08:46,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8507 conditions, 3356 events. 1757/3356 cut-off events. For 1376/1404 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 24542 event pairs, 599 based on Foata normal form. 4/3339 useless extension candidates. Maximal degree in co-relation 8494. Up to 1281 conditions per place. [2023-08-29 20:08:46,849 INFO L137 encePairwiseOnDemand]: 159/169 looper letters, 80 selfloop transitions, 11 changer transitions 0/108 dead transitions. [2023-08-29 20:08:46,849 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 108 transitions, 610 flow [2023-08-29 20:08:46,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:08:46,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:08:46,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 447 transitions. [2023-08-29 20:08:46,850 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4408284023668639 [2023-08-29 20:08:46,850 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 447 transitions. [2023-08-29 20:08:46,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 447 transitions. [2023-08-29 20:08:46,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:08:46,851 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 447 transitions. [2023-08-29 20:08:46,851 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 74.5) internal successors, (447), 6 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:46,852 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 169.0) internal successors, (1183), 7 states have internal predecessors, (1183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:46,852 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 169.0) internal successors, (1183), 7 states have internal predecessors, (1183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:46,852 INFO L175 Difference]: Start difference. First operand has 70 places, 63 transitions, 272 flow. Second operand 6 states and 447 transitions. [2023-08-29 20:08:46,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 108 transitions, 610 flow [2023-08-29 20:08:46,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 108 transitions, 580 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:08:46,856 INFO L231 Difference]: Finished difference. Result has 77 places, 64 transitions, 306 flow [2023-08-29 20:08:46,856 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=306, PETRI_PLACES=77, PETRI_TRANSITIONS=64} [2023-08-29 20:08:46,856 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 19 predicate places. [2023-08-29 20:08:46,857 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 64 transitions, 306 flow [2023-08-29 20:08:46,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 62.4) internal successors, (312), 5 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:46,857 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:08:46,857 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:08:46,863 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 (24)] Forceful destruction successful, exit code 0 [2023-08-29 20:08:47,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /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:08:47,063 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2023-08-29 20:08:47,063 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:08:47,063 INFO L85 PathProgramCache]: Analyzing trace with hash -331170484, now seen corresponding path program 1 times [2023-08-29 20:08:47,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:08:47,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [58041358] [2023-08-29 20:08:47,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:08:47,064 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:08:47,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:08:47,065 INFO L229 MonitoredProcess]: Starting monitored process 25 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:08:47,065 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 (25)] Waiting until timeout for monitored process [2023-08-29 20:08:47,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:08:47,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:08:47,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:08:47,152 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-29 20:08:47,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 20:08:47,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-29 20:08:47,199 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:08:47,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [58041358] [2023-08-29 20:08:47,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [58041358] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 20:08:47,199 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-29 20:08:47,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-08-29 20:08:47,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705843742] [2023-08-29 20:08:47,200 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-29 20:08:47,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-29 20:08:47,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:08:47,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-29 20:08:47,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-08-29 20:08:47,233 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 169 [2023-08-29 20:08:47,233 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 64 transitions, 306 flow. Second operand has 12 states, 12 states have (on average 56.416666666666664) internal successors, (677), 12 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:47,234 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:08:47,234 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 169 [2023-08-29 20:08:47,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:08:47,702 INFO L130 PetriNetUnfolder]: 1663/3110 cut-off events. [2023-08-29 20:08:47,702 INFO L131 PetriNetUnfolder]: For 1666/1678 co-relation queries the response was YES. [2023-08-29 20:08:47,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7860 conditions, 3110 events. 1663/3110 cut-off events. For 1666/1678 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 22294 event pairs, 503 based on Foata normal form. 8/3099 useless extension candidates. Maximal degree in co-relation 7843. Up to 1045 conditions per place. [2023-08-29 20:08:47,717 INFO L137 encePairwiseOnDemand]: 154/169 looper letters, 97 selfloop transitions, 28 changer transitions 0/139 dead transitions. [2023-08-29 20:08:47,717 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 139 transitions, 824 flow [2023-08-29 20:08:47,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-29 20:08:47,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-29 20:08:47,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 715 transitions. [2023-08-29 20:08:47,719 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38461538461538464 [2023-08-29 20:08:47,719 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 715 transitions. [2023-08-29 20:08:47,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 715 transitions. [2023-08-29 20:08:47,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:08:47,719 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 715 transitions. [2023-08-29 20:08:47,720 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 65.0) internal successors, (715), 11 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:47,722 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 169.0) internal successors, (2028), 12 states have internal predecessors, (2028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:47,722 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 169.0) internal successors, (2028), 12 states have internal predecessors, (2028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:47,722 INFO L175 Difference]: Start difference. First operand has 77 places, 64 transitions, 306 flow. Second operand 11 states and 715 transitions. [2023-08-29 20:08:47,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 139 transitions, 824 flow [2023-08-29 20:08:47,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 139 transitions, 810 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-08-29 20:08:47,726 INFO L231 Difference]: Finished difference. Result has 88 places, 67 transitions, 385 flow [2023-08-29 20:08:47,726 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=385, PETRI_PLACES=88, PETRI_TRANSITIONS=67} [2023-08-29 20:08:47,727 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 30 predicate places. [2023-08-29 20:08:47,727 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 67 transitions, 385 flow [2023-08-29 20:08:47,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 56.416666666666664) internal successors, (677), 12 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:47,727 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:08:47,727 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:08:47,733 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 (25)] Forceful destruction successful, exit code 0 [2023-08-29 20:08:47,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /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:08:47,934 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2023-08-29 20:08:47,934 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:08:47,934 INFO L85 PathProgramCache]: Analyzing trace with hash -910734588, now seen corresponding path program 1 times [2023-08-29 20:08:47,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:08:47,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1823392322] [2023-08-29 20:08:47,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:08:47,934 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:08:47,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:08:47,935 INFO L229 MonitoredProcess]: Starting monitored process 26 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:08:47,936 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 (26)] Waiting until timeout for monitored process [2023-08-29 20:08:47,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:08:47,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:08:47,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:08:48,013 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 20:08:48,013 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:08:48,013 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:08:48,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1823392322] [2023-08-29 20:08:48,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1823392322] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:08:48,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:08:48,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:08:48,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642084632] [2023-08-29 20:08:48,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:08:48,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:08:48,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:08:48,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:08:48,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:08:48,066 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 169 [2023-08-29 20:08:48,066 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 67 transitions, 385 flow. Second operand has 7 states, 7 states have (on average 59.142857142857146) internal successors, (414), 7 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:48,066 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:08:48,067 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 169 [2023-08-29 20:08:48,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:08:48,421 INFO L130 PetriNetUnfolder]: 1329/2543 cut-off events. [2023-08-29 20:08:48,421 INFO L131 PetriNetUnfolder]: For 1710/1726 co-relation queries the response was YES. [2023-08-29 20:08:48,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6651 conditions, 2543 events. 1329/2543 cut-off events. For 1710/1726 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 17626 event pairs, 476 based on Foata normal form. 10/2538 useless extension candidates. Maximal degree in co-relation 6633. Up to 968 conditions per place. [2023-08-29 20:08:48,433 INFO L137 encePairwiseOnDemand]: 158/169 looper letters, 89 selfloop transitions, 13 changer transitions 0/118 dead transitions. [2023-08-29 20:08:48,433 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 118 transitions, 769 flow [2023-08-29 20:08:48,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:08:48,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:08:48,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 552 transitions. [2023-08-29 20:08:48,435 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40828402366863903 [2023-08-29 20:08:48,435 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 552 transitions. [2023-08-29 20:08:48,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 552 transitions. [2023-08-29 20:08:48,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:08:48,435 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 552 transitions. [2023-08-29 20:08:48,436 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 69.0) internal successors, (552), 8 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:48,437 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 169.0) internal successors, (1521), 9 states have internal predecessors, (1521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:48,437 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 169.0) internal successors, (1521), 9 states have internal predecessors, (1521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:48,437 INFO L175 Difference]: Start difference. First operand has 88 places, 67 transitions, 385 flow. Second operand 8 states and 552 transitions. [2023-08-29 20:08:48,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 118 transitions, 769 flow [2023-08-29 20:08:48,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 118 transitions, 710 flow, removed 10 selfloop flow, removed 9 redundant places. [2023-08-29 20:08:48,442 INFO L231 Difference]: Finished difference. Result has 88 places, 69 transitions, 374 flow [2023-08-29 20:08:48,442 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=374, PETRI_PLACES=88, PETRI_TRANSITIONS=69} [2023-08-29 20:08:48,442 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 30 predicate places. [2023-08-29 20:08:48,442 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 69 transitions, 374 flow [2023-08-29 20:08:48,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 59.142857142857146) internal successors, (414), 7 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:48,443 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:08:48,443 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:08:48,451 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 (26)] Forceful destruction successful, exit code 0 [2023-08-29 20:08:48,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /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:08:48,649 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2023-08-29 20:08:48,650 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:08:48,650 INFO L85 PathProgramCache]: Analyzing trace with hash -811105412, now seen corresponding path program 1 times [2023-08-29 20:08:48,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:08:48,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [95254452] [2023-08-29 20:08:48,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:08:48,650 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:08:48,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:08:48,651 INFO L229 MonitoredProcess]: Starting monitored process 27 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:08:48,653 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 (27)] Waiting until timeout for monitored process [2023-08-29 20:08:48,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:08:48,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:08:48,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:08:48,739 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 20:08:48,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 20:08:48,788 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 20:08:48,788 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:08:48,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [95254452] [2023-08-29 20:08:48,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [95254452] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 20:08:48,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-29 20:08:48,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-08-29 20:08:48,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754732265] [2023-08-29 20:08:48,789 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-29 20:08:48,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-29 20:08:48,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:08:48,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-29 20:08:48,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-08-29 20:08:48,829 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 169 [2023-08-29 20:08:48,830 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 69 transitions, 374 flow. Second operand has 12 states, 12 states have (on average 56.75) internal successors, (681), 12 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:48,830 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:08:48,830 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 169 [2023-08-29 20:08:48,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:08:49,225 INFO L130 PetriNetUnfolder]: 1166/2227 cut-off events. [2023-08-29 20:08:49,225 INFO L131 PetriNetUnfolder]: For 1142/1158 co-relation queries the response was YES. [2023-08-29 20:08:49,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5717 conditions, 2227 events. 1166/2227 cut-off events. For 1142/1158 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 15014 event pairs, 389 based on Foata normal form. 6/2212 useless extension candidates. Maximal degree in co-relation 5698. Up to 833 conditions per place. [2023-08-29 20:08:49,234 INFO L137 encePairwiseOnDemand]: 154/169 looper letters, 87 selfloop transitions, 32 changer transitions 0/134 dead transitions. [2023-08-29 20:08:49,234 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 134 transitions, 838 flow [2023-08-29 20:08:49,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-29 20:08:49,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-29 20:08:49,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 814 transitions. [2023-08-29 20:08:49,235 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3705052344105599 [2023-08-29 20:08:49,235 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 814 transitions. [2023-08-29 20:08:49,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 814 transitions. [2023-08-29 20:08:49,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:08:49,236 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 814 transitions. [2023-08-29 20:08:49,237 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 62.61538461538461) internal successors, (814), 13 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:49,238 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 169.0) internal successors, (2366), 14 states have internal predecessors, (2366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:49,239 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 169.0) internal successors, (2366), 14 states have internal predecessors, (2366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:49,239 INFO L175 Difference]: Start difference. First operand has 88 places, 69 transitions, 374 flow. Second operand 13 states and 814 transitions. [2023-08-29 20:08:49,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 134 transitions, 838 flow [2023-08-29 20:08:49,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 134 transitions, 814 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-29 20:08:49,243 INFO L231 Difference]: Finished difference. Result has 97 places, 72 transitions, 437 flow [2023-08-29 20:08:49,243 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=437, PETRI_PLACES=97, PETRI_TRANSITIONS=72} [2023-08-29 20:08:49,243 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 39 predicate places. [2023-08-29 20:08:49,243 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 72 transitions, 437 flow [2023-08-29 20:08:49,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 56.75) internal successors, (681), 12 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:49,243 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:08:49,243 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:08:49,250 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 (27)] Ended with exit code 0 [2023-08-29 20:08:49,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /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:08:49,444 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2023-08-29 20:08:49,444 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:08:49,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1623765680, now seen corresponding path program 1 times [2023-08-29 20:08:49,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:08:49,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1449779912] [2023-08-29 20:08:49,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:08:49,444 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:08:49,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:08:49,445 INFO L229 MonitoredProcess]: Starting monitored process 28 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:08:49,446 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 (28)] Waiting until timeout for monitored process [2023-08-29 20:08:49,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:08:49,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:08:49,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:08:49,525 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-29 20:08:49,525 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 20:08:49,570 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-29 20:08:49,570 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:08:49,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1449779912] [2023-08-29 20:08:49,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1449779912] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 20:08:49,570 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-29 20:08:49,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-08-29 20:08:49,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464759949] [2023-08-29 20:08:49,570 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-29 20:08:49,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-29 20:08:49,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:08:49,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-29 20:08:49,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-08-29 20:08:49,615 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 169 [2023-08-29 20:08:49,616 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 72 transitions, 437 flow. Second operand has 12 states, 12 states have (on average 56.583333333333336) internal successors, (679), 12 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:49,616 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:08:49,616 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 169 [2023-08-29 20:08:49,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:08:49,923 INFO L130 PetriNetUnfolder]: 997/1922 cut-off events. [2023-08-29 20:08:49,923 INFO L131 PetriNetUnfolder]: For 1107/1123 co-relation queries the response was YES. [2023-08-29 20:08:49,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5065 conditions, 1922 events. 997/1922 cut-off events. For 1107/1123 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 12695 event pairs, 367 based on Foata normal form. 6/1909 useless extension candidates. Maximal degree in co-relation 5045. Up to 777 conditions per place. [2023-08-29 20:08:49,930 INFO L137 encePairwiseOnDemand]: 154/169 looper letters, 78 selfloop transitions, 33 changer transitions 1/127 dead transitions. [2023-08-29 20:08:49,930 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 127 transitions, 859 flow [2023-08-29 20:08:49,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-29 20:08:49,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-29 20:08:49,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 749 transitions. [2023-08-29 20:08:49,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3693293885601578 [2023-08-29 20:08:49,932 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 749 transitions. [2023-08-29 20:08:49,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 749 transitions. [2023-08-29 20:08:49,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:08:49,932 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 749 transitions. [2023-08-29 20:08:49,933 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 62.416666666666664) internal successors, (749), 12 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:49,935 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 169.0) internal successors, (2197), 13 states have internal predecessors, (2197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:49,935 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 169.0) internal successors, (2197), 13 states have internal predecessors, (2197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:49,935 INFO L175 Difference]: Start difference. First operand has 97 places, 72 transitions, 437 flow. Second operand 12 states and 749 transitions. [2023-08-29 20:08:49,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 127 transitions, 859 flow [2023-08-29 20:08:49,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 127 transitions, 824 flow, removed 6 selfloop flow, removed 7 redundant places. [2023-08-29 20:08:49,940 INFO L231 Difference]: Finished difference. Result has 103 places, 75 transitions, 522 flow [2023-08-29 20:08:49,940 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=522, PETRI_PLACES=103, PETRI_TRANSITIONS=75} [2023-08-29 20:08:49,940 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 45 predicate places. [2023-08-29 20:08:49,940 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 75 transitions, 522 flow [2023-08-29 20:08:49,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 56.583333333333336) internal successors, (679), 12 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:49,941 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:08:49,941 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:08:49,947 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 (28)] Forceful destruction successful, exit code 0 [2023-08-29 20:08:50,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /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:08:50,147 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2023-08-29 20:08:50,147 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:08:50,147 INFO L85 PathProgramCache]: Analyzing trace with hash -2017596931, now seen corresponding path program 1 times [2023-08-29 20:08:50,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:08:50,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [758535890] [2023-08-29 20:08:50,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:08:50,148 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:08:50,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:08:50,149 INFO L229 MonitoredProcess]: Starting monitored process 29 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:08:50,149 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 (29)] Waiting until timeout for monitored process [2023-08-29 20:08:50,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:08:50,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:08:50,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:08:50,229 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-29 20:08:50,229 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:08:50,229 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:08:50,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [758535890] [2023-08-29 20:08:50,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [758535890] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:08:50,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:08:50,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:08:50,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630783619] [2023-08-29 20:08:50,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:08:50,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:08:50,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:08:50,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:08:50,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:08:50,281 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 169 [2023-08-29 20:08:50,281 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 75 transitions, 522 flow. Second operand has 7 states, 7 states have (on average 59.42857142857143) internal successors, (416), 7 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:50,281 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:08:50,281 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 169 [2023-08-29 20:08:50,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:08:50,479 INFO L130 PetriNetUnfolder]: 712/1430 cut-off events. [2023-08-29 20:08:50,479 INFO L131 PetriNetUnfolder]: For 1343/1351 co-relation queries the response was YES. [2023-08-29 20:08:50,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3947 conditions, 1430 events. 712/1430 cut-off events. For 1343/1351 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 8917 event pairs, 340 based on Foata normal form. 6/1421 useless extension candidates. Maximal degree in co-relation 3926. Up to 736 conditions per place. [2023-08-29 20:08:50,483 INFO L137 encePairwiseOnDemand]: 158/169 looper letters, 71 selfloop transitions, 13 changer transitions 0/102 dead transitions. [2023-08-29 20:08:50,484 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 102 transitions, 776 flow [2023-08-29 20:08:50,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:08:50,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:08:50,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 529 transitions. [2023-08-29 20:08:50,484 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39127218934911245 [2023-08-29 20:08:50,485 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 529 transitions. [2023-08-29 20:08:50,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 529 transitions. [2023-08-29 20:08:50,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:08:50,485 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 529 transitions. [2023-08-29 20:08:50,486 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 66.125) internal successors, (529), 8 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:50,487 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 169.0) internal successors, (1521), 9 states have internal predecessors, (1521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:50,487 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 169.0) internal successors, (1521), 9 states have internal predecessors, (1521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:50,487 INFO L175 Difference]: Start difference. First operand has 103 places, 75 transitions, 522 flow. Second operand 8 states and 529 transitions. [2023-08-29 20:08:50,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 102 transitions, 776 flow [2023-08-29 20:08:50,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 102 transitions, 751 flow, removed 5 selfloop flow, removed 5 redundant places. [2023-08-29 20:08:50,491 INFO L231 Difference]: Finished difference. Result has 107 places, 76 transitions, 538 flow [2023-08-29 20:08:50,491 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=497, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=538, PETRI_PLACES=107, PETRI_TRANSITIONS=76} [2023-08-29 20:08:50,491 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 49 predicate places. [2023-08-29 20:08:50,491 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 76 transitions, 538 flow [2023-08-29 20:08:50,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 59.42857142857143) internal successors, (416), 7 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:50,492 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:08:50,492 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:08:50,500 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 (29)] Forceful destruction successful, exit code 0 [2023-08-29 20:08:50,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /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:08:50,698 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2023-08-29 20:08:50,699 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:08:50,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1478369945, now seen corresponding path program 1 times [2023-08-29 20:08:50,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:08:50,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1401542614] [2023-08-29 20:08:50,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:08:50,699 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:08:50,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:08:50,700 INFO L229 MonitoredProcess]: Starting monitored process 30 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:08:50,700 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 (30)] Waiting until timeout for monitored process [2023-08-29 20:08:50,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:08:50,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:08:50,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:08:50,782 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-29 20:08:50,782 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:08:50,782 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:08:50,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1401542614] [2023-08-29 20:08:50,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1401542614] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:08:50,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:08:50,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:08:50,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069151461] [2023-08-29 20:08:50,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:08:50,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:08:50,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:08:50,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:08:50,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:08:50,822 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 169 [2023-08-29 20:08:50,822 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 76 transitions, 538 flow. Second operand has 7 states, 7 states have (on average 59.42857142857143) internal successors, (416), 7 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:50,822 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:08:50,822 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 169 [2023-08-29 20:08:50,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:08:51,005 INFO L130 PetriNetUnfolder]: 472/970 cut-off events. [2023-08-29 20:08:51,005 INFO L131 PetriNetUnfolder]: For 1004/1016 co-relation queries the response was YES. [2023-08-29 20:08:51,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2781 conditions, 970 events. 472/970 cut-off events. For 1004/1016 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5417 event pairs, 248 based on Foata normal form. 6/965 useless extension candidates. Maximal degree in co-relation 2758. Up to 620 conditions per place. [2023-08-29 20:08:51,008 INFO L137 encePairwiseOnDemand]: 157/169 looper letters, 64 selfloop transitions, 14 changer transitions 1/98 dead transitions. [2023-08-29 20:08:51,009 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 98 transitions, 778 flow [2023-08-29 20:08:51,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-29 20:08:51,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-29 20:08:51,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 581 transitions. [2023-08-29 20:08:51,010 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3819855358316897 [2023-08-29 20:08:51,010 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 581 transitions. [2023-08-29 20:08:51,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 581 transitions. [2023-08-29 20:08:51,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:08:51,010 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 581 transitions. [2023-08-29 20:08:51,011 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 64.55555555555556) internal successors, (581), 9 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:51,012 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 169.0) internal successors, (1690), 10 states have internal predecessors, (1690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:51,012 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 169.0) internal successors, (1690), 10 states have internal predecessors, (1690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:51,012 INFO L175 Difference]: Start difference. First operand has 107 places, 76 transitions, 538 flow. Second operand 9 states and 581 transitions. [2023-08-29 20:08:51,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 98 transitions, 778 flow [2023-08-29 20:08:51,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 98 transitions, 750 flow, removed 3 selfloop flow, removed 5 redundant places. [2023-08-29 20:08:51,016 INFO L231 Difference]: Finished difference. Result has 112 places, 77 transitions, 553 flow [2023-08-29 20:08:51,016 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=553, PETRI_PLACES=112, PETRI_TRANSITIONS=77} [2023-08-29 20:08:51,017 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 54 predicate places. [2023-08-29 20:08:51,017 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 77 transitions, 553 flow [2023-08-29 20:08:51,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 59.42857142857143) internal successors, (416), 7 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:08:51,017 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:08:51,017 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:08:51,024 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 (30)] Ended with exit code 0 [2023-08-29 20:08:51,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /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:08:51,223 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2023-08-29 20:08:51,224 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:08:51,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1831672362, now seen corresponding path program 1 times [2023-08-29 20:08:51,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:08:51,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1348191908] [2023-08-29 20:08:51,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:08:51,224 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:08:51,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:08:51,225 INFO L229 MonitoredProcess]: Starting monitored process 31 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:08:51,225 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 (31)] Waiting until timeout for monitored process [2023-08-29 20:08:51,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:08:51,275 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:08:51,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:08:51,309 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-29 20:08:51,310 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:08:51,310 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2023-08-29 20:08:51,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 7 remaining) [2023-08-29 20:08:51,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2023-08-29 20:08:51,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 7 remaining) [2023-08-29 20:08:51,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 7 remaining) [2023-08-29 20:08:51,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2023-08-29 20:08:51,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 7 remaining) [2023-08-29 20:08:51,317 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 (31)] Ended with exit code 0 [2023-08-29 20:08:51,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /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:08:51,511 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:08:51,512 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2023-08-29 20:08:51,512 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 3 thread instances [2023-08-29 20:08:51,512 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:08:51,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:08:51 BasicIcfg [2023-08-29 20:08:51,541 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:08:51,541 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:08:51,541 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:08:51,541 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:08:51,542 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:08:24" (3/4) ... [2023-08-29 20:08:51,543 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:08:51,543 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:08:51,543 INFO L158 Benchmark]: Toolchain (without parser) took 27857.12ms. Allocated memory was 75.5MB in the beginning and 3.8GB in the end (delta: 3.7GB). Free memory was 52.0MB in the beginning and 2.8GB in the end (delta: -2.7GB). Peak memory consumption was 946.4MB. Max. memory is 16.1GB. [2023-08-29 20:08:51,544 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 60.8MB. Free memory was 38.8MB in the beginning and 38.7MB in the end (delta: 97.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:08:51,544 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.43ms. Allocated memory is still 75.5MB. Free memory was 52.0MB in the beginning and 49.2MB in the end (delta: 2.8MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. [2023-08-29 20:08:51,544 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.11ms. Allocated memory is still 75.5MB. Free memory was 49.2MB in the beginning and 47.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:08:51,544 INFO L158 Benchmark]: Boogie Preprocessor took 15.98ms. Allocated memory is still 75.5MB. Free memory was 47.2MB in the beginning and 45.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:08:51,544 INFO L158 Benchmark]: RCFGBuilder took 355.79ms. Allocated memory is still 75.5MB. Free memory was 45.5MB in the beginning and 53.4MB in the end (delta: -8.0MB). Peak memory consumption was 21.3MB. Max. memory is 16.1GB. [2023-08-29 20:08:51,545 INFO L158 Benchmark]: TraceAbstraction took 27186.27ms. Allocated memory was 75.5MB in the beginning and 3.8GB in the end (delta: 3.7GB). Free memory was 53.0MB in the beginning and 2.8GB in the end (delta: -2.7GB). Peak memory consumption was 947.3MB. Max. memory is 16.1GB. [2023-08-29 20:08:51,545 INFO L158 Benchmark]: Witness Printer took 1.85ms. Allocated memory is still 3.8GB. Free memory is still 2.8GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:08:51,546 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 60.8MB. Free memory was 38.8MB in the beginning and 38.7MB in the end (delta: 97.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 268.43ms. Allocated memory is still 75.5MB. Free memory was 52.0MB in the beginning and 49.2MB in the end (delta: 2.8MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.11ms. Allocated memory is still 75.5MB. Free memory was 49.2MB in the beginning and 47.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 15.98ms. Allocated memory is still 75.5MB. Free memory was 47.2MB in the beginning and 45.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 355.79ms. Allocated memory is still 75.5MB. Free memory was 45.5MB in the beginning and 53.4MB in the end (delta: -8.0MB). Peak memory consumption was 21.3MB. Max. memory is 16.1GB. * TraceAbstraction took 27186.27ms. Allocated memory was 75.5MB in the beginning and 3.8GB in the end (delta: 3.7GB). Free memory was 53.0MB in the beginning and 2.8GB in the end (delta: -2.7GB). Peak memory consumption was 947.3MB. Max. memory is 16.1GB. * Witness Printer took 1.85ms. Allocated memory is still 3.8GB. Free memory is still 2.8GB. 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.5s, 56 PlacesBefore, 14 PlacesAfterwards, 56 TransitionsBefore, 11 TransitionsAfterwards, 792 CoEnabledTransitionPairs, 6 FixpointIterations, 14 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 3 ChoiceCompositions, 58 TotalNumberOfCompositions, 718 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 718, independent: 718, independent conditional: 0, independent unconditional: 718, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 431, independent: 431, independent conditional: 0, independent unconditional: 431, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 718, independent: 287, independent conditional: 0, independent unconditional: 287, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 431, unknown conditional: 0, unknown unconditional: 431] , Statistics on independence cache: Total cache size (in pairs): 2, Positive cache size: 2, Positive conditional cache size: 0, Positive unconditional cache size: 2, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.2s, 56 PlacesBefore, 14 PlacesAfterwards, 56 TransitionsBefore, 11 TransitionsAfterwards, 792 CoEnabledTransitionPairs, 6 FixpointIterations, 14 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 3 ChoiceCompositions, 58 TotalNumberOfCompositions, 718 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 718, independent: 718, independent conditional: 0, independent unconditional: 718, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 429, independent: 429, independent conditional: 0, independent unconditional: 429, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 718, independent: 289, independent conditional: 0, independent unconditional: 289, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 429, unknown conditional: 0, unknown unconditional: 429] , Statistics on independence cache: Total cache size (in pairs): 2, Positive cache size: 2, Positive conditional cache size: 0, Positive unconditional cache size: 2, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 79 PlacesBefore, 42 PlacesAfterwards, 79 TransitionsBefore, 39 TransitionsAfterwards, 2596 CoEnabledTransitionPairs, 5 FixpointIterations, 14 TrivialSequentialCompositions, 30 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 3 ChoiceCompositions, 55 TotalNumberOfCompositions, 9478 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3685, independent: 3417, independent conditional: 0, independent unconditional: 3417, dependent: 268, dependent conditional: 0, dependent unconditional: 268, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1231, independent: 1202, independent conditional: 0, independent unconditional: 1202, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3685, independent: 2215, independent conditional: 0, independent unconditional: 2215, dependent: 239, dependent conditional: 0, dependent unconditional: 239, unknown: 1231, unknown conditional: 0, unknown unconditional: 1231] , Statistics on independence cache: Total cache size (in pairs): 217, Positive cache size: 195, Positive conditional cache size: 0, Positive unconditional cache size: 195, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 79 PlacesBefore, 42 PlacesAfterwards, 79 TransitionsBefore, 39 TransitionsAfterwards, 2596 CoEnabledTransitionPairs, 5 FixpointIterations, 14 TrivialSequentialCompositions, 30 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 3 ChoiceCompositions, 55 TotalNumberOfCompositions, 9478 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4275, independent: 4007, independent conditional: 0, independent unconditional: 4007, dependent: 268, dependent conditional: 0, dependent unconditional: 268, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1262, independent: 1225, independent conditional: 0, independent unconditional: 1225, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4275, independent: 2782, independent conditional: 0, independent unconditional: 2782, dependent: 231, dependent conditional: 0, dependent unconditional: 231, unknown: 1262, unknown conditional: 0, unknown unconditional: 1262] , Statistics on independence cache: Total cache size (in pairs): 214, Positive cache size: 188, Positive conditional cache size: 0, Positive unconditional cache size: 188, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 102 PlacesBefore, 58 PlacesAfterwards, 102 TransitionsBefore, 54 TransitionsAfterwards, 5412 CoEnabledTransitionPairs, 4 FixpointIterations, 14 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 4 ChoiceCompositions, 67 TotalNumberOfCompositions, 20068 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4951, independent: 4608, independent conditional: 0, independent unconditional: 4608, dependent: 343, dependent conditional: 0, dependent unconditional: 343, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2139, independent: 2095, independent conditional: 0, independent unconditional: 2095, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4951, independent: 2513, independent conditional: 0, independent unconditional: 2513, dependent: 299, dependent conditional: 0, dependent unconditional: 299, unknown: 2139, unknown conditional: 0, unknown unconditional: 2139] , Statistics on independence cache: Total cache size (in pairs): 171, Positive cache size: 138, Positive conditional cache size: 0, Positive unconditional cache size: 138, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 728]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 728. Possible FailurePath: [L704] 0 volatile unsigned int count = 0; [L705] 0 _Bool MTX = 0; [L706] 0 _Bool COND = 0; [L732] 0 pthread_t t; VAL [COND=0, MTX=0, count=0, t={3:0}] [L733] COND TRUE 0 1 [L733] FCALL, FORK 0 pthread_create(&t, 0, thr1, 0) VAL [COND=0, MTX=0, count=0, pthread_create(&t, 0, thr1, 0)=-1, t={3:0}] [L733] COND TRUE 0 1 [L727] CALL 1 Barrier2() [L718] CALL 1 __VERIFIER_atomic_acquire() [L709] CALL 1 assume_abort_if_not(MTX==0) [L3] COND FALSE 1 !(!cond) [L709] RET 1 assume_abort_if_not(MTX==0) [L710] 1 MTX = 1 [L718] RET 1 __VERIFIER_atomic_acquire() [L719] 1 count++ VAL [COND=0, MTX=1, count++=0, count=0] [L733] FCALL, FORK 0 pthread_create(&t, 0, thr1, 0) VAL [COND=0, MTX=1, count=0, pthread_create(&t, 0, thr1, 0)=0, t={3:0}] [L733] COND TRUE 0 1 [L733] FCALL, FORK 0 pthread_create(&t, 0, thr1, 0) VAL [COND=0, MTX=1, count=0, pthread_create(&t, 0, thr1, 0)=1, t={3:0}] [L719] 1 count++ [L720] COND FALSE 1 !(count == 3) VAL [COND=0, MTX=1, count=1] [L724] CALL 1 __VERIFIER_atomic_release() [L714] CALL 1 assume_abort_if_not(MTX==1) [L3] COND FALSE 1 !(!cond) [L714] RET 1 assume_abort_if_not(MTX==1) [L715] 1 MTX = 0 [L724] RET 1 __VERIFIER_atomic_release() [L727] CALL 2 Barrier2() [L718] CALL 2 __VERIFIER_atomic_acquire() [L709] CALL 2 assume_abort_if_not(MTX==0) [L3] COND FALSE 2 !(!cond) [L709] RET 2 assume_abort_if_not(MTX==0) [L710] 2 MTX = 1 [L718] RET 2 __VERIFIER_atomic_acquire() [L719] 2 count++ VAL [COND=0, MTX=1, count=2] [L720] COND FALSE 2 !(count == 3) VAL [COND=0, MTX=1, count=2] [L724] CALL 2 __VERIFIER_atomic_release() [L714] CALL 2 assume_abort_if_not(MTX==1) [L3] COND FALSE 2 !(!cond) [L714] RET 2 assume_abort_if_not(MTX==1) [L715] 2 MTX = 0 [L724] RET 2 __VERIFIER_atomic_release() [L727] CALL 3 Barrier2() [L718] CALL 3 __VERIFIER_atomic_acquire() [L709] CALL 3 assume_abort_if_not(MTX==0) [L3] COND FALSE 3 !(!cond) [L709] RET 3 assume_abort_if_not(MTX==0) [L710] 3 MTX = 1 [L718] RET 3 __VERIFIER_atomic_acquire() [L719] 3 count++ [L720] COND TRUE 3 count == 3 VAL [COND=0, MTX=1, count=3] [L721] 3 COND = 1 VAL [COND=1, MTX=1, count=3] [L722] 3 count = 0 VAL [COND=1, MTX=1, count=0] [L725] CALL 3 __VERIFIER_atomic_release() [L714] CALL 3 assume_abort_if_not(MTX==1) [L3] COND FALSE 3 !(!cond) [L714] RET 3 assume_abort_if_not(MTX==1) [L715] 3 MTX = 0 [L725] RET 3 __VERIFIER_atomic_release() [L727] RET 3 Barrier2() [L728] 3 reach_error() VAL [COND=1, MTX=0, arg={0:0}, arg={0:0}, count=0] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 731]: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 75 locations, 6 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: 3.8s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 82 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 28 mSDsluCounter, 13 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 73 IncrementalHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 13 mSDtfsCounter, 73 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=0, InterpolantAutomatonStates: 11, 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.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 10 NumberOfCodeBlocks, 10 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 6 ConstructedInterpolants, 0 QuantifiedInterpolants, 38 SizeOfPredicates, 0 NumberOfNonLiveVariables, 116 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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 - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 96 locations, 7 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: 4.7s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 407 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 323 mSDsluCounter, 111 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 73 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 952 IncrementalHoareTripleChecker+Invalid, 1007 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 38 mSDtfsCounter, 952 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 128 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=292occurred in iteration=6, InterpolantAutomatonStates: 48, 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.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 103 NumberOfCodeBlocks, 103 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 113 ConstructedInterpolants, 0 QuantifiedInterpolants, 286 SizeOfPredicates, 12 NumberOfNonLiveVariables, 491 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 8/10 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 - StatisticsResult: Ultimate Automizer benchmark data with 3 thread instances CFG has 5 procedures, 117 locations, 8 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: 14.7s, OverallIterations: 15, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1329 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1172 mSDsluCounter, 479 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 385 mSDsCounter, 183 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3900 IncrementalHoareTripleChecker+Invalid, 4083 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 183 mSolverCounterUnsat, 94 mSDtfsCounter, 3900 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 302 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=643occurred in iteration=6, InterpolantAutomatonStates: 94, 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, 247 NumberOfCodeBlocks, 247 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 269 ConstructedInterpolants, 0 QuantifiedInterpolants, 734 SizeOfPredicates, 25 NumberOfNonLiveVariables, 943 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 17 InterpolantComputations, 11 PerfectInterpolantSequences, 48/66 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 - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 3 procedures, 75 locations, 6 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: 2.5s, OverallIterations: 1, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.2s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=0, InterpolantAutomatonStates: 0, 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.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 6 NumberOfCodeBlocks, 6 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 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 - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 2 thread instances CFG has 4 procedures, 96 locations, 7 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: 1.3s, OverallIterations: 1, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=0, InterpolantAutomatonStates: 0, 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.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 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:08:51,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample