./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix043.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix043.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8b566ddb7b309d9ba7ea7e298fcc3be9218751e5387d333007519a12118bc5db --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 23:21:12,771 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:21:12,774 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:21:12,817 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:21:12,818 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:21:12,821 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:21:12,822 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:21:12,825 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:21:12,827 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:21:12,831 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:21:12,832 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:21:12,835 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:21:12,835 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:21:12,837 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:21:12,838 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:21:12,843 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:21:12,844 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:21:12,845 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:21:12,847 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:21:12,851 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:21:12,852 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:21:12,862 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:21:12,863 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:21:12,864 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:21:12,871 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:21:12,871 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:21:12,871 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:21:12,873 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:21:12,873 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:21:12,874 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:21:12,874 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:21:12,876 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:21:12,878 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:21:12,878 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:21:12,879 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:21:12,879 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:21:12,880 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:21:12,880 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:21:12,880 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:21:12,881 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:21:12,882 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:21:12,885 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-31 23:21:12,922 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:21:12,923 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:21:12,924 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:21:12,924 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:21:12,925 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:21:12,925 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:21:12,926 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:21:12,926 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:21:12,926 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:21:12,926 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:21:12,927 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:21:12,927 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:21:12,927 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:21:12,928 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:21:12,928 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:21:12,928 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:21:12,928 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:21:12,928 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:21:12,929 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:21:12,929 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:21:12,929 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:21:12,929 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:21:12,929 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:21:12,930 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:21:12,930 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:21:12,930 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:21:12,930 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:21:12,930 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:21:12,931 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-31 23:21:12,931 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-31 23:21:12,931 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:21:12,931 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:21:12,931 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:21:12,932 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:21:12,932 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 -> 8b566ddb7b309d9ba7ea7e298fcc3be9218751e5387d333007519a12118bc5db Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-08-31 23:21:13,217 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:21:13,234 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:21:13,237 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:21:13,238 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:21:13,238 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:21:13,239 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix043.opt.i [2023-08-31 23:21:14,429 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:21:14,659 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:21:14,660 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix043.opt.i [2023-08-31 23:21:14,671 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbcc96a3d/0fe3a7354e0f44a7b8b52bd6e1995a8e/FLAGbf131e4f2 [2023-08-31 23:21:14,686 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbcc96a3d/0fe3a7354e0f44a7b8b52bd6e1995a8e [2023-08-31 23:21:14,688 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:21:14,689 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:21:14,690 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:21:14,690 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:21:14,693 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:21:14,693 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:21:14" (1/1) ... [2023-08-31 23:21:14,694 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c9cc33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:21:14, skipping insertion in model container [2023-08-31 23:21:14,694 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:21:14" (1/1) ... [2023-08-31 23:21:14,700 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:21:14,738 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:21:14,866 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix043.opt.i[944,957] [2023-08-31 23:21:15,077 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:21:15,089 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:21:15,100 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix043.opt.i[944,957] [2023-08-31 23:21:15,160 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:21:15,196 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:21:15,196 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:21:15,202 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:21:15,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:21:15 WrapperNode [2023-08-31 23:21:15,203 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:21:15,204 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:21:15,204 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:21:15,204 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:21:15,210 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:21:15" (1/1) ... [2023-08-31 23:21:15,236 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:21:15" (1/1) ... [2023-08-31 23:21:15,262 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 169 [2023-08-31 23:21:15,264 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:21:15,265 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:21:15,265 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:21:15,265 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:21:15,273 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:21:15" (1/1) ... [2023-08-31 23:21:15,274 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:21:15" (1/1) ... [2023-08-31 23:21:15,277 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:21:15" (1/1) ... [2023-08-31 23:21:15,277 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:21:15" (1/1) ... [2023-08-31 23:21:15,283 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:21:15" (1/1) ... [2023-08-31 23:21:15,298 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:21:15" (1/1) ... [2023-08-31 23:21:15,300 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:21:15" (1/1) ... [2023-08-31 23:21:15,302 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:21:15" (1/1) ... [2023-08-31 23:21:15,304 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:21:15,305 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:21:15,305 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:21:15,305 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:21:15,306 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:21:15" (1/1) ... [2023-08-31 23:21:15,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:21:15,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:21:15,345 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-31 23:21:15,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-31 23:21:15,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-31 23:21:15,381 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:21:15,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:21:15,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:21:15,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:21:15,382 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:21:15,383 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:21:15,383 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:21:15,383 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:21:15,383 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-31 23:21:15,383 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-31 23:21:15,383 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-31 23:21:15,384 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-31 23:21:15,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-31 23:21:15,384 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:21:15,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:21:15,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:21:15,386 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 23:21:15,577 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:21:15,579 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:21:15,901 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:21:16,037 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:21:16,037 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:21:16,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:21:16 BoogieIcfgContainer [2023-08-31 23:21:16,044 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:21:16,046 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:21:16,047 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:21:16,049 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:21:16,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:21:14" (1/3) ... [2023-08-31 23:21:16,050 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bff2587 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:21:16, skipping insertion in model container [2023-08-31 23:21:16,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:21:15" (2/3) ... [2023-08-31 23:21:16,051 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bff2587 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:21:16, skipping insertion in model container [2023-08-31 23:21:16,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:21:16" (3/3) ... [2023-08-31 23:21:16,052 INFO L112 eAbstractionObserver]: Analyzing ICFG mix043.opt.i [2023-08-31 23:21:16,068 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:21:16,068 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-31 23:21:16,068 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:21:16,129 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:21:16,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 143 transitions, 306 flow [2023-08-31 23:21:16,203 INFO L130 PetriNetUnfolder]: 2/139 cut-off events. [2023-08-31 23:21:16,203 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:21:16,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 139 events. 2/139 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 104 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2023-08-31 23:21:16,209 INFO L82 GeneralOperation]: Start removeDead. Operand has 154 places, 143 transitions, 306 flow [2023-08-31 23:21:16,213 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 150 places, 139 transitions, 290 flow [2023-08-31 23:21:16,216 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:21:16,233 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 150 places, 139 transitions, 290 flow [2023-08-31 23:21:16,238 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 150 places, 139 transitions, 290 flow [2023-08-31 23:21:16,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 139 transitions, 290 flow [2023-08-31 23:21:16,282 INFO L130 PetriNetUnfolder]: 2/139 cut-off events. [2023-08-31 23:21:16,283 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:21:16,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 139 events. 2/139 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 104 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2023-08-31 23:21:16,288 INFO L119 LiptonReduction]: Number of co-enabled transitions 3258 [2023-08-31 23:21:20,938 INFO L134 LiptonReduction]: Checked pairs total: 8635 [2023-08-31 23:21:20,939 INFO L136 LiptonReduction]: Total number of compositions: 136 [2023-08-31 23:21:20,962 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:21:20,968 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;@5bdbd01f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:21:20,968 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-31 23:21:20,970 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-31 23:21:20,970 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:21:20,970 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:21:20,970 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:21:20,972 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:21:20,977 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:21:20,977 INFO L85 PathProgramCache]: Analyzing trace with hash 590, now seen corresponding path program 1 times [2023-08-31 23:21:20,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:21:20,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522372867] [2023-08-31 23:21:20,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:21:20,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:21:21,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:21:21,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:21:21,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:21:21,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522372867] [2023-08-31 23:21:21,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522372867] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:21:21,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:21:21,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:21:21,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786870954] [2023-08-31 23:21:21,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:21:21,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:21:21,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:21:21,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:21:21,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:21:21,147 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 279 [2023-08-31 23:21:21,149 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 92 flow. Second operand has 2 states, 2 states have (on average 130.5) internal successors, (261), 2 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:21,149 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:21:21,149 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 279 [2023-08-31 23:21:21,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:21:21,992 INFO L130 PetriNetUnfolder]: 5003/6961 cut-off events. [2023-08-31 23:21:21,992 INFO L131 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2023-08-31 23:21:22,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13893 conditions, 6961 events. 5003/6961 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 36621 event pairs, 5003 based on Foata normal form. 216/6165 useless extension candidates. Maximal degree in co-relation 13881. Up to 6829 conditions per place. [2023-08-31 23:21:22,031 INFO L137 encePairwiseOnDemand]: 270/279 looper letters, 27 selfloop transitions, 0 changer transitions 0/31 dead transitions. [2023-08-31 23:21:22,031 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 31 transitions, 128 flow [2023-08-31 23:21:22,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:21:22,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:21:22,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 296 transitions. [2023-08-31 23:21:22,042 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5304659498207885 [2023-08-31 23:21:22,043 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 296 transitions. [2023-08-31 23:21:22,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 296 transitions. [2023-08-31 23:21:22,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:21:22,046 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 296 transitions. [2023-08-31 23:21:22,048 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 148.0) internal successors, (296), 2 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:22,052 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 279.0) internal successors, (837), 3 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:22,053 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 279.0) internal successors, (837), 3 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:22,054 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 92 flow. Second operand 2 states and 296 transitions. [2023-08-31 23:21:22,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 31 transitions, 128 flow [2023-08-31 23:21:22,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 31 transitions, 124 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-31 23:21:22,058 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 70 flow [2023-08-31 23:21:22,060 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=70, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2023-08-31 23:21:22,062 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -11 predicate places. [2023-08-31 23:21:22,063 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 70 flow [2023-08-31 23:21:22,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 130.5) internal successors, (261), 2 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:22,063 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:21:22,063 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:21:22,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-31 23:21:22,064 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:21:22,065 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:21:22,065 INFO L85 PathProgramCache]: Analyzing trace with hash -16863318, now seen corresponding path program 1 times [2023-08-31 23:21:22,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:21:22,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96153511] [2023-08-31 23:21:22,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:21:22,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:21:22,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:21:22,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:21:22,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:21:22,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96153511] [2023-08-31 23:21:22,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96153511] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:21:22,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:21:22,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:21:22,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315532839] [2023-08-31 23:21:22,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:21:22,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:21:22,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:21:22,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:21:22,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:21:22,482 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 279 [2023-08-31 23:21:22,483 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 70 flow. Second operand 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-31 23:21:22,483 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:21:22,483 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 279 [2023-08-31 23:21:22,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:21:23,117 INFO L130 PetriNetUnfolder]: 4151/6001 cut-off events. [2023-08-31 23:21:23,117 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:21:23,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11790 conditions, 6001 events. 4151/6001 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 33463 event pairs, 743 based on Foata normal form. 0/5448 useless extension candidates. Maximal degree in co-relation 11787. Up to 4561 conditions per place. [2023-08-31 23:21:23,145 INFO L137 encePairwiseOnDemand]: 276/279 looper letters, 34 selfloop transitions, 2 changer transitions 4/44 dead transitions. [2023-08-31 23:21:23,145 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 44 transitions, 176 flow [2023-08-31 23:21:23,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:21:23,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:21:23,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 428 transitions. [2023-08-31 23:21:23,151 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5113500597371565 [2023-08-31 23:21:23,151 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 428 transitions. [2023-08-31 23:21:23,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 428 transitions. [2023-08-31 23:21:23,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:21:23,152 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 428 transitions. [2023-08-31 23:21:23,154 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:23,158 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:23,159 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:23,159 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 70 flow. Second operand 3 states and 428 transitions. [2023-08-31 23:21:23,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 44 transitions, 176 flow [2023-08-31 23:21:23,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 44 transitions, 176 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:21:23,160 INFO L231 Difference]: Finished difference. Result has 42 places, 28 transitions, 68 flow [2023-08-31 23:21:23,161 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=42, PETRI_TRANSITIONS=28} [2023-08-31 23:21:23,161 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -10 predicate places. [2023-08-31 23:21:23,161 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 28 transitions, 68 flow [2023-08-31 23:21:23,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has 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-31 23:21:23,162 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:21:23,162 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:21:23,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-31 23:21:23,163 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:21:23,165 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:21:23,165 INFO L85 PathProgramCache]: Analyzing trace with hash 139229836, now seen corresponding path program 1 times [2023-08-31 23:21:23,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:21:23,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980148258] [2023-08-31 23:21:23,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:21:23,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:21:23,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:21:23,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:21:23,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:21:23,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980148258] [2023-08-31 23:21:23,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980148258] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:21:23,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:21:23,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:21:23,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143615270] [2023-08-31 23:21:23,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:21:23,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:21:23,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:21:23,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:21:23,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:21:23,939 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 279 [2023-08-31 23:21:23,940 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 28 transitions, 68 flow. Second operand has 5 states, 5 states have (on average 116.4) internal successors, (582), 5 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:23,940 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:21:23,940 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 279 [2023-08-31 23:21:23,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:21:24,959 INFO L130 PetriNetUnfolder]: 7415/10040 cut-off events. [2023-08-31 23:21:24,959 INFO L131 PetriNetUnfolder]: For 272/272 co-relation queries the response was YES. [2023-08-31 23:21:24,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20551 conditions, 10040 events. 7415/10040 cut-off events. For 272/272 co-relation queries the response was YES. Maximal size of possible extension queue 392. Compared 47182 event pairs, 1655 based on Foata normal form. 0/9764 useless extension candidates. Maximal degree in co-relation 20547. Up to 5057 conditions per place. [2023-08-31 23:21:25,018 INFO L137 encePairwiseOnDemand]: 274/279 looper letters, 59 selfloop transitions, 5 changer transitions 0/65 dead transitions. [2023-08-31 23:21:25,019 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 65 transitions, 272 flow [2023-08-31 23:21:25,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:21:25,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:21:25,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 636 transitions. [2023-08-31 23:21:25,021 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4559139784946237 [2023-08-31 23:21:25,022 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 636 transitions. [2023-08-31 23:21:25,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 636 transitions. [2023-08-31 23:21:25,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:21:25,022 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 636 transitions. [2023-08-31 23:21:25,024 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.2) internal successors, (636), 5 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:25,027 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 279.0) internal successors, (1674), 6 states have internal predecessors, (1674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:25,027 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 279.0) internal successors, (1674), 6 states have internal predecessors, (1674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:25,028 INFO L175 Difference]: Start difference. First operand has 42 places, 28 transitions, 68 flow. Second operand 5 states and 636 transitions. [2023-08-31 23:21:25,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 65 transitions, 272 flow [2023-08-31 23:21:25,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 65 transitions, 266 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:21:25,035 INFO L231 Difference]: Finished difference. Result has 46 places, 31 transitions, 98 flow [2023-08-31 23:21:25,036 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=98, PETRI_PLACES=46, PETRI_TRANSITIONS=31} [2023-08-31 23:21:25,036 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -6 predicate places. [2023-08-31 23:21:25,037 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 31 transitions, 98 flow [2023-08-31 23:21:25,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.4) internal successors, (582), 5 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:25,037 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:21:25,037 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:21:25,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-31 23:21:25,038 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:21:25,038 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:21:25,038 INFO L85 PathProgramCache]: Analyzing trace with hash 139229926, now seen corresponding path program 1 times [2023-08-31 23:21:25,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:21:25,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587545222] [2023-08-31 23:21:25,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:21:25,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:21:25,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:21:25,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:21:25,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:21:25,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587545222] [2023-08-31 23:21:25,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587545222] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:21:25,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:21:25,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:21:25,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996821543] [2023-08-31 23:21:25,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:21:25,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:21:25,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:21:25,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:21:25,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:21:25,839 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 279 [2023-08-31 23:21:25,840 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 31 transitions, 98 flow. Second operand has 7 states, 7 states have (on average 113.71428571428571) internal successors, (796), 7 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:25,841 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:21:25,841 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 279 [2023-08-31 23:21:25,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:21:26,274 INFO L130 PetriNetUnfolder]: 2561/3751 cut-off events. [2023-08-31 23:21:26,275 INFO L131 PetriNetUnfolder]: For 936/936 co-relation queries the response was YES. [2023-08-31 23:21:26,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8208 conditions, 3751 events. 2561/3751 cut-off events. For 936/936 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 19411 event pairs, 399 based on Foata normal form. 288/4039 useless extension candidates. Maximal degree in co-relation 8201. Up to 2358 conditions per place. [2023-08-31 23:21:26,297 INFO L137 encePairwiseOnDemand]: 273/279 looper letters, 40 selfloop transitions, 5 changer transitions 2/51 dead transitions. [2023-08-31 23:21:26,297 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 51 transitions, 226 flow [2023-08-31 23:21:26,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:21:26,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:21:26,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 832 transitions. [2023-08-31 23:21:26,305 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42601126472094214 [2023-08-31 23:21:26,305 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 832 transitions. [2023-08-31 23:21:26,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 832 transitions. [2023-08-31 23:21:26,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:21:26,306 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 832 transitions. [2023-08-31 23:21:26,308 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.85714285714286) internal successors, (832), 7 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:26,311 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 279.0) internal successors, (2232), 8 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:26,312 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 279.0) internal successors, (2232), 8 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:26,312 INFO L175 Difference]: Start difference. First operand has 46 places, 31 transitions, 98 flow. Second operand 7 states and 832 transitions. [2023-08-31 23:21:26,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 51 transitions, 226 flow [2023-08-31 23:21:26,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 51 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:21:26,325 INFO L231 Difference]: Finished difference. Result has 49 places, 27 transitions, 82 flow [2023-08-31 23:21:26,325 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=82, PETRI_PLACES=49, PETRI_TRANSITIONS=27} [2023-08-31 23:21:26,327 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -3 predicate places. [2023-08-31 23:21:26,327 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 27 transitions, 82 flow [2023-08-31 23:21:26,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.71428571428571) internal successors, (796), 7 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:26,328 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:21:26,328 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:21:26,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-31 23:21:26,328 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:21:26,329 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:21:26,329 INFO L85 PathProgramCache]: Analyzing trace with hash 730724186, now seen corresponding path program 1 times [2023-08-31 23:21:26,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:21:26,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190386927] [2023-08-31 23:21:26,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:21:26,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:21:26,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:21:26,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:21:26,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:21:26,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190386927] [2023-08-31 23:21:26,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190386927] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:21:26,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:21:26,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:21:26,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787151384] [2023-08-31 23:21:26,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:21:26,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:21:27,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:21:27,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:21:27,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:21:27,028 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 279 [2023-08-31 23:21:27,029 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 27 transitions, 82 flow. Second operand has 6 states, 6 states have (on average 125.33333333333333) internal successors, (752), 6 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:27,029 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:21:27,029 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 279 [2023-08-31 23:21:27,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:21:27,548 INFO L130 PetriNetUnfolder]: 3044/4399 cut-off events. [2023-08-31 23:21:27,548 INFO L131 PetriNetUnfolder]: For 827/827 co-relation queries the response was YES. [2023-08-31 23:21:27,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9540 conditions, 4399 events. 3044/4399 cut-off events. For 827/827 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 22585 event pairs, 527 based on Foata normal form. 135/4503 useless extension candidates. Maximal degree in co-relation 9533. Up to 2854 conditions per place. [2023-08-31 23:21:27,575 INFO L137 encePairwiseOnDemand]: 272/279 looper letters, 49 selfloop transitions, 7 changer transitions 19/78 dead transitions. [2023-08-31 23:21:27,576 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 78 transitions, 348 flow [2023-08-31 23:21:27,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:21:27,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:21:27,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 938 transitions. [2023-08-31 23:21:27,579 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48028673835125446 [2023-08-31 23:21:27,579 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 938 transitions. [2023-08-31 23:21:27,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 938 transitions. [2023-08-31 23:21:27,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:21:27,580 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 938 transitions. [2023-08-31 23:21:27,583 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 134.0) internal successors, (938), 7 states have internal predecessors, (938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:27,587 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 279.0) internal successors, (2232), 8 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:27,587 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 279.0) internal successors, (2232), 8 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:27,587 INFO L175 Difference]: Start difference. First operand has 49 places, 27 transitions, 82 flow. Second operand 7 states and 938 transitions. [2023-08-31 23:21:27,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 78 transitions, 348 flow [2023-08-31 23:21:27,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 78 transitions, 327 flow, removed 2 selfloop flow, removed 8 redundant places. [2023-08-31 23:21:27,604 INFO L231 Difference]: Finished difference. Result has 49 places, 33 transitions, 115 flow [2023-08-31 23:21:27,604 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=115, PETRI_PLACES=49, PETRI_TRANSITIONS=33} [2023-08-31 23:21:27,606 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -3 predicate places. [2023-08-31 23:21:27,607 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 33 transitions, 115 flow [2023-08-31 23:21:27,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 125.33333333333333) internal successors, (752), 6 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:27,607 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:21:27,607 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:21:27,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-31 23:21:27,608 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:21:27,608 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:21:27,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1138404028, now seen corresponding path program 1 times [2023-08-31 23:21:27,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:21:27,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364016429] [2023-08-31 23:21:27,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:21:27,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:21:27,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:21:28,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:21:28,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:21:28,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364016429] [2023-08-31 23:21:28,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364016429] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:21:28,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:21:28,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:21:28,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667224289] [2023-08-31 23:21:28,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:21:28,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:21:28,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:21:28,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:21:28,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:21:28,174 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 279 [2023-08-31 23:21:28,176 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 33 transitions, 115 flow. Second operand has 7 states, 7 states have (on average 123.28571428571429) internal successors, (863), 7 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:28,176 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:21:28,176 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 279 [2023-08-31 23:21:28,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:21:28,791 INFO L130 PetriNetUnfolder]: 2981/4318 cut-off events. [2023-08-31 23:21:28,791 INFO L131 PetriNetUnfolder]: For 1503/1503 co-relation queries the response was YES. [2023-08-31 23:21:28,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10744 conditions, 4318 events. 2981/4318 cut-off events. For 1503/1503 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 22073 event pairs, 569 based on Foata normal form. 81/4368 useless extension candidates. Maximal degree in co-relation 10735. Up to 3064 conditions per place. [2023-08-31 23:21:28,824 INFO L137 encePairwiseOnDemand]: 271/279 looper letters, 46 selfloop transitions, 11 changer transitions 9/69 dead transitions. [2023-08-31 23:21:28,824 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 69 transitions, 343 flow [2023-08-31 23:21:28,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:21:28,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:21:28,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 789 transitions. [2023-08-31 23:21:28,827 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.471326164874552 [2023-08-31 23:21:28,828 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 789 transitions. [2023-08-31 23:21:28,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 789 transitions. [2023-08-31 23:21:28,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:21:28,829 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 789 transitions. [2023-08-31 23:21:28,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 131.5) internal successors, (789), 6 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:28,833 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 279.0) internal successors, (1953), 7 states have internal predecessors, (1953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:28,834 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 279.0) internal successors, (1953), 7 states have internal predecessors, (1953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:28,834 INFO L175 Difference]: Start difference. First operand has 49 places, 33 transitions, 115 flow. Second operand 6 states and 789 transitions. [2023-08-31 23:21:28,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 69 transitions, 343 flow [2023-08-31 23:21:28,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 69 transitions, 341 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-31 23:21:28,843 INFO L231 Difference]: Finished difference. Result has 54 places, 39 transitions, 179 flow [2023-08-31 23:21:28,843 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=179, PETRI_PLACES=54, PETRI_TRANSITIONS=39} [2023-08-31 23:21:28,845 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 2 predicate places. [2023-08-31 23:21:28,847 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 39 transitions, 179 flow [2023-08-31 23:21:28,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 123.28571428571429) internal successors, (863), 7 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:28,848 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:21:28,848 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:21:28,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-31 23:21:28,849 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:21:28,849 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:21:28,849 INFO L85 PathProgramCache]: Analyzing trace with hash 791592294, now seen corresponding path program 2 times [2023-08-31 23:21:28,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:21:28,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174926691] [2023-08-31 23:21:28,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:21:28,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:21:28,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:21:29,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:21:29,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:21:29,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174926691] [2023-08-31 23:21:29,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174926691] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:21:29,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:21:29,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:21:29,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211355064] [2023-08-31 23:21:29,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:21:29,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:21:29,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:21:29,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:21:29,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:21:29,458 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 279 [2023-08-31 23:21:29,459 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 39 transitions, 179 flow. Second operand has 7 states, 7 states have (on average 124.28571428571429) internal successors, (870), 7 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:29,459 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:21:29,460 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 279 [2023-08-31 23:21:29,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:21:30,050 INFO L130 PetriNetUnfolder]: 3023/4378 cut-off events. [2023-08-31 23:21:30,050 INFO L131 PetriNetUnfolder]: For 3294/3294 co-relation queries the response was YES. [2023-08-31 23:21:30,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12335 conditions, 4378 events. 3023/4378 cut-off events. For 3294/3294 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 22492 event pairs, 560 based on Foata normal form. 81/4428 useless extension candidates. Maximal degree in co-relation 12323. Up to 3073 conditions per place. [2023-08-31 23:21:30,076 INFO L137 encePairwiseOnDemand]: 271/279 looper letters, 47 selfloop transitions, 12 changer transitions 15/77 dead transitions. [2023-08-31 23:21:30,076 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 77 transitions, 447 flow [2023-08-31 23:21:30,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:21:30,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:21:30,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 924 transitions. [2023-08-31 23:21:30,079 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4731182795698925 [2023-08-31 23:21:30,079 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 924 transitions. [2023-08-31 23:21:30,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 924 transitions. [2023-08-31 23:21:30,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:21:30,080 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 924 transitions. [2023-08-31 23:21:30,082 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 132.0) internal successors, (924), 7 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:30,085 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 279.0) internal successors, (2232), 8 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:30,086 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 279.0) internal successors, (2232), 8 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:30,086 INFO L175 Difference]: Start difference. First operand has 54 places, 39 transitions, 179 flow. Second operand 7 states and 924 transitions. [2023-08-31 23:21:30,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 77 transitions, 447 flow [2023-08-31 23:21:30,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 77 transitions, 432 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-31 23:21:30,097 INFO L231 Difference]: Finished difference. Result has 60 places, 41 transitions, 221 flow [2023-08-31 23:21:30,098 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=221, PETRI_PLACES=60, PETRI_TRANSITIONS=41} [2023-08-31 23:21:30,098 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 8 predicate places. [2023-08-31 23:21:30,098 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 41 transitions, 221 flow [2023-08-31 23:21:30,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 124.28571428571429) internal successors, (870), 7 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:30,099 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:21:30,099 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:21:30,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-31 23:21:30,100 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:21:30,100 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:21:30,100 INFO L85 PathProgramCache]: Analyzing trace with hash 714731514, now seen corresponding path program 3 times [2023-08-31 23:21:30,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:21:30,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382701537] [2023-08-31 23:21:30,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:21:30,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:21:30,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:21:30,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:21:30,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:21:30,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382701537] [2023-08-31 23:21:30,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382701537] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:21:30,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:21:30,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:21:30,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010090272] [2023-08-31 23:21:30,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:21:30,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:21:30,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:21:30,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:21:30,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:21:30,560 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 279 [2023-08-31 23:21:30,561 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 41 transitions, 221 flow. Second operand has 7 states, 7 states have (on average 124.28571428571429) internal successors, (870), 7 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:30,561 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:21:30,561 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 279 [2023-08-31 23:21:30,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:21:31,091 INFO L130 PetriNetUnfolder]: 2963/4309 cut-off events. [2023-08-31 23:21:31,091 INFO L131 PetriNetUnfolder]: For 5769/5769 co-relation queries the response was YES. [2023-08-31 23:21:31,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12938 conditions, 4309 events. 2963/4309 cut-off events. For 5769/5769 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 22163 event pairs, 557 based on Foata normal form. 81/4359 useless extension candidates. Maximal degree in co-relation 12924. Up to 3004 conditions per place. [2023-08-31 23:21:31,124 INFO L137 encePairwiseOnDemand]: 271/279 looper letters, 48 selfloop transitions, 13 changer transitions 9/73 dead transitions. [2023-08-31 23:21:31,124 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 73 transitions, 477 flow [2023-08-31 23:21:31,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:21:31,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:21:31,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 794 transitions. [2023-08-31 23:21:31,127 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4743130227001195 [2023-08-31 23:21:31,128 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 794 transitions. [2023-08-31 23:21:31,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 794 transitions. [2023-08-31 23:21:31,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:21:31,128 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 794 transitions. [2023-08-31 23:21:31,130 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 132.33333333333334) internal successors, (794), 6 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:31,133 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 279.0) internal successors, (1953), 7 states have internal predecessors, (1953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:31,133 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 279.0) internal successors, (1953), 7 states have internal predecessors, (1953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:31,133 INFO L175 Difference]: Start difference. First operand has 60 places, 41 transitions, 221 flow. Second operand 6 states and 794 transitions. [2023-08-31 23:21:31,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 73 transitions, 477 flow [2023-08-31 23:21:31,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 73 transitions, 450 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-08-31 23:21:31,150 INFO L231 Difference]: Finished difference. Result has 61 places, 43 transitions, 257 flow [2023-08-31 23:21:31,151 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=257, PETRI_PLACES=61, PETRI_TRANSITIONS=43} [2023-08-31 23:21:31,151 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 9 predicate places. [2023-08-31 23:21:31,151 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 43 transitions, 257 flow [2023-08-31 23:21:31,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 124.28571428571429) internal successors, (870), 7 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:31,152 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:21:31,152 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:21:31,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-31 23:21:31,153 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:21:31,153 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:21:31,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1294407855, now seen corresponding path program 1 times [2023-08-31 23:21:31,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:21:31,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982558347] [2023-08-31 23:21:31,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:21:31,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:21:31,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:21:31,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:21:31,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:21:31,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982558347] [2023-08-31 23:21:31,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982558347] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:21:31,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:21:31,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:21:31,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477707420] [2023-08-31 23:21:31,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:21:31,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:21:31,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:21:31,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:21:31,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:21:31,384 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 279 [2023-08-31 23:21:31,385 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 43 transitions, 257 flow. Second operand has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:31,385 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:21:31,386 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 279 [2023-08-31 23:21:31,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:21:31,702 INFO L130 PetriNetUnfolder]: 1858/2732 cut-off events. [2023-08-31 23:21:31,703 INFO L131 PetriNetUnfolder]: For 5780/5814 co-relation queries the response was YES. [2023-08-31 23:21:31,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9013 conditions, 2732 events. 1858/2732 cut-off events. For 5780/5814 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 13034 event pairs, 470 based on Foata normal form. 90/2811 useless extension candidates. Maximal degree in co-relation 8998. Up to 2445 conditions per place. [2023-08-31 23:21:31,719 INFO L137 encePairwiseOnDemand]: 273/279 looper letters, 57 selfloop transitions, 5 changer transitions 0/67 dead transitions. [2023-08-31 23:21:31,720 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 67 transitions, 509 flow [2023-08-31 23:21:31,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:21:31,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:21:31,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2023-08-31 23:21:31,721 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4970131421744325 [2023-08-31 23:21:31,722 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 416 transitions. [2023-08-31 23:21:31,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 416 transitions. [2023-08-31 23:21:31,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:21:31,722 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 416 transitions. [2023-08-31 23:21:31,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:31,725 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:31,725 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:31,725 INFO L175 Difference]: Start difference. First operand has 61 places, 43 transitions, 257 flow. Second operand 3 states and 416 transitions. [2023-08-31 23:21:31,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 67 transitions, 509 flow [2023-08-31 23:21:31,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 67 transitions, 472 flow, removed 9 selfloop flow, removed 4 redundant places. [2023-08-31 23:21:31,736 INFO L231 Difference]: Finished difference. Result has 59 places, 47 transitions, 261 flow [2023-08-31 23:21:31,736 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=261, PETRI_PLACES=59, PETRI_TRANSITIONS=47} [2023-08-31 23:21:31,737 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 7 predicate places. [2023-08-31 23:21:31,737 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 47 transitions, 261 flow [2023-08-31 23:21:31,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:31,738 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:21:31,738 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:21:31,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-31 23:21:31,738 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:21:31,739 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:21:31,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1197385992, now seen corresponding path program 1 times [2023-08-31 23:21:31,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:21:31,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860123275] [2023-08-31 23:21:31,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:21:31,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:21:31,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:21:31,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:21:31,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:21:31,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860123275] [2023-08-31 23:21:31,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860123275] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:21:31,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:21:31,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:21:31,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265352331] [2023-08-31 23:21:31,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:21:31,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:21:31,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:21:31,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:21:31,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:21:31,950 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 279 [2023-08-31 23:21:31,950 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 47 transitions, 261 flow. Second operand has 4 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:31,950 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:21:31,951 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 279 [2023-08-31 23:21:31,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:21:32,149 INFO L130 PetriNetUnfolder]: 990/1560 cut-off events. [2023-08-31 23:21:32,149 INFO L131 PetriNetUnfolder]: For 2968/2994 co-relation queries the response was YES. [2023-08-31 23:21:32,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5497 conditions, 1560 events. 990/1560 cut-off events. For 2968/2994 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 7159 event pairs, 172 based on Foata normal form. 114/1663 useless extension candidates. Maximal degree in co-relation 5483. Up to 891 conditions per place. [2023-08-31 23:21:32,162 INFO L137 encePairwiseOnDemand]: 273/279 looper letters, 75 selfloop transitions, 9 changer transitions 0/89 dead transitions. [2023-08-31 23:21:32,162 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 89 transitions, 663 flow [2023-08-31 23:21:32,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:21:32,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:21:32,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 556 transitions. [2023-08-31 23:21:32,164 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4982078853046595 [2023-08-31 23:21:32,164 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 556 transitions. [2023-08-31 23:21:32,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 556 transitions. [2023-08-31 23:21:32,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:21:32,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 556 transitions. [2023-08-31 23:21:32,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.0) internal successors, (556), 4 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:32,169 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 279.0) internal successors, (1395), 5 states have internal predecessors, (1395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:32,170 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 279.0) internal successors, (1395), 5 states have internal predecessors, (1395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:32,170 INFO L175 Difference]: Start difference. First operand has 59 places, 47 transitions, 261 flow. Second operand 4 states and 556 transitions. [2023-08-31 23:21:32,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 89 transitions, 663 flow [2023-08-31 23:21:32,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 89 transitions, 658 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:21:32,176 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 308 flow [2023-08-31 23:21:32,177 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=308, PETRI_PLACES=62, PETRI_TRANSITIONS=51} [2023-08-31 23:21:32,178 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 10 predicate places. [2023-08-31 23:21:32,178 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 308 flow [2023-08-31 23:21:32,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:32,179 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:21:32,179 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:21:32,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-31 23:21:32,179 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:21:32,179 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:21:32,179 INFO L85 PathProgramCache]: Analyzing trace with hash 523589627, now seen corresponding path program 1 times [2023-08-31 23:21:32,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:21:32,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252730313] [2023-08-31 23:21:32,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:21:32,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:21:32,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:21:32,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:21:32,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:21:32,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252730313] [2023-08-31 23:21:32,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252730313] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:21:32,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:21:32,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:21:32,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418245786] [2023-08-31 23:21:32,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:21:32,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:21:32,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:21:32,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:21:32,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:21:32,642 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 279 [2023-08-31 23:21:32,643 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 308 flow. Second operand has 6 states, 6 states have (on average 115.33333333333333) internal successors, (692), 6 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:32,643 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:21:32,643 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 279 [2023-08-31 23:21:32,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:21:33,233 INFO L130 PetriNetUnfolder]: 2638/4024 cut-off events. [2023-08-31 23:21:33,234 INFO L131 PetriNetUnfolder]: For 9375/9432 co-relation queries the response was YES. [2023-08-31 23:21:33,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14880 conditions, 4024 events. 2638/4024 cut-off events. For 9375/9432 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 20205 event pairs, 352 based on Foata normal form. 108/4114 useless extension candidates. Maximal degree in co-relation 14865. Up to 2328 conditions per place. [2023-08-31 23:21:33,261 INFO L137 encePairwiseOnDemand]: 270/279 looper letters, 102 selfloop transitions, 13 changer transitions 32/149 dead transitions. [2023-08-31 23:21:33,261 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 149 transitions, 1154 flow [2023-08-31 23:21:33,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:21:33,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:21:33,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 878 transitions. [2023-08-31 23:21:33,264 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4495647721454173 [2023-08-31 23:21:33,264 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 878 transitions. [2023-08-31 23:21:33,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 878 transitions. [2023-08-31 23:21:33,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:21:33,264 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 878 transitions. [2023-08-31 23:21:33,266 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.42857142857143) internal successors, (878), 7 states have internal predecessors, (878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:33,269 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 279.0) internal successors, (2232), 8 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:33,269 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 279.0) internal successors, (2232), 8 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:33,269 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 308 flow. Second operand 7 states and 878 transitions. [2023-08-31 23:21:33,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 149 transitions, 1154 flow [2023-08-31 23:21:33,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 149 transitions, 1108 flow, removed 11 selfloop flow, removed 2 redundant places. [2023-08-31 23:21:33,285 INFO L231 Difference]: Finished difference. Result has 71 places, 61 transitions, 418 flow [2023-08-31 23:21:33,285 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=418, PETRI_PLACES=71, PETRI_TRANSITIONS=61} [2023-08-31 23:21:33,286 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 19 predicate places. [2023-08-31 23:21:33,286 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 61 transitions, 418 flow [2023-08-31 23:21:33,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.33333333333333) internal successors, (692), 6 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:33,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:21:33,287 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:21:33,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-31 23:21:33,287 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:21:33,287 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:21:33,287 INFO L85 PathProgramCache]: Analyzing trace with hash -655279595, now seen corresponding path program 2 times [2023-08-31 23:21:33,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:21:33,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330677102] [2023-08-31 23:21:33,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:21:33,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:21:33,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:21:33,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:21:33,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:21:33,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330677102] [2023-08-31 23:21:33,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330677102] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:21:33,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:21:33,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:21:33,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639593411] [2023-08-31 23:21:33,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:21:33,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:21:33,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:21:33,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:21:33,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:21:33,520 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 279 [2023-08-31 23:21:33,521 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 61 transitions, 418 flow. Second operand has 5 states, 5 states have (on average 128.6) internal successors, (643), 5 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:33,521 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:21:33,521 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 279 [2023-08-31 23:21:33,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:21:33,808 INFO L130 PetriNetUnfolder]: 1226/2014 cut-off events. [2023-08-31 23:21:33,808 INFO L131 PetriNetUnfolder]: For 5934/6049 co-relation queries the response was YES. [2023-08-31 23:21:33,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7722 conditions, 2014 events. 1226/2014 cut-off events. For 5934/6049 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 10674 event pairs, 175 based on Foata normal form. 183/2145 useless extension candidates. Maximal degree in co-relation 7702. Up to 748 conditions per place. [2023-08-31 23:21:33,825 INFO L137 encePairwiseOnDemand]: 273/279 looper letters, 83 selfloop transitions, 13 changer transitions 0/105 dead transitions. [2023-08-31 23:21:33,825 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 105 transitions, 886 flow [2023-08-31 23:21:33,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:21:33,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:21:33,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 694 transitions. [2023-08-31 23:21:33,829 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4974910394265233 [2023-08-31 23:21:33,829 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 694 transitions. [2023-08-31 23:21:33,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 694 transitions. [2023-08-31 23:21:33,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:21:33,830 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 694 transitions. [2023-08-31 23:21:33,831 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.8) internal successors, (694), 5 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:33,833 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 279.0) internal successors, (1674), 6 states have internal predecessors, (1674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:33,834 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 279.0) internal successors, (1674), 6 states have internal predecessors, (1674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:33,834 INFO L175 Difference]: Start difference. First operand has 71 places, 61 transitions, 418 flow. Second operand 5 states and 694 transitions. [2023-08-31 23:21:33,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 105 transitions, 886 flow [2023-08-31 23:21:33,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 105 transitions, 764 flow, removed 20 selfloop flow, removed 8 redundant places. [2023-08-31 23:21:33,845 INFO L231 Difference]: Finished difference. Result has 67 places, 58 transitions, 382 flow [2023-08-31 23:21:33,845 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=382, PETRI_PLACES=67, PETRI_TRANSITIONS=58} [2023-08-31 23:21:33,846 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 15 predicate places. [2023-08-31 23:21:33,847 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 58 transitions, 382 flow [2023-08-31 23:21:33,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 128.6) internal successors, (643), 5 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:33,847 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:21:33,847 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:21:33,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-31 23:21:33,848 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:21:33,848 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:21:33,848 INFO L85 PathProgramCache]: Analyzing trace with hash -375544504, now seen corresponding path program 1 times [2023-08-31 23:21:33,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:21:33,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413959275] [2023-08-31 23:21:33,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:21:33,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:21:33,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:21:34,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:21:34,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:21:34,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413959275] [2023-08-31 23:21:34,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413959275] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:21:34,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:21:34,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:21:34,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752834891] [2023-08-31 23:21:34,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:21:34,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:21:34,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:21:34,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:21:34,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:21:34,315 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 279 [2023-08-31 23:21:34,316 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 58 transitions, 382 flow. Second operand has 6 states, 6 states have (on average 115.83333333333333) internal successors, (695), 6 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:34,316 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:21:34,316 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 279 [2023-08-31 23:21:34,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:21:34,903 INFO L130 PetriNetUnfolder]: 2382/3693 cut-off events. [2023-08-31 23:21:34,903 INFO L131 PetriNetUnfolder]: For 8708/8724 co-relation queries the response was YES. [2023-08-31 23:21:34,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14511 conditions, 3693 events. 2382/3693 cut-off events. For 8708/8724 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 19239 event pairs, 388 based on Foata normal form. 26/3707 useless extension candidates. Maximal degree in co-relation 14493. Up to 1963 conditions per place. [2023-08-31 23:21:34,929 INFO L137 encePairwiseOnDemand]: 271/279 looper letters, 90 selfloop transitions, 15 changer transitions 52/159 dead transitions. [2023-08-31 23:21:34,929 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 159 transitions, 1320 flow [2023-08-31 23:21:34,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:21:34,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:21:34,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 880 transitions. [2023-08-31 23:21:34,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45058883768561186 [2023-08-31 23:21:34,932 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 880 transitions. [2023-08-31 23:21:34,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 880 transitions. [2023-08-31 23:21:34,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:21:34,933 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 880 transitions. [2023-08-31 23:21:34,935 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.71428571428571) internal successors, (880), 7 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:34,938 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 279.0) internal successors, (2232), 8 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:34,939 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 279.0) internal successors, (2232), 8 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:34,939 INFO L175 Difference]: Start difference. First operand has 67 places, 58 transitions, 382 flow. Second operand 7 states and 880 transitions. [2023-08-31 23:21:34,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 159 transitions, 1320 flow [2023-08-31 23:21:34,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 159 transitions, 1230 flow, removed 22 selfloop flow, removed 3 redundant places. [2023-08-31 23:21:34,973 INFO L231 Difference]: Finished difference. Result has 73 places, 62 transitions, 418 flow [2023-08-31 23:21:34,974 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=418, PETRI_PLACES=73, PETRI_TRANSITIONS=62} [2023-08-31 23:21:34,974 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 21 predicate places. [2023-08-31 23:21:34,975 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 62 transitions, 418 flow [2023-08-31 23:21:34,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.83333333333333) internal successors, (695), 6 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:34,975 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:21:34,975 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:21:34,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-31 23:21:34,976 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:21:34,976 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:21:34,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1640208688, now seen corresponding path program 2 times [2023-08-31 23:21:34,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:21:34,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825287017] [2023-08-31 23:21:34,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:21:34,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:21:35,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:21:35,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:21:35,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:21:35,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825287017] [2023-08-31 23:21:35,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825287017] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:21:35,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:21:35,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:21:35,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057909847] [2023-08-31 23:21:35,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:21:35,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:21:35,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:21:35,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:21:35,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:21:35,269 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 279 [2023-08-31 23:21:35,270 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 62 transitions, 418 flow. Second operand has 6 states, 6 states have (on average 128.33333333333334) internal successors, (770), 6 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:35,270 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:21:35,270 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 279 [2023-08-31 23:21:35,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:21:35,593 INFO L130 PetriNetUnfolder]: 1467/2383 cut-off events. [2023-08-31 23:21:35,593 INFO L131 PetriNetUnfolder]: For 5096/5248 co-relation queries the response was YES. [2023-08-31 23:21:35,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8818 conditions, 2383 events. 1467/2383 cut-off events. For 5096/5248 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 13653 event pairs, 164 based on Foata normal form. 133/2436 useless extension candidates. Maximal degree in co-relation 8797. Up to 898 conditions per place. [2023-08-31 23:21:35,608 INFO L137 encePairwiseOnDemand]: 273/279 looper letters, 51 selfloop transitions, 17 changer transitions 36/109 dead transitions. [2023-08-31 23:21:35,608 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 109 transitions, 861 flow [2023-08-31 23:21:35,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:21:35,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:21:35,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 819 transitions. [2023-08-31 23:21:35,611 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.489247311827957 [2023-08-31 23:21:35,611 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 819 transitions. [2023-08-31 23:21:35,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 819 transitions. [2023-08-31 23:21:35,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:21:35,612 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 819 transitions. [2023-08-31 23:21:35,614 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 136.5) internal successors, (819), 6 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:35,616 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 279.0) internal successors, (1953), 7 states have internal predecessors, (1953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:35,617 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 279.0) internal successors, (1953), 7 states have internal predecessors, (1953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:35,617 INFO L175 Difference]: Start difference. First operand has 73 places, 62 transitions, 418 flow. Second operand 6 states and 819 transitions. [2023-08-31 23:21:35,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 109 transitions, 861 flow [2023-08-31 23:21:35,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 109 transitions, 828 flow, removed 14 selfloop flow, removed 3 redundant places. [2023-08-31 23:21:35,660 INFO L231 Difference]: Finished difference. Result has 75 places, 47 transitions, 302 flow [2023-08-31 23:21:35,660 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=302, PETRI_PLACES=75, PETRI_TRANSITIONS=47} [2023-08-31 23:21:35,661 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 23 predicate places. [2023-08-31 23:21:35,661 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 47 transitions, 302 flow [2023-08-31 23:21:35,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 128.33333333333334) internal successors, (770), 6 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:35,661 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:21:35,662 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:21:35,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-31 23:21:35,662 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:21:35,662 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:21:35,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1668152224, now seen corresponding path program 1 times [2023-08-31 23:21:35,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:21:35,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017458870] [2023-08-31 23:21:35,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:21:35,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:21:35,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:21:36,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:21:36,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:21:36,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017458870] [2023-08-31 23:21:36,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017458870] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:21:36,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:21:36,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:21:36,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470747238] [2023-08-31 23:21:36,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:21:36,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:21:36,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:21:36,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:21:36,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:21:36,215 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 279 [2023-08-31 23:21:36,216 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 47 transitions, 302 flow. Second operand has 6 states, 6 states have (on average 116.33333333333333) internal successors, (698), 6 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:36,216 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:21:36,216 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 279 [2023-08-31 23:21:36,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:21:36,607 INFO L130 PetriNetUnfolder]: 1045/1718 cut-off events. [2023-08-31 23:21:36,608 INFO L131 PetriNetUnfolder]: For 4003/4003 co-relation queries the response was YES. [2023-08-31 23:21:36,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6640 conditions, 1718 events. 1045/1718 cut-off events. For 4003/4003 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 8807 event pairs, 263 based on Foata normal form. 1/1717 useless extension candidates. Maximal degree in co-relation 6620. Up to 897 conditions per place. [2023-08-31 23:21:36,617 INFO L137 encePairwiseOnDemand]: 272/279 looper letters, 47 selfloop transitions, 3 changer transitions 49/100 dead transitions. [2023-08-31 23:21:36,617 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 100 transitions, 834 flow [2023-08-31 23:21:36,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:21:36,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:21:36,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 844 transitions. [2023-08-31 23:21:36,621 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4321556579621096 [2023-08-31 23:21:36,621 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 844 transitions. [2023-08-31 23:21:36,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 844 transitions. [2023-08-31 23:21:36,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:21:36,622 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 844 transitions. [2023-08-31 23:21:36,624 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 120.57142857142857) internal successors, (844), 7 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:36,627 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 279.0) internal successors, (2232), 8 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:36,627 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 279.0) internal successors, (2232), 8 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:36,628 INFO L175 Difference]: Start difference. First operand has 75 places, 47 transitions, 302 flow. Second operand 7 states and 844 transitions. [2023-08-31 23:21:36,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 100 transitions, 834 flow [2023-08-31 23:21:36,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 100 transitions, 686 flow, removed 34 selfloop flow, removed 10 redundant places. [2023-08-31 23:21:36,644 INFO L231 Difference]: Finished difference. Result has 70 places, 41 transitions, 209 flow [2023-08-31 23:21:36,644 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=209, PETRI_PLACES=70, PETRI_TRANSITIONS=41} [2023-08-31 23:21:36,645 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 18 predicate places. [2023-08-31 23:21:36,645 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 41 transitions, 209 flow [2023-08-31 23:21:36,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.33333333333333) internal successors, (698), 6 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:36,646 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:21:36,646 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:21:36,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-31 23:21:36,646 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:21:36,647 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:21:36,647 INFO L85 PathProgramCache]: Analyzing trace with hash 786138194, now seen corresponding path program 2 times [2023-08-31 23:21:36,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:21:36,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454667269] [2023-08-31 23:21:36,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:21:36,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:21:36,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:21:36,699 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:21:36,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:21:36,785 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-31 23:21:36,787 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:21:36,789 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-31 23:21:36,791 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-31 23:21:36,791 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-31 23:21:36,791 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-31 23:21:36,792 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-31 23:21:36,792 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-31 23:21:36,792 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-31 23:21:36,792 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-31 23:21:36,792 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-31 23:21:36,793 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-31 23:21:36,793 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-31 23:21:36,793 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-31 23:21:36,793 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-31 23:21:36,793 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-31 23:21:36,794 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-31 23:21:36,794 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-31 23:21:36,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-31 23:21:36,794 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:21:36,800 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:21:36,801 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:21:36,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:21:36 BasicIcfg [2023-08-31 23:21:36,901 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:21:36,901 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:21:36,901 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:21:36,902 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:21:36,902 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:21:16" (3/4) ... [2023-08-31 23:21:36,904 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:21:36,904 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:21:36,905 INFO L158 Benchmark]: Toolchain (without parser) took 22216.40ms. Allocated memory was 81.8MB in the beginning and 1.6GB in the end (delta: 1.6GB). Free memory was 52.0MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 353.2MB. Max. memory is 16.1GB. [2023-08-31 23:21:36,905 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 56.6MB. Free memory was 34.4MB in the beginning and 34.3MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:21:36,906 INFO L158 Benchmark]: CACSL2BoogieTranslator took 513.19ms. Allocated memory is still 81.8MB. Free memory was 51.8MB in the beginning and 48.0MB in the end (delta: 3.8MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. [2023-08-31 23:21:36,906 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.77ms. Allocated memory is still 81.8MB. Free memory was 48.0MB in the beginning and 45.1MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-31 23:21:36,906 INFO L158 Benchmark]: Boogie Preprocessor took 39.64ms. Allocated memory is still 81.8MB. Free memory was 45.1MB in the beginning and 43.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:21:36,907 INFO L158 Benchmark]: RCFGBuilder took 739.03ms. Allocated memory is still 81.8MB. Free memory was 43.0MB in the beginning and 34.1MB in the end (delta: 8.9MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. [2023-08-31 23:21:36,907 INFO L158 Benchmark]: TraceAbstraction took 20854.38ms. Allocated memory was 81.8MB in the beginning and 1.6GB in the end (delta: 1.6GB). Free memory was 33.2MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 332.5MB. Max. memory is 16.1GB. [2023-08-31 23:21:36,907 INFO L158 Benchmark]: Witness Printer took 3.31ms. Allocated memory is still 1.6GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:21:36,910 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.19ms. Allocated memory is still 56.6MB. Free memory was 34.4MB in the beginning and 34.3MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 513.19ms. Allocated memory is still 81.8MB. Free memory was 51.8MB in the beginning and 48.0MB in the end (delta: 3.8MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.77ms. Allocated memory is still 81.8MB. Free memory was 48.0MB in the beginning and 45.1MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.64ms. Allocated memory is still 81.8MB. Free memory was 45.1MB in the beginning and 43.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 739.03ms. Allocated memory is still 81.8MB. Free memory was 43.0MB in the beginning and 34.1MB in the end (delta: 8.9MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. * TraceAbstraction took 20854.38ms. Allocated memory was 81.8MB in the beginning and 1.6GB in the end (delta: 1.6GB). Free memory was 33.2MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 332.5MB. Max. memory is 16.1GB. * Witness Printer took 3.31ms. Allocated memory is still 1.6GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.7s, 150 PlacesBefore, 52 PlacesAfterwards, 139 TransitionsBefore, 40 TransitionsAfterwards, 3258 CoEnabledTransitionPairs, 7 FixpointIterations, 53 TrivialSequentialCompositions, 74 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 136 TotalNumberOfCompositions, 8635 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2989, independent: 2770, independent conditional: 0, independent unconditional: 2770, dependent: 219, dependent conditional: 0, dependent unconditional: 219, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1641, independent: 1598, independent conditional: 0, independent unconditional: 1598, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2989, independent: 1172, independent conditional: 0, independent unconditional: 1172, dependent: 176, dependent conditional: 0, dependent unconditional: 176, unknown: 1641, unknown conditional: 0, unknown unconditional: 1641] , Statistics on independence cache: Total cache size (in pairs): 137, Positive cache size: 115, Positive conditional cache size: 0, Positive unconditional cache size: 115, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L848] 0 pthread_t t1133; [L849] FCALL, FORK 0 pthread_create(&t1133, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1133, ((void *)0), P0, ((void *)0))=-3, t1133={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L850] 0 pthread_t t1134; [L851] FCALL, FORK 0 pthread_create(&t1134, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1134, ((void *)0), P1, ((void *)0))=-2, t1133={5:0}, t1134={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L852] 0 pthread_t t1135; [L853] FCALL, FORK 0 pthread_create(&t1135, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1135, ((void *)0), P2, ((void *)0))=-1, t1133={5:0}, t1134={6:0}, t1135={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L854] 0 pthread_t t1136; [L855] FCALL, FORK 0 pthread_create(&t1136, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1136, ((void *)0), P3, ((void *)0))=0, t1133={5:0}, t1134={6:0}, t1135={7:0}, t1136={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L804] 4 z$w_buff1 = z$w_buff0 [L805] 4 z$w_buff0 = 2 [L806] 4 z$w_buff1_used = z$w_buff0_used [L807] 4 z$w_buff0_used = (_Bool)1 [L808] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L808] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L809] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L810] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L811] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L812] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L813] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L814] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L817] 4 a = 1 [L820] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L823] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L754] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L769] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L772] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L784] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L787] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L790] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L791] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L792] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L793] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L794] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L797] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 3 return 0; [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L826] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L827] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L828] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L829] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L830] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L833] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L835] 4 return 0; [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L862] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L863] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L864] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L865] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1133={5:0}, t1134={6:0}, t1135={7:0}, t1136={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L868] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L869] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L870] 0 z$flush_delayed = weak$$choice2 [L871] 0 z$mem_tmp = z [L872] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L873] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L874] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L875] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L876] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L878] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L880] 0 z = z$flush_delayed ? z$mem_tmp : z [L881] 0 z$flush_delayed = (_Bool)0 [L883] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 846]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 179 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 20.6s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 9.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1026 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 782 mSDsluCounter, 665 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 519 mSDsCounter, 135 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2660 IncrementalHoareTripleChecker+Invalid, 2795 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 135 mSolverCounterUnsat, 146 mSDtfsCounter, 2660 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=418occurred in iteration=11, InterpolantAutomatonStates: 82, 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.5s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 269 NumberOfCodeBlocks, 269 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 227 ConstructedInterpolants, 0 QuantifiedInterpolants, 1993 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-31 23:21:36,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix043.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8b566ddb7b309d9ba7ea7e298fcc3be9218751e5387d333007519a12118bc5db --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 23:21:39,054 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:21:39,056 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:21:39,090 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:21:39,092 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:21:39,094 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:21:39,096 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:21:39,099 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:21:39,101 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:21:39,104 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:21:39,105 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:21:39,107 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:21:39,108 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:21:39,112 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:21:39,113 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:21:39,114 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:21:39,115 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:21:39,116 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:21:39,119 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:21:39,121 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:21:39,131 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:21:39,135 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:21:39,136 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:21:39,136 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:21:39,139 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:21:39,140 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:21:39,140 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:21:39,141 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:21:39,141 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:21:39,142 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:21:39,142 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:21:39,143 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:21:39,143 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:21:39,144 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:21:39,145 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:21:39,145 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:21:39,145 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:21:39,146 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:21:39,146 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:21:39,147 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:21:39,147 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:21:39,156 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-31 23:21:39,191 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:21:39,191 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:21:39,192 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:21:39,192 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:21:39,193 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:21:39,193 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:21:39,194 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:21:39,194 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:21:39,194 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:21:39,195 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:21:39,196 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:21:39,196 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:21:39,196 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:21:39,196 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:21:39,196 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:21:39,197 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:21:39,197 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:21:39,197 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:21:39,197 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:21:39,197 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:21:39,197 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-31 23:21:39,198 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-31 23:21:39,198 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:21:39,198 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:21:39,198 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:21:39,198 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:21:39,199 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:21:39,199 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:21:39,199 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:21:39,199 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:21:39,199 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-31 23:21:39,200 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-31 23:21:39,200 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:21:39,200 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:21:39,200 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:21:39,201 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-31 23:21:39,201 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:21:39,201 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 -> 8b566ddb7b309d9ba7ea7e298fcc3be9218751e5387d333007519a12118bc5db Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-08-31 23:21:39,495 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:21:39,516 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:21:39,517 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:21:39,518 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:21:39,518 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:21:39,519 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix043.opt.i [2023-08-31 23:21:40,754 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:21:41,030 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:21:41,031 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix043.opt.i [2023-08-31 23:21:41,045 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27b812734/1435e0640bb74dc38d9fe761795ecee7/FLAG7624eeea0 [2023-08-31 23:21:41,062 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27b812734/1435e0640bb74dc38d9fe761795ecee7 [2023-08-31 23:21:41,064 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:21:41,066 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:21:41,067 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:21:41,067 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:21:41,070 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:21:41,070 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:21:41" (1/1) ... [2023-08-31 23:21:41,071 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c84338 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:21:41, skipping insertion in model container [2023-08-31 23:21:41,071 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:21:41" (1/1) ... [2023-08-31 23:21:41,077 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:21:41,136 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:21:41,303 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix043.opt.i[944,957] [2023-08-31 23:21:41,529 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:21:41,544 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:21:41,554 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix043.opt.i[944,957] [2023-08-31 23:21:41,591 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:21:41,641 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:21:41,642 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:21:41,647 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:21:41,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:21:41 WrapperNode [2023-08-31 23:21:41,648 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:21:41,649 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:21:41,649 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:21:41,649 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:21:41,655 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:21:41" (1/1) ... [2023-08-31 23:21:41,689 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:21:41" (1/1) ... [2023-08-31 23:21:41,725 INFO L138 Inliner]: procedures = 180, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 170 [2023-08-31 23:21:41,725 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:21:41,726 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:21:41,726 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:21:41,726 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:21:41,735 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:21:41" (1/1) ... [2023-08-31 23:21:41,735 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:21:41" (1/1) ... [2023-08-31 23:21:41,744 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:21:41" (1/1) ... [2023-08-31 23:21:41,744 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:21:41" (1/1) ... [2023-08-31 23:21:41,752 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:21:41" (1/1) ... [2023-08-31 23:21:41,754 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:21:41" (1/1) ... [2023-08-31 23:21:41,756 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:21:41" (1/1) ... [2023-08-31 23:21:41,758 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:21:41" (1/1) ... [2023-08-31 23:21:41,761 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:21:41,762 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:21:41,762 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:21:41,762 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:21:41,763 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:21:41" (1/1) ... [2023-08-31 23:21:41,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:21:41,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:21:41,797 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-31 23:21:41,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-31 23:21:41,826 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:21:41,826 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:21:41,826 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:21:41,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:21:41,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-31 23:21:41,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-31 23:21:41,826 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:21:41,826 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:21:41,827 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:21:41,827 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:21:41,827 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-31 23:21:41,827 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-31 23:21:41,827 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-31 23:21:41,827 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-31 23:21:41,827 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:21:41,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:21:41,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:21:41,829 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 23:21:41,962 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:21:41,964 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:21:42,424 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:21:42,533 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:21:42,533 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:21:42,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:21:42 BoogieIcfgContainer [2023-08-31 23:21:42,535 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:21:42,537 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:21:42,537 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:21:42,540 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:21:42,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:21:41" (1/3) ... [2023-08-31 23:21:42,540 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6221d856 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:21:42, skipping insertion in model container [2023-08-31 23:21:42,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:21:41" (2/3) ... [2023-08-31 23:21:42,541 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6221d856 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:21:42, skipping insertion in model container [2023-08-31 23:21:42,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:21:42" (3/3) ... [2023-08-31 23:21:42,542 INFO L112 eAbstractionObserver]: Analyzing ICFG mix043.opt.i [2023-08-31 23:21:42,556 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:21:42,557 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-31 23:21:42,557 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:21:42,630 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:21:42,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 144 transitions, 308 flow [2023-08-31 23:21:42,744 INFO L130 PetriNetUnfolder]: 2/140 cut-off events. [2023-08-31 23:21:42,745 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:21:42,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 140 events. 2/140 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 104 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2023-08-31 23:21:42,750 INFO L82 GeneralOperation]: Start removeDead. Operand has 155 places, 144 transitions, 308 flow [2023-08-31 23:21:42,758 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 151 places, 140 transitions, 292 flow [2023-08-31 23:21:42,761 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:21:42,772 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 140 transitions, 292 flow [2023-08-31 23:21:42,775 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 151 places, 140 transitions, 292 flow [2023-08-31 23:21:42,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 140 transitions, 292 flow [2023-08-31 23:21:42,826 INFO L130 PetriNetUnfolder]: 2/140 cut-off events. [2023-08-31 23:21:42,826 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:21:42,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 140 events. 2/140 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 104 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2023-08-31 23:21:42,831 INFO L119 LiptonReduction]: Number of co-enabled transitions 3258 [2023-08-31 23:21:50,295 INFO L134 LiptonReduction]: Checked pairs total: 8636 [2023-08-31 23:21:50,296 INFO L136 LiptonReduction]: Total number of compositions: 133 [2023-08-31 23:21:50,308 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:21:50,313 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@137410e5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:21:50,313 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-31 23:21:50,315 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-31 23:21:50,315 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:21:50,315 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:21:50,316 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:21:50,316 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:21:50,320 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:21:50,320 INFO L85 PathProgramCache]: Analyzing trace with hash 589, now seen corresponding path program 1 times [2023-08-31 23:21:50,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:21:50,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [833294315] [2023-08-31 23:21:50,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:21:50,331 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:21:50,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:21:50,333 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:21:50,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-08-31 23:21:50,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:21:50,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-31 23:21:50,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:21:50,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:21:50,412 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:21:50,412 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:21:50,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [833294315] [2023-08-31 23:21:50,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [833294315] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:21:50,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:21:50,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:21:50,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164654891] [2023-08-31 23:21:50,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:21:50,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:21:50,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:21:50,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:21:50,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:21:50,443 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 277 [2023-08-31 23:21:50,445 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 92 flow. Second operand has 2 states, 2 states have (on average 131.5) internal successors, (263), 2 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:50,445 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:21:50,445 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 277 [2023-08-31 23:21:50,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:21:51,319 INFO L130 PetriNetUnfolder]: 5003/6961 cut-off events. [2023-08-31 23:21:51,320 INFO L131 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2023-08-31 23:21:51,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13893 conditions, 6961 events. 5003/6961 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 36617 event pairs, 5003 based on Foata normal form. 216/6165 useless extension candidates. Maximal degree in co-relation 13881. Up to 6829 conditions per place. [2023-08-31 23:21:51,368 INFO L137 encePairwiseOnDemand]: 268/277 looper letters, 27 selfloop transitions, 0 changer transitions 0/31 dead transitions. [2023-08-31 23:21:51,369 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 31 transitions, 128 flow [2023-08-31 23:21:51,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:21:51,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:21:51,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 298 transitions. [2023-08-31 23:21:51,386 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5379061371841155 [2023-08-31 23:21:51,386 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 298 transitions. [2023-08-31 23:21:51,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 298 transitions. [2023-08-31 23:21:51,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:21:51,391 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 298 transitions. [2023-08-31 23:21:51,398 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 149.0) internal successors, (298), 2 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:51,403 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 277.0) internal successors, (831), 3 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:51,404 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 277.0) internal successors, (831), 3 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:51,406 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 92 flow. Second operand 2 states and 298 transitions. [2023-08-31 23:21:51,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 31 transitions, 128 flow [2023-08-31 23:21:51,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 31 transitions, 124 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-31 23:21:51,414 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 70 flow [2023-08-31 23:21:51,416 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=70, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2023-08-31 23:21:51,420 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -11 predicate places. [2023-08-31 23:21:51,420 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 70 flow [2023-08-31 23:21:51,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 131.5) internal successors, (263), 2 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:51,422 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:21:51,422 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:21:51,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-08-31 23:21:51,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:21:51,634 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:21:51,634 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:21:51,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1047798639, now seen corresponding path program 1 times [2023-08-31 23:21:51,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:21:51,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1906616469] [2023-08-31 23:21:51,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:21:51,636 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:21:51,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:21:51,641 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:21:51,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-08-31 23:21:51,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:21:51,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:21:51,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:21:51,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:21:51,782 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:21:51,782 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:21:51,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1906616469] [2023-08-31 23:21:51,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1906616469] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:21:51,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:21:51,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:21:51,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075543006] [2023-08-31 23:21:51,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:21:51,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:21:51,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:21:51,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:21:51,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:21:51,789 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 277 [2023-08-31 23:21:51,790 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:51,790 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:21:51,790 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 277 [2023-08-31 23:21:51,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:21:52,383 INFO L130 PetriNetUnfolder]: 4151/6001 cut-off events. [2023-08-31 23:21:52,383 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:21:52,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11790 conditions, 6001 events. 4151/6001 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 33545 event pairs, 743 based on Foata normal form. 0/5448 useless extension candidates. Maximal degree in co-relation 11787. Up to 4561 conditions per place. [2023-08-31 23:21:52,414 INFO L137 encePairwiseOnDemand]: 274/277 looper letters, 34 selfloop transitions, 2 changer transitions 4/44 dead transitions. [2023-08-31 23:21:52,414 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 44 transitions, 176 flow [2023-08-31 23:21:52,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:21:52,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:21:52,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 431 transitions. [2023-08-31 23:21:52,417 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5186522262334536 [2023-08-31 23:21:52,417 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 431 transitions. [2023-08-31 23:21:52,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 431 transitions. [2023-08-31 23:21:52,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:21:52,418 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 431 transitions. [2023-08-31 23:21:52,419 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:52,422 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 277.0) internal successors, (1108), 4 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:52,423 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 277.0) internal successors, (1108), 4 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:52,423 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 70 flow. Second operand 3 states and 431 transitions. [2023-08-31 23:21:52,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 44 transitions, 176 flow [2023-08-31 23:21:52,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 44 transitions, 176 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:21:52,425 INFO L231 Difference]: Finished difference. Result has 42 places, 28 transitions, 68 flow [2023-08-31 23:21:52,425 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=42, PETRI_TRANSITIONS=28} [2023-08-31 23:21:52,426 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -10 predicate places. [2023-08-31 23:21:52,426 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 28 transitions, 68 flow [2023-08-31 23:21:52,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:52,427 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:21:52,427 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:21:52,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-08-31 23:21:52,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:21:52,655 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:21:52,656 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:21:52,656 INFO L85 PathProgramCache]: Analyzing trace with hash -849859600, now seen corresponding path program 1 times [2023-08-31 23:21:52,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:21:52,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2088471118] [2023-08-31 23:21:52,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:21:52,657 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:21:52,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:21:52,662 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:21:52,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-08-31 23:21:52,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:21:52,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:21:52,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:21:52,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-31 23:21:52,780 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:21:52,780 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:21:52,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2088471118] [2023-08-31 23:21:52,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2088471118] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:21:52,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:21:52,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:21:52,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609354771] [2023-08-31 23:21:52,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:21:52,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:21:52,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:21:52,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:21:52,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:21:52,793 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 277 [2023-08-31 23:21:52,794 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 28 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:52,794 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:21:52,794 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 277 [2023-08-31 23:21:52,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:21:53,186 INFO L130 PetriNetUnfolder]: 2153/3115 cut-off events. [2023-08-31 23:21:53,187 INFO L131 PetriNetUnfolder]: For 144/144 co-relation queries the response was YES. [2023-08-31 23:21:53,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6464 conditions, 3115 events. 2153/3115 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 15275 event pairs, 479 based on Foata normal form. 48/3024 useless extension candidates. Maximal degree in co-relation 6460. Up to 2887 conditions per place. [2023-08-31 23:21:53,208 INFO L137 encePairwiseOnDemand]: 271/277 looper letters, 36 selfloop transitions, 5 changer transitions 0/45 dead transitions. [2023-08-31 23:21:53,208 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 45 transitions, 192 flow [2023-08-31 23:21:53,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:21:53,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:21:53,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 420 transitions. [2023-08-31 23:21:53,211 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5054151624548736 [2023-08-31 23:21:53,211 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 420 transitions. [2023-08-31 23:21:53,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 420 transitions. [2023-08-31 23:21:53,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:21:53,212 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 420 transitions. [2023-08-31 23:21:53,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:53,215 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 277.0) internal successors, (1108), 4 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:53,216 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 277.0) internal successors, (1108), 4 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:53,216 INFO L175 Difference]: Start difference. First operand has 42 places, 28 transitions, 68 flow. Second operand 3 states and 420 transitions. [2023-08-31 23:21:53,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 45 transitions, 192 flow [2023-08-31 23:21:53,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 45 transitions, 186 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:21:53,219 INFO L231 Difference]: Finished difference. Result has 41 places, 32 transitions, 97 flow [2023-08-31 23:21:53,219 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=97, PETRI_PLACES=41, PETRI_TRANSITIONS=32} [2023-08-31 23:21:53,220 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -11 predicate places. [2023-08-31 23:21:53,221 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 32 transitions, 97 flow [2023-08-31 23:21:53,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:53,221 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:21:53,222 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:21:53,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-08-31 23:21:53,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:21:53,437 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:21:53,437 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:21:53,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1837441569, now seen corresponding path program 1 times [2023-08-31 23:21:53,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:21:53,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1583654861] [2023-08-31 23:21:53,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:21:53,438 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:21:53,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:21:53,439 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:21:53,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-08-31 23:21:53,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:21:53,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:21:53,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:21:53,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:21:53,573 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:21:53,573 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:21:53,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1583654861] [2023-08-31 23:21:53,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1583654861] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:21:53,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:21:53,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:21:53,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454114652] [2023-08-31 23:21:53,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:21:53,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:21:53,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:21:53,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:21:53,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:21:53,591 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 277 [2023-08-31 23:21:53,592 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 97 flow. Second operand has 4 states, 4 states have (on average 129.5) internal successors, (518), 4 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:53,592 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:21:53,592 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 277 [2023-08-31 23:21:53,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:21:53,841 INFO L130 PetriNetUnfolder]: 1013/1595 cut-off events. [2023-08-31 23:21:53,841 INFO L131 PetriNetUnfolder]: For 233/233 co-relation queries the response was YES. [2023-08-31 23:21:53,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3909 conditions, 1595 events. 1013/1595 cut-off events. For 233/233 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 7415 event pairs, 185 based on Foata normal form. 76/1608 useless extension candidates. Maximal degree in co-relation 3904. Up to 1027 conditions per place. [2023-08-31 23:21:53,851 INFO L137 encePairwiseOnDemand]: 271/277 looper letters, 47 selfloop transitions, 9 changer transitions 0/60 dead transitions. [2023-08-31 23:21:53,852 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 60 transitions, 283 flow [2023-08-31 23:21:53,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:21:53,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:21:53,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 561 transitions. [2023-08-31 23:21:53,854 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5063176895306859 [2023-08-31 23:21:53,854 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 561 transitions. [2023-08-31 23:21:53,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 561 transitions. [2023-08-31 23:21:53,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:21:53,855 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 561 transitions. [2023-08-31 23:21:53,856 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.25) internal successors, (561), 4 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:53,858 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 277.0) internal successors, (1385), 5 states have internal predecessors, (1385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:53,859 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 277.0) internal successors, (1385), 5 states have internal predecessors, (1385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:53,859 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 97 flow. Second operand 4 states and 561 transitions. [2023-08-31 23:21:53,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 60 transitions, 283 flow [2023-08-31 23:21:53,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 60 transitions, 278 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:21:53,861 INFO L231 Difference]: Finished difference. Result has 44 places, 36 transitions, 144 flow [2023-08-31 23:21:53,861 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=144, PETRI_PLACES=44, PETRI_TRANSITIONS=36} [2023-08-31 23:21:53,862 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -8 predicate places. [2023-08-31 23:21:53,862 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 36 transitions, 144 flow [2023-08-31 23:21:53,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 129.5) internal successors, (518), 4 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:53,863 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:21:53,863 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:21:53,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-08-31 23:21:54,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:21:54,073 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:21:54,073 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:21:54,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1267846691, now seen corresponding path program 1 times [2023-08-31 23:21:54,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:21:54,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [953918761] [2023-08-31 23:21:54,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:21:54,074 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:21:54,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:21:54,075 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:21:54,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-08-31 23:21:54,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:21:54,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-31 23:21:54,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:21:54,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:21:54,204 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:21:54,204 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:21:54,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [953918761] [2023-08-31 23:21:54,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [953918761] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:21:54,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:21:54,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:21:54,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701749607] [2023-08-31 23:21:54,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:21:54,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:21:54,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:21:54,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:21:54,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:21:54,218 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 277 [2023-08-31 23:21:54,219 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 36 transitions, 144 flow. Second operand has 5 states, 5 states have (on average 129.2) internal successors, (646), 5 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:54,219 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:21:54,219 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 277 [2023-08-31 23:21:54,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:21:54,464 INFO L130 PetriNetUnfolder]: 573/935 cut-off events. [2023-08-31 23:21:54,465 INFO L131 PetriNetUnfolder]: For 696/696 co-relation queries the response was YES. [2023-08-31 23:21:54,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2697 conditions, 935 events. 573/935 cut-off events. For 696/696 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3939 event pairs, 124 based on Foata normal form. 44/960 useless extension candidates. Maximal degree in co-relation 2691. Up to 340 conditions per place. [2023-08-31 23:21:54,472 INFO L137 encePairwiseOnDemand]: 271/277 looper letters, 56 selfloop transitions, 13 changer transitions 0/73 dead transitions. [2023-08-31 23:21:54,472 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 73 transitions, 384 flow [2023-08-31 23:21:54,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:21:54,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:21:54,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 700 transitions. [2023-08-31 23:21:54,475 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5054151624548736 [2023-08-31 23:21:54,475 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 700 transitions. [2023-08-31 23:21:54,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 700 transitions. [2023-08-31 23:21:54,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:21:54,476 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 700 transitions. [2023-08-31 23:21:54,477 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 140.0) internal successors, (700), 5 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:54,480 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 277.0) internal successors, (1662), 6 states have internal predecessors, (1662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:54,480 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 277.0) internal successors, (1662), 6 states have internal predecessors, (1662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:54,481 INFO L175 Difference]: Start difference. First operand has 44 places, 36 transitions, 144 flow. Second operand 5 states and 700 transitions. [2023-08-31 23:21:54,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 73 transitions, 384 flow [2023-08-31 23:21:54,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 73 transitions, 366 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-31 23:21:54,484 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 194 flow [2023-08-31 23:21:54,485 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=194, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2023-08-31 23:21:54,485 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -5 predicate places. [2023-08-31 23:21:54,485 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 194 flow [2023-08-31 23:21:54,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 129.2) internal successors, (646), 5 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:54,486 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:21:54,486 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:21:54,501 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-31 23:21:54,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:21:54,696 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:21:54,696 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:21:54,697 INFO L85 PathProgramCache]: Analyzing trace with hash 927528444, now seen corresponding path program 1 times [2023-08-31 23:21:54,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:21:54,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1641546467] [2023-08-31 23:21:54,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:21:54,697 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:21:54,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:21:54,698 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:21:54,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-08-31 23:21:54,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:21:54,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-31 23:21:54,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:21:54,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:21:54,874 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:21:54,874 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:21:54,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1641546467] [2023-08-31 23:21:54,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1641546467] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:21:54,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:21:54,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:21:54,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401363353] [2023-08-31 23:21:54,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:21:54,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:21:54,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:21:54,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:21:54,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:21:54,892 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 277 [2023-08-31 23:21:54,894 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 194 flow. Second operand has 6 states, 6 states have (on average 129.16666666666666) internal successors, (775), 6 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:54,894 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:21:54,894 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 277 [2023-08-31 23:21:54,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:21:55,195 INFO L130 PetriNetUnfolder]: 518/825 cut-off events. [2023-08-31 23:21:55,196 INFO L131 PetriNetUnfolder]: For 807/807 co-relation queries the response was YES. [2023-08-31 23:21:55,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2497 conditions, 825 events. 518/825 cut-off events. For 807/807 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3462 event pairs, 119 based on Foata normal form. 11/828 useless extension candidates. Maximal degree in co-relation 2490. Up to 340 conditions per place. [2023-08-31 23:21:55,201 INFO L137 encePairwiseOnDemand]: 271/277 looper letters, 52 selfloop transitions, 17 changer transitions 0/73 dead transitions. [2023-08-31 23:21:55,201 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 73 transitions, 410 flow [2023-08-31 23:21:55,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:21:55,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:21:55,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 826 transitions. [2023-08-31 23:21:55,204 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4969915764139591 [2023-08-31 23:21:55,204 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 826 transitions. [2023-08-31 23:21:55,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 826 transitions. [2023-08-31 23:21:55,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:21:55,205 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 826 transitions. [2023-08-31 23:21:55,206 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 137.66666666666666) internal successors, (826), 6 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:55,209 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 277.0) internal successors, (1939), 7 states have internal predecessors, (1939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:55,209 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 277.0) internal successors, (1939), 7 states have internal predecessors, (1939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:55,209 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 194 flow. Second operand 6 states and 826 transitions. [2023-08-31 23:21:55,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 73 transitions, 410 flow [2023-08-31 23:21:55,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 73 transitions, 376 flow, removed 8 selfloop flow, removed 3 redundant places. [2023-08-31 23:21:55,217 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 204 flow [2023-08-31 23:21:55,217 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=204, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2023-08-31 23:21:55,218 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -2 predicate places. [2023-08-31 23:21:55,218 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 204 flow [2023-08-31 23:21:55,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 129.16666666666666) internal successors, (775), 6 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:55,219 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:21:55,219 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:21:55,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-08-31 23:21:55,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:21:55,429 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:21:55,429 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:21:55,429 INFO L85 PathProgramCache]: Analyzing trace with hash -573623205, now seen corresponding path program 1 times [2023-08-31 23:21:55,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:21:55,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [471436704] [2023-08-31 23:21:55,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:21:55,430 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:21:55,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:21:55,431 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:21:55,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-08-31 23:21:55,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:21:55,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:21:55,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:21:55,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-31 23:21:55,956 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:21:55,956 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:21:55,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [471436704] [2023-08-31 23:21:55,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [471436704] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:21:55,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:21:55,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:21:55,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021366266] [2023-08-31 23:21:55,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:21:55,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:21:55,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:21:55,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:21:55,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:21:55,971 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 277 [2023-08-31 23:21:55,971 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 204 flow. Second operand has 5 states, 5 states have (on average 128.8) internal successors, (644), 5 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:55,972 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:21:55,972 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 277 [2023-08-31 23:21:55,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:21:56,230 INFO L130 PetriNetUnfolder]: 707/1200 cut-off events. [2023-08-31 23:21:56,230 INFO L131 PetriNetUnfolder]: For 1765/1765 co-relation queries the response was YES. [2023-08-31 23:21:56,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3615 conditions, 1200 events. 707/1200 cut-off events. For 1765/1765 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 6192 event pairs, 115 based on Foata normal form. 0/1195 useless extension candidates. Maximal degree in co-relation 3607. Up to 653 conditions per place. [2023-08-31 23:21:56,239 INFO L137 encePairwiseOnDemand]: 273/277 looper letters, 80 selfloop transitions, 3 changer transitions 0/86 dead transitions. [2023-08-31 23:21:56,239 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 86 transitions, 631 flow [2023-08-31 23:21:56,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:21:56,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:21:56,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 674 transitions. [2023-08-31 23:21:56,242 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4866425992779783 [2023-08-31 23:21:56,242 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 674 transitions. [2023-08-31 23:21:56,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 674 transitions. [2023-08-31 23:21:56,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:21:56,243 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 674 transitions. [2023-08-31 23:21:56,244 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.8) internal successors, (674), 5 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:56,246 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 277.0) internal successors, (1662), 6 states have internal predecessors, (1662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:56,246 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 277.0) internal successors, (1662), 6 states have internal predecessors, (1662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:56,246 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 204 flow. Second operand 5 states and 674 transitions. [2023-08-31 23:21:56,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 86 transitions, 631 flow [2023-08-31 23:21:56,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 86 transitions, 518 flow, removed 24 selfloop flow, removed 4 redundant places. [2023-08-31 23:21:56,257 INFO L231 Difference]: Finished difference. Result has 53 places, 42 transitions, 175 flow [2023-08-31 23:21:56,257 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=175, PETRI_PLACES=53, PETRI_TRANSITIONS=42} [2023-08-31 23:21:56,257 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 1 predicate places. [2023-08-31 23:21:56,258 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 42 transitions, 175 flow [2023-08-31 23:21:56,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 128.8) internal successors, (644), 5 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:56,258 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:21:56,258 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:21:56,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-08-31 23:21:56,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:21:56,468 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:21:56,469 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:21:56,469 INFO L85 PathProgramCache]: Analyzing trace with hash -972485627, now seen corresponding path program 2 times [2023-08-31 23:21:56,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:21:56,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [495740760] [2023-08-31 23:21:56,469 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 23:21:56,470 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:21:56,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:21:56,471 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:21:56,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-08-31 23:21:56,581 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-31 23:21:56,581 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:21:56,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:21:56,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:21:56,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:21:56,669 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:21:56,669 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:21:56,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [495740760] [2023-08-31 23:21:56,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [495740760] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:21:56,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:21:56,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:21:56,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32364408] [2023-08-31 23:21:56,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:21:56,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:21:56,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:21:56,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:21:56,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:21:56,693 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 277 [2023-08-31 23:21:56,694 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 42 transitions, 175 flow. Second operand has 5 states, 5 states have (on average 128.8) internal successors, (644), 5 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:56,694 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:21:56,694 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 277 [2023-08-31 23:21:56,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:21:57,040 INFO L130 PetriNetUnfolder]: 1178/1914 cut-off events. [2023-08-31 23:21:57,040 INFO L131 PetriNetUnfolder]: For 1606/1606 co-relation queries the response was YES. [2023-08-31 23:21:57,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5506 conditions, 1914 events. 1178/1914 cut-off events. For 1606/1606 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 10106 event pairs, 271 based on Foata normal form. 1/1901 useless extension candidates. Maximal degree in co-relation 5495. Up to 951 conditions per place. [2023-08-31 23:21:57,051 INFO L137 encePairwiseOnDemand]: 273/277 looper letters, 84 selfloop transitions, 4 changer transitions 0/92 dead transitions. [2023-08-31 23:21:57,051 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 92 transitions, 568 flow [2023-08-31 23:21:57,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:21:57,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:21:57,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 677 transitions. [2023-08-31 23:21:57,054 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4888086642599278 [2023-08-31 23:21:57,054 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 677 transitions. [2023-08-31 23:21:57,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 677 transitions. [2023-08-31 23:21:57,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:21:57,054 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 677 transitions. [2023-08-31 23:21:57,056 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.4) internal successors, (677), 5 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-31 23:21:57,058 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 277.0) internal successors, (1662), 6 states have internal predecessors, (1662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:57,058 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 277.0) internal successors, (1662), 6 states have internal predecessors, (1662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:57,058 INFO L175 Difference]: Start difference. First operand has 53 places, 42 transitions, 175 flow. Second operand 5 states and 677 transitions. [2023-08-31 23:21:57,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 92 transitions, 568 flow [2023-08-31 23:21:57,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 92 transitions, 566 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:21:57,078 INFO L231 Difference]: Finished difference. Result has 59 places, 45 transitions, 209 flow [2023-08-31 23:21:57,078 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=209, PETRI_PLACES=59, PETRI_TRANSITIONS=45} [2023-08-31 23:21:57,078 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 7 predicate places. [2023-08-31 23:21:57,079 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 45 transitions, 209 flow [2023-08-31 23:21:57,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 128.8) internal successors, (644), 5 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:57,079 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:21:57,079 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:21:57,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-08-31 23:21:57,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:21:57,290 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:21:57,290 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:21:57,290 INFO L85 PathProgramCache]: Analyzing trace with hash 33174594, now seen corresponding path program 1 times [2023-08-31 23:21:57,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:21:57,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1920416918] [2023-08-31 23:21:57,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:21:57,291 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:21:57,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:21:57,292 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:21:57,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-08-31 23:21:57,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:21:57,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-31 23:21:57,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:21:58,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:21:58,084 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:21:58,084 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:21:58,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1920416918] [2023-08-31 23:21:58,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1920416918] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:21:58,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:21:58,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:21:58,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607950789] [2023-08-31 23:21:58,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:21:58,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:21:58,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:21:58,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:21:58,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:21:58,475 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 277 [2023-08-31 23:21:58,476 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 45 transitions, 209 flow. Second operand has 6 states, 6 states have (on average 114.83333333333333) internal successors, (689), 6 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:58,476 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:21:58,476 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 277 [2023-08-31 23:21:58,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:21:58,894 INFO L130 PetriNetUnfolder]: 942/1558 cut-off events. [2023-08-31 23:21:58,894 INFO L131 PetriNetUnfolder]: For 2029/2032 co-relation queries the response was YES. [2023-08-31 23:21:58,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4818 conditions, 1558 events. 942/1558 cut-off events. For 2029/2032 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 8608 event pairs, 70 based on Foata normal form. 5/1525 useless extension candidates. Maximal degree in co-relation 4804. Up to 1293 conditions per place. [2023-08-31 23:21:58,901 INFO L137 encePairwiseOnDemand]: 272/277 looper letters, 34 selfloop transitions, 4 changer transitions 23/65 dead transitions. [2023-08-31 23:21:58,901 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 65 transitions, 435 flow [2023-08-31 23:21:58,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:21:58,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:21:58,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 703 transitions. [2023-08-31 23:21:58,904 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4229843561973526 [2023-08-31 23:21:58,904 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 703 transitions. [2023-08-31 23:21:58,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 703 transitions. [2023-08-31 23:21:58,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:21:58,905 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 703 transitions. [2023-08-31 23:21:58,906 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 117.16666666666667) internal successors, (703), 6 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:58,908 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 277.0) internal successors, (1939), 7 states have internal predecessors, (1939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:58,909 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 277.0) internal successors, (1939), 7 states have internal predecessors, (1939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:58,909 INFO L175 Difference]: Start difference. First operand has 59 places, 45 transitions, 209 flow. Second operand 6 states and 703 transitions. [2023-08-31 23:21:58,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 65 transitions, 435 flow [2023-08-31 23:21:58,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 65 transitions, 432 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:21:58,919 INFO L231 Difference]: Finished difference. Result has 62 places, 39 transitions, 176 flow [2023-08-31 23:21:58,919 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=176, PETRI_PLACES=62, PETRI_TRANSITIONS=39} [2023-08-31 23:21:58,919 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 10 predicate places. [2023-08-31 23:21:58,920 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 39 transitions, 176 flow [2023-08-31 23:21:58,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.83333333333333) internal successors, (689), 6 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:58,920 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:21:58,920 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:21:58,935 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-31 23:21:59,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:21:59,131 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:21:59,131 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:21:59,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1179114087, now seen corresponding path program 3 times [2023-08-31 23:21:59,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:21:59,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1544688119] [2023-08-31 23:21:59,131 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 23:21:59,132 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:21:59,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:21:59,132 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:21:59,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-08-31 23:21:59,240 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-31 23:21:59,240 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:21:59,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:21:59,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:21:59,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:21:59,499 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:21:59,499 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:21:59,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1544688119] [2023-08-31 23:21:59,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1544688119] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:21:59,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:21:59,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:21:59,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715707193] [2023-08-31 23:21:59,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:21:59,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:21:59,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:21:59,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:21:59,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:21:59,515 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 277 [2023-08-31 23:21:59,516 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 39 transitions, 176 flow. Second operand has 5 states, 5 states have (on average 128.8) internal successors, (644), 5 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:59,516 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:21:59,516 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 277 [2023-08-31 23:21:59,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:21:59,812 INFO L130 PetriNetUnfolder]: 1188/1975 cut-off events. [2023-08-31 23:21:59,812 INFO L131 PetriNetUnfolder]: For 1596/1597 co-relation queries the response was YES. [2023-08-31 23:21:59,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5858 conditions, 1975 events. 1188/1975 cut-off events. For 1596/1597 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 10652 event pairs, 204 based on Foata normal form. 1/1929 useless extension candidates. Maximal degree in co-relation 5844. Up to 1000 conditions per place. [2023-08-31 23:21:59,818 INFO L137 encePairwiseOnDemand]: 273/277 looper letters, 45 selfloop transitions, 1 changer transitions 33/82 dead transitions. [2023-08-31 23:21:59,818 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 82 transitions, 538 flow [2023-08-31 23:21:59,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:21:59,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:21:59,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 670 transitions. [2023-08-31 23:21:59,821 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48375451263537905 [2023-08-31 23:21:59,821 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 670 transitions. [2023-08-31 23:21:59,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 670 transitions. [2023-08-31 23:21:59,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:21:59,821 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 670 transitions. [2023-08-31 23:21:59,823 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.0) internal successors, (670), 5 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:59,825 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 277.0) internal successors, (1662), 6 states have internal predecessors, (1662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:59,826 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 277.0) internal successors, (1662), 6 states have internal predecessors, (1662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:59,826 INFO L175 Difference]: Start difference. First operand has 62 places, 39 transitions, 176 flow. Second operand 5 states and 670 transitions. [2023-08-31 23:21:59,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 82 transitions, 538 flow [2023-08-31 23:21:59,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 82 transitions, 517 flow, removed 6 selfloop flow, removed 8 redundant places. [2023-08-31 23:21:59,841 INFO L231 Difference]: Finished difference. Result has 57 places, 39 transitions, 170 flow [2023-08-31 23:21:59,842 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=170, PETRI_PLACES=57, PETRI_TRANSITIONS=39} [2023-08-31 23:21:59,843 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 5 predicate places. [2023-08-31 23:21:59,843 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 39 transitions, 170 flow [2023-08-31 23:21:59,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 128.8) internal successors, (644), 5 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:21:59,843 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:21:59,844 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:21:59,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-08-31 23:22:00,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:22:00,054 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:22:00,054 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:22:00,054 INFO L85 PathProgramCache]: Analyzing trace with hash -146835999, now seen corresponding path program 4 times [2023-08-31 23:22:00,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:22:00,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1271609659] [2023-08-31 23:22:00,054 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-31 23:22:00,055 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:22:00,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:22:00,055 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:22:00,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-08-31 23:22:00,162 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-31 23:22:00,162 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-31 23:22:00,163 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:22:00,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:22:00,284 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-31 23:22:00,284 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:22:00,285 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-31 23:22:00,287 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-31 23:22:00,287 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-31 23:22:00,287 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-31 23:22:00,287 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-31 23:22:00,288 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-31 23:22:00,288 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-31 23:22:00,288 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-31 23:22:00,288 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-31 23:22:00,288 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-31 23:22:00,288 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-31 23:22:00,289 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-31 23:22:00,289 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-31 23:22:00,289 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-31 23:22:00,289 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-31 23:22:00,289 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-31 23:22:00,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-08-31 23:22:00,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:22:00,501 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:22:00,505 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:22:00,505 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:22:00,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:22:00 BasicIcfg [2023-08-31 23:22:00,584 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:22:00,584 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:22:00,584 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:22:00,584 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:22:00,585 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:21:42" (3/4) ... [2023-08-31 23:22:00,587 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:22:00,587 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:22:00,588 INFO L158 Benchmark]: Toolchain (without parser) took 19522.21ms. Allocated memory was 86.0MB in the beginning and 499.1MB in the end (delta: 413.1MB). Free memory was 62.8MB in the beginning and 350.9MB in the end (delta: -288.1MB). Peak memory consumption was 127.9MB. Max. memory is 16.1GB. [2023-08-31 23:22:00,588 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 71.3MB. Free memory is still 49.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:22:00,588 INFO L158 Benchmark]: CACSL2BoogieTranslator took 581.58ms. Allocated memory is still 86.0MB. Free memory was 62.8MB in the beginning and 60.0MB in the end (delta: 2.8MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. [2023-08-31 23:22:00,589 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.06ms. Allocated memory is still 86.0MB. Free memory was 60.0MB in the beginning and 57.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:22:00,589 INFO L158 Benchmark]: Boogie Preprocessor took 35.41ms. Allocated memory is still 86.0MB. Free memory was 57.3MB in the beginning and 54.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:22:00,589 INFO L158 Benchmark]: RCFGBuilder took 773.25ms. Allocated memory is still 86.0MB. Free memory was 54.9MB in the beginning and 57.8MB in the end (delta: -2.9MB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. [2023-08-31 23:22:00,590 INFO L158 Benchmark]: TraceAbstraction took 18046.87ms. Allocated memory was 86.0MB in the beginning and 499.1MB in the end (delta: 413.1MB). Free memory was 57.4MB in the beginning and 350.9MB in the end (delta: -293.5MB). Peak memory consumption was 120.3MB. Max. memory is 16.1GB. [2023-08-31 23:22:00,590 INFO L158 Benchmark]: Witness Printer took 3.20ms. Allocated memory is still 499.1MB. Free memory is still 350.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:22:00,591 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 71.3MB. Free memory is still 49.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 581.58ms. Allocated memory is still 86.0MB. Free memory was 62.8MB in the beginning and 60.0MB in the end (delta: 2.8MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.06ms. Allocated memory is still 86.0MB. Free memory was 60.0MB in the beginning and 57.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.41ms. Allocated memory is still 86.0MB. Free memory was 57.3MB in the beginning and 54.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 773.25ms. Allocated memory is still 86.0MB. Free memory was 54.9MB in the beginning and 57.8MB in the end (delta: -2.9MB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. * TraceAbstraction took 18046.87ms. Allocated memory was 86.0MB in the beginning and 499.1MB in the end (delta: 413.1MB). Free memory was 57.4MB in the beginning and 350.9MB in the end (delta: -293.5MB). Peak memory consumption was 120.3MB. Max. memory is 16.1GB. * Witness Printer took 3.20ms. Allocated memory is still 499.1MB. Free memory is still 350.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.5s, 151 PlacesBefore, 52 PlacesAfterwards, 140 TransitionsBefore, 40 TransitionsAfterwards, 3258 CoEnabledTransitionPairs, 7 FixpointIterations, 52 TrivialSequentialCompositions, 73 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 133 TotalNumberOfCompositions, 8636 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4190, independent: 3971, independent conditional: 0, independent unconditional: 3971, dependent: 219, dependent conditional: 0, dependent unconditional: 219, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1716, independent: 1676, independent conditional: 0, independent unconditional: 1676, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4190, independent: 2295, independent conditional: 0, independent unconditional: 2295, dependent: 179, dependent conditional: 0, dependent unconditional: 179, unknown: 1716, unknown conditional: 0, unknown unconditional: 1716] , Statistics on independence cache: Total cache size (in pairs): 203, Positive cache size: 185, Positive conditional cache size: 0, Positive unconditional cache size: 185, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L848] 0 pthread_t t1133; [L849] FCALL, FORK 0 pthread_create(&t1133, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1133, ((void *)0), P0, ((void *)0))=-1, t1133={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L850] 0 pthread_t t1134; [L851] FCALL, FORK 0 pthread_create(&t1134, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1134, ((void *)0), P1, ((void *)0))=0, t1133={3:0}, t1134={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L852] 0 pthread_t t1135; [L853] FCALL, FORK 0 pthread_create(&t1135, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1135, ((void *)0), P2, ((void *)0))=1, t1133={3:0}, t1134={7:0}, t1135={11:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L854] 0 pthread_t t1136; [L855] FCALL, FORK 0 pthread_create(&t1136, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1136, ((void *)0), P3, ((void *)0))=2, t1133={3:0}, t1134={7:0}, t1135={11:0}, t1136={15:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L804] 4 z$w_buff1 = z$w_buff0 [L805] 4 z$w_buff0 = 2 [L806] 4 z$w_buff1_used = z$w_buff0_used [L807] 4 z$w_buff0_used = (_Bool)1 [L808] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L808] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L809] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L810] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L811] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L812] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L813] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L814] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L817] 4 a = 1 [L820] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L823] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L754] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L769] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L772] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L784] 3 y = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L787] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L790] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L791] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L792] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L793] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L794] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L826] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L827] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L828] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L829] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L830] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L797] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 3 return 0; [L833] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L835] 4 return 0; [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L862] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L863] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L864] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L865] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1133={3:0}, t1134={7:0}, t1135={11:0}, t1136={15:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L868] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L869] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L870] 0 z$flush_delayed = weak$$choice2 [L871] 0 z$mem_tmp = z [L872] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L873] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L874] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L875] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L876] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L878] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L880] 0 z = z$flush_delayed ? z$mem_tmp : z [L881] 0 z$flush_delayed = (_Bool)0 [L883] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 846]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 180 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 17.8s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 364 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 278 mSDsluCounter, 69 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 46 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1594 IncrementalHoareTripleChecker+Invalid, 1633 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 23 mSDtfsCounter, 1594 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 182 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=209occurred in iteration=8, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 212 NumberOfCodeBlocks, 212 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 175 ConstructedInterpolants, 20 QuantifiedInterpolants, 1641 SizeOfPredicates, 12 NumberOfNonLiveVariables, 1503 ConjunctsInSsa, 68 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-31 23:22:00,610 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