./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix016_pso.opt_tso.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix016_pso.opt_tso.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 2135a1882b0d27098e68a161f8694a670a72069d61776627736073247b8e4e23 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 20:18:33,248 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:18:33,250 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:18:33,295 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:18:33,295 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:18:33,298 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:18:33,300 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:18:33,303 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:18:33,305 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:18:33,310 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:18:33,311 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:18:33,314 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:18:33,314 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:18:33,316 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:18:33,317 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:18:33,323 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:18:33,324 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:18:33,325 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:18:33,327 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:18:33,332 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:18:33,333 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:18:33,345 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:18:33,346 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:18:33,347 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:18:33,354 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:18:33,354 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:18:33,354 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:18:33,356 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:18:33,357 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:18:33,357 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:18:33,358 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:18:33,359 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:18:33,361 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:18:33,362 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:18:33,363 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:18:33,363 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:18:33,363 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:18:33,364 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:18:33,364 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:18:33,365 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:18:33,365 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:18:33,367 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-29 20:18:33,402 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:18:33,403 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:18:33,404 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:18:33,404 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:18:33,405 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:18:33,405 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:18:33,406 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:18:33,406 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:18:33,406 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:18:33,407 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:18:33,407 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:18:33,407 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:18:33,407 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:18:33,408 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:18:33,408 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:18:33,408 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:18:33,408 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:18:33,408 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:18:33,408 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:18:33,409 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:18:33,409 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:18:33,409 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:18:33,409 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:18:33,409 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:18:33,410 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:18:33,410 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:18:33,410 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:18:33,410 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:18:33,411 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 20:18:33,411 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 20:18:33,411 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:18:33,411 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:18:33,411 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:18:33,412 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:18:33,412 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 -> 2135a1882b0d27098e68a161f8694a670a72069d61776627736073247b8e4e23 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-29 20:18:33,670 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:18:33,691 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:18:33,693 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:18:33,694 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:18:33,695 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:18:33,696 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix016_pso.opt_tso.opt.i [2023-08-29 20:18:34,921 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:18:35,162 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:18:35,163 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix016_pso.opt_tso.opt.i [2023-08-29 20:18:35,178 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d346f43f3/166153e72a0b47888009ebb99d312dba/FLAG98f332d94 [2023-08-29 20:18:35,189 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d346f43f3/166153e72a0b47888009ebb99d312dba [2023-08-29 20:18:35,192 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:18:35,193 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:18:35,195 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:18:35,195 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:18:35,198 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:18:35,199 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:18:35" (1/1) ... [2023-08-29 20:18:35,200 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ba1b9d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:18:35, skipping insertion in model container [2023-08-29 20:18:35,200 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:18:35" (1/1) ... [2023-08-29 20:18:35,205 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:18:35,262 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:18:35,438 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/mix016_pso.opt_tso.opt.i[956,969] [2023-08-29 20:18:35,666 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:18:35,680 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:18:35,693 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/mix016_pso.opt_tso.opt.i[956,969] [2023-08-29 20:18:35,752 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:18:35,800 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:18:35,800 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:18:35,806 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:18:35,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:18:35 WrapperNode [2023-08-29 20:18:35,807 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:18:35,808 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:18:35,808 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:18:35,808 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:18:35,814 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:18:35" (1/1) ... [2023-08-29 20:18:35,850 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:18:35" (1/1) ... [2023-08-29 20:18:35,875 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 150 [2023-08-29 20:18:35,881 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:18:35,881 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:18:35,882 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:18:35,882 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:18:35,890 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:18:35" (1/1) ... [2023-08-29 20:18:35,890 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:18:35" (1/1) ... [2023-08-29 20:18:35,901 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:18:35" (1/1) ... [2023-08-29 20:18:35,902 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:18:35" (1/1) ... [2023-08-29 20:18:35,912 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:18:35" (1/1) ... [2023-08-29 20:18:35,918 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:18:35" (1/1) ... [2023-08-29 20:18:35,921 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:18:35" (1/1) ... [2023-08-29 20:18:35,923 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:18:35" (1/1) ... [2023-08-29 20:18:35,925 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:18:35,926 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:18:35,926 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:18:35,926 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:18:35,939 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:18:35" (1/1) ... [2023-08-29 20:18:35,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:18:35,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:18:35,963 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-29 20:18:35,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-29 20:18:35,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 20:18:35,994 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:18:35,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:18:35,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:18:35,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:18:35,994 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:18:35,994 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:18:35,994 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:18:35,994 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:18:35,995 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-29 20:18:35,995 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-29 20:18:35,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-29 20:18:35,995 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:18:35,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:18:35,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:18:35,996 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 20:18:36,111 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:18:36,113 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:18:36,474 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:18:36,656 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:18:36,657 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:18:36,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:18:36 BoogieIcfgContainer [2023-08-29 20:18:36,659 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:18:36,660 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:18:36,661 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:18:36,663 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:18:36,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:18:35" (1/3) ... [2023-08-29 20:18:36,664 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26b0b9a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:18:36, skipping insertion in model container [2023-08-29 20:18:36,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:18:35" (2/3) ... [2023-08-29 20:18:36,665 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26b0b9a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:18:36, skipping insertion in model container [2023-08-29 20:18:36,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:18:36" (3/3) ... [2023-08-29 20:18:36,666 INFO L112 eAbstractionObserver]: Analyzing ICFG mix016_pso.opt_tso.opt.i [2023-08-29 20:18:36,682 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:18:36,683 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-08-29 20:18:36,683 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:18:36,746 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:18:36,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 119 transitions, 253 flow [2023-08-29 20:18:36,824 INFO L130 PetriNetUnfolder]: 2/116 cut-off events. [2023-08-29 20:18:36,827 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:18:36,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 78 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2023-08-29 20:18:36,834 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 119 transitions, 253 flow [2023-08-29 20:18:36,840 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 116 transitions, 241 flow [2023-08-29 20:18:36,848 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:18:36,867 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 116 transitions, 241 flow [2023-08-29 20:18:36,872 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 116 transitions, 241 flow [2023-08-29 20:18:36,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 116 transitions, 241 flow [2023-08-29 20:18:36,902 INFO L130 PetriNetUnfolder]: 2/116 cut-off events. [2023-08-29 20:18:36,903 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:18:36,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 78 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2023-08-29 20:18:36,905 INFO L119 LiptonReduction]: Number of co-enabled transitions 1956 [2023-08-29 20:18:40,943 INFO L134 LiptonReduction]: Checked pairs total: 5209 [2023-08-29 20:18:40,943 INFO L136 LiptonReduction]: Total number of compositions: 111 [2023-08-29 20:18:40,954 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:18:40,959 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;@7c7ded0a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:18:40,959 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-08-29 20:18:40,960 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-29 20:18:40,960 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:18:40,961 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:18:40,961 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:18:40,962 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:18:40,965 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:18:40,966 INFO L85 PathProgramCache]: Analyzing trace with hash 534, now seen corresponding path program 1 times [2023-08-29 20:18:40,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:18:40,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757281259] [2023-08-29 20:18:40,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:18:40,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:18:41,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:18:41,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:18:41,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:18:41,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757281259] [2023-08-29 20:18:41,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757281259] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:18:41,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:18:41,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:18:41,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974056725] [2023-08-29 20:18:41,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:18:41,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:18:41,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:18:41,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:18:41,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:18:41,146 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 230 [2023-08-29 20:18:41,148 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 73 flow. Second operand has 2 states, 2 states have (on average 107.5) internal successors, (215), 2 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:41,148 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:18:41,149 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 230 [2023-08-29 20:18:41,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:18:41,457 INFO L130 PetriNetUnfolder]: 1263/1919 cut-off events. [2023-08-29 20:18:41,458 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2023-08-29 20:18:41,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3826 conditions, 1919 events. 1263/1919 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 9170 event pairs, 1263 based on Foata normal form. 72/1666 useless extension candidates. Maximal degree in co-relation 3815. Up to 1871 conditions per place. [2023-08-29 20:18:41,474 INFO L137 encePairwiseOnDemand]: 223/230 looper letters, 23 selfloop transitions, 0 changer transitions 0/25 dead transitions. [2023-08-29 20:18:41,475 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 25 transitions, 105 flow [2023-08-29 20:18:41,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:18:41,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:18:41,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 244 transitions. [2023-08-29 20:18:41,490 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5304347826086957 [2023-08-29 20:18:41,491 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 244 transitions. [2023-08-29 20:18:41,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 244 transitions. [2023-08-29 20:18:41,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:18:41,495 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 244 transitions. [2023-08-29 20:18:41,500 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 122.0) internal successors, (244), 2 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:41,505 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 230.0) internal successors, (690), 3 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:41,506 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 230.0) internal successors, (690), 3 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:41,507 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 73 flow. Second operand 2 states and 244 transitions. [2023-08-29 20:18:41,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 25 transitions, 105 flow [2023-08-29 20:18:41,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 25 transitions, 102 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 20:18:41,512 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 56 flow [2023-08-29 20:18:41,513 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=56, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2023-08-29 20:18:41,517 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -8 predicate places. [2023-08-29 20:18:41,517 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 56 flow [2023-08-29 20:18:41,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 107.5) internal successors, (215), 2 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:41,518 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:18:41,519 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:18:41,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 20:18:41,520 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:18:41,530 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:18:41,531 INFO L85 PathProgramCache]: Analyzing trace with hash -666531203, now seen corresponding path program 1 times [2023-08-29 20:18:41,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:18:41,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660195869] [2023-08-29 20:18:41,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:18:41,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:18:41,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:18:41,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:18:41,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:18:41,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660195869] [2023-08-29 20:18:41,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660195869] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:18:41,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:18:41,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:18:41,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587426068] [2023-08-29 20:18:41,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:18:41,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:18:41,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:18:41,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:18:41,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:18:41,845 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 230 [2023-08-29 20:18:41,846 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:41,846 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:18:41,847 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 230 [2023-08-29 20:18:41,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:18:42,099 INFO L130 PetriNetUnfolder]: 1043/1651 cut-off events. [2023-08-29 20:18:42,100 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:18:42,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3240 conditions, 1651 events. 1043/1651 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 8206 event pairs, 163 based on Foata normal form. 0/1470 useless extension candidates. Maximal degree in co-relation 3237. Up to 1265 conditions per place. [2023-08-29 20:18:42,108 INFO L137 encePairwiseOnDemand]: 227/230 looper letters, 28 selfloop transitions, 2 changer transitions 4/36 dead transitions. [2023-08-29 20:18:42,108 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 36 transitions, 146 flow [2023-08-29 20:18:42,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:18:42,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:18:42,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 353 transitions. [2023-08-29 20:18:42,113 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5115942028985507 [2023-08-29 20:18:42,113 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 353 transitions. [2023-08-29 20:18:42,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 353 transitions. [2023-08-29 20:18:42,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:18:42,114 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 353 transitions. [2023-08-29 20:18:42,116 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:42,118 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 230.0) internal successors, (920), 4 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:42,119 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 230.0) internal successors, (920), 4 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:42,119 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 56 flow. Second operand 3 states and 353 transitions. [2023-08-29 20:18:42,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 36 transitions, 146 flow [2023-08-29 20:18:42,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 36 transitions, 146 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:18:42,121 INFO L231 Difference]: Finished difference. Result has 34 places, 22 transitions, 54 flow [2023-08-29 20:18:42,121 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=34, PETRI_TRANSITIONS=22} [2023-08-29 20:18:42,122 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -7 predicate places. [2023-08-29 20:18:42,122 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 22 transitions, 54 flow [2023-08-29 20:18:42,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:42,122 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:18:42,122 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:18:42,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-29 20:18:42,123 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:18:42,125 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:18:42,126 INFO L85 PathProgramCache]: Analyzing trace with hash -996134359, now seen corresponding path program 1 times [2023-08-29 20:18:42,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:18:42,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707542258] [2023-08-29 20:18:42,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:18:42,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:18:42,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:18:42,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:18:42,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:18:42,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707542258] [2023-08-29 20:18:42,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707542258] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:18:42,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:18:42,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:18:42,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21223542] [2023-08-29 20:18:42,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:18:42,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:18:42,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:18:42,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:18:42,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:18:42,709 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 230 [2023-08-29 20:18:42,710 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 22 transitions, 54 flow. Second operand has 6 states, 6 states have (on average 94.66666666666667) internal successors, (568), 6 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:42,710 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:18:42,711 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 230 [2023-08-29 20:18:42,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:18:42,911 INFO L130 PetriNetUnfolder]: 644/1036 cut-off events. [2023-08-29 20:18:42,912 INFO L131 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2023-08-29 20:18:42,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2108 conditions, 1036 events. 644/1036 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4666 event pairs, 48 based on Foata normal form. 0/1036 useless extension candidates. Maximal degree in co-relation 2104. Up to 579 conditions per place. [2023-08-29 20:18:42,918 INFO L137 encePairwiseOnDemand]: 225/230 looper letters, 31 selfloop transitions, 4 changer transitions 0/37 dead transitions. [2023-08-29 20:18:42,918 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 37 transitions, 154 flow [2023-08-29 20:18:42,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:18:42,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:18:42,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 595 transitions. [2023-08-29 20:18:42,920 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4311594202898551 [2023-08-29 20:18:42,921 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 595 transitions. [2023-08-29 20:18:42,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 595 transitions. [2023-08-29 20:18:42,921 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:18:42,921 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 595 transitions. [2023-08-29 20:18:42,923 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 99.16666666666667) internal successors, (595), 6 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:42,927 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:42,927 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:42,928 INFO L175 Difference]: Start difference. First operand has 34 places, 22 transitions, 54 flow. Second operand 6 states and 595 transitions. [2023-08-29 20:18:42,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 37 transitions, 154 flow [2023-08-29 20:18:42,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 37 transitions, 150 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:18:42,931 INFO L231 Difference]: Finished difference. Result has 34 places, 21 transitions, 56 flow [2023-08-29 20:18:42,931 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=56, PETRI_PLACES=34, PETRI_TRANSITIONS=21} [2023-08-29 20:18:42,932 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -7 predicate places. [2023-08-29 20:18:42,932 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 21 transitions, 56 flow [2023-08-29 20:18:42,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.66666666666667) internal successors, (568), 6 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:42,933 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:18:42,933 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:18:42,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-29 20:18:42,933 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:18:42,934 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:18:42,934 INFO L85 PathProgramCache]: Analyzing trace with hash -996134399, now seen corresponding path program 1 times [2023-08-29 20:18:42,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:18:42,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924262626] [2023-08-29 20:18:42,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:18:42,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:18:42,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:18:43,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:18:43,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:18:43,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924262626] [2023-08-29 20:18:43,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924262626] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:18:43,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:18:43,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:18:43,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239936710] [2023-08-29 20:18:43,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:18:43,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:18:43,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:18:43,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:18:43,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:18:43,189 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 230 [2023-08-29 20:18:43,190 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 21 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 102.5) internal successors, (410), 4 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:43,190 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:18:43,191 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 230 [2023-08-29 20:18:43,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:18:43,437 INFO L130 PetriNetUnfolder]: 1167/1768 cut-off events. [2023-08-29 20:18:43,437 INFO L131 PetriNetUnfolder]: For 97/97 co-relation queries the response was YES. [2023-08-29 20:18:43,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3691 conditions, 1768 events. 1167/1768 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7431 event pairs, 459 based on Foata normal form. 96/1864 useless extension candidates. Maximal degree in co-relation 3687. Up to 1461 conditions per place. [2023-08-29 20:18:43,446 INFO L137 encePairwiseOnDemand]: 224/230 looper letters, 29 selfloop transitions, 4 changer transitions 18/51 dead transitions. [2023-08-29 20:18:43,447 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 51 transitions, 232 flow [2023-08-29 20:18:43,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:18:43,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:18:43,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 553 transitions. [2023-08-29 20:18:43,450 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4808695652173913 [2023-08-29 20:18:43,452 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 553 transitions. [2023-08-29 20:18:43,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 553 transitions. [2023-08-29 20:18:43,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:18:43,452 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 553 transitions. [2023-08-29 20:18:43,454 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 110.6) internal successors, (553), 5 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:43,456 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 230.0) internal successors, (1380), 6 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:43,457 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 230.0) internal successors, (1380), 6 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:43,457 INFO L175 Difference]: Start difference. First operand has 34 places, 21 transitions, 56 flow. Second operand 5 states and 553 transitions. [2023-08-29 20:18:43,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 51 transitions, 232 flow [2023-08-29 20:18:43,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 51 transitions, 218 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-29 20:18:43,460 INFO L231 Difference]: Finished difference. Result has 37 places, 24 transitions, 86 flow [2023-08-29 20:18:43,460 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=49, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=86, PETRI_PLACES=37, PETRI_TRANSITIONS=24} [2023-08-29 20:18:43,461 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -4 predicate places. [2023-08-29 20:18:43,461 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 24 transitions, 86 flow [2023-08-29 20:18:43,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.5) internal successors, (410), 4 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:43,462 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:18:43,462 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:18:43,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-29 20:18:43,463 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:18:43,463 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:18:43,463 INFO L85 PathProgramCache]: Analyzing trace with hash 603846341, now seen corresponding path program 1 times [2023-08-29 20:18:43,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:18:43,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900118480] [2023-08-29 20:18:43,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:18:43,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:18:43,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:18:43,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:18:43,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:18:43,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900118480] [2023-08-29 20:18:43,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900118480] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:18:43,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:18:43,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:18:43,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476507052] [2023-08-29 20:18:43,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:18:43,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:18:43,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:18:43,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:18:43,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:18:43,635 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 230 [2023-08-29 20:18:43,636 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 24 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 107.75) internal successors, (431), 4 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-29 20:18:43,637 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:18:43,637 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 230 [2023-08-29 20:18:43,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:18:43,849 INFO L130 PetriNetUnfolder]: 754/1234 cut-off events. [2023-08-29 20:18:43,849 INFO L131 PetriNetUnfolder]: For 523/523 co-relation queries the response was YES. [2023-08-29 20:18:43,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3046 conditions, 1234 events. 754/1234 cut-off events. For 523/523 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5582 event pairs, 235 based on Foata normal form. 60/1293 useless extension candidates. Maximal degree in co-relation 3039. Up to 701 conditions per place. [2023-08-29 20:18:43,856 INFO L137 encePairwiseOnDemand]: 226/230 looper letters, 25 selfloop transitions, 3 changer transitions 15/46 dead transitions. [2023-08-29 20:18:43,856 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 46 transitions, 235 flow [2023-08-29 20:18:43,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:18:43,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:18:43,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 568 transitions. [2023-08-29 20:18:43,858 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49391304347826087 [2023-08-29 20:18:43,858 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 568 transitions. [2023-08-29 20:18:43,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 568 transitions. [2023-08-29 20:18:43,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:18:43,859 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 568 transitions. [2023-08-29 20:18:43,860 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 113.6) internal successors, (568), 5 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:43,862 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 230.0) internal successors, (1380), 6 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:43,863 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 230.0) internal successors, (1380), 6 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:43,863 INFO L175 Difference]: Start difference. First operand has 37 places, 24 transitions, 86 flow. Second operand 5 states and 568 transitions. [2023-08-29 20:18:43,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 46 transitions, 235 flow [2023-08-29 20:18:43,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 46 transitions, 229 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-29 20:18:43,867 INFO L231 Difference]: Finished difference. Result has 40 places, 24 transitions, 95 flow [2023-08-29 20:18:43,867 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=95, PETRI_PLACES=40, PETRI_TRANSITIONS=24} [2023-08-29 20:18:43,868 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -1 predicate places. [2023-08-29 20:18:43,868 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 24 transitions, 95 flow [2023-08-29 20:18:43,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.75) internal successors, (431), 4 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-29 20:18:43,868 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:18:43,869 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:18:43,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-29 20:18:43,869 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:18:43,869 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:18:43,869 INFO L85 PathProgramCache]: Analyzing trace with hash 458646846, now seen corresponding path program 1 times [2023-08-29 20:18:43,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:18:43,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076251269] [2023-08-29 20:18:43,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:18:43,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:18:43,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:18:44,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:18:44,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:18:44,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076251269] [2023-08-29 20:18:44,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076251269] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:18:44,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:18:44,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:18:44,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068939549] [2023-08-29 20:18:44,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:18:44,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:18:44,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:18:44,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:18:44,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:18:44,080 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 230 [2023-08-29 20:18:44,080 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 24 transitions, 95 flow. Second operand has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 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-29 20:18:44,081 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:18:44,081 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 230 [2023-08-29 20:18:44,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:18:44,269 INFO L130 PetriNetUnfolder]: 485/830 cut-off events. [2023-08-29 20:18:44,270 INFO L131 PetriNetUnfolder]: For 545/545 co-relation queries the response was YES. [2023-08-29 20:18:44,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2228 conditions, 830 events. 485/830 cut-off events. For 545/545 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3688 event pairs, 88 based on Foata normal form. 76/904 useless extension candidates. Maximal degree in co-relation 2219. Up to 514 conditions per place. [2023-08-29 20:18:44,276 INFO L137 encePairwiseOnDemand]: 224/230 looper letters, 46 selfloop transitions, 7 changer transitions 2/58 dead transitions. [2023-08-29 20:18:44,276 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 58 transitions, 321 flow [2023-08-29 20:18:44,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:18:44,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:18:44,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 563 transitions. [2023-08-29 20:18:44,279 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4895652173913044 [2023-08-29 20:18:44,279 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 563 transitions. [2023-08-29 20:18:44,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 563 transitions. [2023-08-29 20:18:44,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:18:44,280 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 563 transitions. [2023-08-29 20:18:44,281 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:44,283 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 230.0) internal successors, (1380), 6 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:44,283 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 230.0) internal successors, (1380), 6 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:44,284 INFO L175 Difference]: Start difference. First operand has 40 places, 24 transitions, 95 flow. Second operand 5 states and 563 transitions. [2023-08-29 20:18:44,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 58 transitions, 321 flow [2023-08-29 20:18:44,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 58 transitions, 303 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-29 20:18:44,287 INFO L231 Difference]: Finished difference. Result has 41 places, 30 transitions, 139 flow [2023-08-29 20:18:44,287 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=139, PETRI_PLACES=41, PETRI_TRANSITIONS=30} [2023-08-29 20:18:44,288 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 0 predicate places. [2023-08-29 20:18:44,288 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 139 flow [2023-08-29 20:18:44,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 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-29 20:18:44,289 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:18:44,289 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:18:44,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-29 20:18:44,289 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:18:44,290 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:18:44,290 INFO L85 PathProgramCache]: Analyzing trace with hash -404901034, now seen corresponding path program 1 times [2023-08-29 20:18:44,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:18:44,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300357437] [2023-08-29 20:18:44,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:18:44,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:18:44,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:18:44,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:18:44,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:18:44,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300357437] [2023-08-29 20:18:44,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300357437] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:18:44,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:18:44,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:18:44,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807316725] [2023-08-29 20:18:44,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:18:44,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:18:44,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:18:44,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:18:44,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:18:44,496 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 230 [2023-08-29 20:18:44,497 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 139 flow. Second operand has 5 states, 5 states have (on average 104.8) internal successors, (524), 5 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:44,497 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:18:44,497 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 230 [2023-08-29 20:18:44,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:18:44,677 INFO L130 PetriNetUnfolder]: 316/585 cut-off events. [2023-08-29 20:18:44,677 INFO L131 PetriNetUnfolder]: For 507/507 co-relation queries the response was YES. [2023-08-29 20:18:44,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1910 conditions, 585 events. 316/585 cut-off events. For 507/507 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2550 event pairs, 46 based on Foata normal form. 44/627 useless extension candidates. Maximal degree in co-relation 1900. Up to 202 conditions per place. [2023-08-29 20:18:44,681 INFO L137 encePairwiseOnDemand]: 224/230 looper letters, 53 selfloop transitions, 13 changer transitions 9/78 dead transitions. [2023-08-29 20:18:44,682 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 78 transitions, 485 flow [2023-08-29 20:18:44,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:18:44,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:18:44,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 787 transitions. [2023-08-29 20:18:44,684 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4888198757763975 [2023-08-29 20:18:44,684 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 787 transitions. [2023-08-29 20:18:44,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 787 transitions. [2023-08-29 20:18:44,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:18:44,685 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 787 transitions. [2023-08-29 20:18:44,687 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 112.42857142857143) internal successors, (787), 7 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:44,689 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 230.0) internal successors, (1840), 8 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:44,689 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 230.0) internal successors, (1840), 8 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:44,690 INFO L175 Difference]: Start difference. First operand has 41 places, 30 transitions, 139 flow. Second operand 7 states and 787 transitions. [2023-08-29 20:18:44,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 78 transitions, 485 flow [2023-08-29 20:18:44,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 78 transitions, 481 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:18:44,693 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 223 flow [2023-08-29 20:18:44,694 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=223, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2023-08-29 20:18:44,694 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 8 predicate places. [2023-08-29 20:18:44,694 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 223 flow [2023-08-29 20:18:44,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.8) internal successors, (524), 5 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:44,695 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:18:44,695 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-29 20:18:44,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-29 20:18:44,695 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:18:44,696 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:18:44,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1786592624, now seen corresponding path program 1 times [2023-08-29 20:18:44,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:18:44,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897448275] [2023-08-29 20:18:44,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:18:44,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:18:44,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:18:44,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:18:44,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:18:44,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897448275] [2023-08-29 20:18:44,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897448275] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:18:44,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:18:44,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:18:44,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939431753] [2023-08-29 20:18:44,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:18:44,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:18:44,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:18:44,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:18:44,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:18:44,945 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 230 [2023-08-29 20:18:44,946 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 223 flow. Second operand has 6 states, 6 states have (on average 101.0) internal successors, (606), 6 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:44,946 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:18:44,946 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 230 [2023-08-29 20:18:44,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:18:45,214 INFO L130 PetriNetUnfolder]: 540/967 cut-off events. [2023-08-29 20:18:45,214 INFO L131 PetriNetUnfolder]: For 2107/2107 co-relation queries the response was YES. [2023-08-29 20:18:45,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3682 conditions, 967 events. 540/967 cut-off events. For 2107/2107 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4579 event pairs, 49 based on Foata normal form. 7/974 useless extension candidates. Maximal degree in co-relation 3669. Up to 517 conditions per place. [2023-08-29 20:18:45,219 INFO L137 encePairwiseOnDemand]: 223/230 looper letters, 52 selfloop transitions, 8 changer transitions 43/103 dead transitions. [2023-08-29 20:18:45,219 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 103 transitions, 820 flow [2023-08-29 20:18:45,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:18:45,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:18:45,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 760 transitions. [2023-08-29 20:18:45,221 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4720496894409938 [2023-08-29 20:18:45,221 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 760 transitions. [2023-08-29 20:18:45,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 760 transitions. [2023-08-29 20:18:45,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:18:45,222 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 760 transitions. [2023-08-29 20:18:45,224 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 108.57142857142857) internal successors, (760), 7 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:45,226 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 230.0) internal successors, (1840), 8 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:45,226 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 230.0) internal successors, (1840), 8 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:45,227 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 223 flow. Second operand 7 states and 760 transitions. [2023-08-29 20:18:45,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 103 transitions, 820 flow [2023-08-29 20:18:45,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 103 transitions, 738 flow, removed 29 selfloop flow, removed 2 redundant places. [2023-08-29 20:18:45,236 INFO L231 Difference]: Finished difference. Result has 56 places, 33 transitions, 194 flow [2023-08-29 20:18:45,236 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=194, PETRI_PLACES=56, PETRI_TRANSITIONS=33} [2023-08-29 20:18:45,237 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 15 predicate places. [2023-08-29 20:18:45,237 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 33 transitions, 194 flow [2023-08-29 20:18:45,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.0) internal successors, (606), 6 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:45,238 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:18:45,238 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-29 20:18:45,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-29 20:18:45,238 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:18:45,239 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:18:45,239 INFO L85 PathProgramCache]: Analyzing trace with hash 433645096, now seen corresponding path program 2 times [2023-08-29 20:18:45,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:18:45,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476391978] [2023-08-29 20:18:45,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:18:45,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:18:45,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:18:45,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:18:45,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:18:45,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476391978] [2023-08-29 20:18:45,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476391978] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:18:45,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:18:45,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:18:45,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453290668] [2023-08-29 20:18:45,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:18:45,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:18:45,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:18:45,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:18:45,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:18:45,498 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 230 [2023-08-29 20:18:45,499 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 33 transitions, 194 flow. Second operand has 6 states, 6 states have (on average 104.83333333333333) internal successors, (629), 6 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:45,499 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:18:45,499 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 230 [2023-08-29 20:18:45,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:18:45,651 INFO L130 PetriNetUnfolder]: 180/357 cut-off events. [2023-08-29 20:18:45,651 INFO L131 PetriNetUnfolder]: For 602/624 co-relation queries the response was YES. [2023-08-29 20:18:45,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1275 conditions, 357 events. 180/357 cut-off events. For 602/624 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1459 event pairs, 42 based on Foata normal form. 31/381 useless extension candidates. Maximal degree in co-relation 1258. Up to 128 conditions per place. [2023-08-29 20:18:45,654 INFO L137 encePairwiseOnDemand]: 224/230 looper letters, 33 selfloop transitions, 10 changer transitions 15/61 dead transitions. [2023-08-29 20:18:45,654 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 61 transitions, 433 flow [2023-08-29 20:18:45,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:18:45,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:18:45,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 769 transitions. [2023-08-29 20:18:45,657 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47763975155279503 [2023-08-29 20:18:45,657 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 769 transitions. [2023-08-29 20:18:45,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 769 transitions. [2023-08-29 20:18:45,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:18:45,658 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 769 transitions. [2023-08-29 20:18:45,660 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 109.85714285714286) internal successors, (769), 7 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:45,662 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 230.0) internal successors, (1840), 8 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:45,663 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 230.0) internal successors, (1840), 8 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:45,663 INFO L175 Difference]: Start difference. First operand has 56 places, 33 transitions, 194 flow. Second operand 7 states and 769 transitions. [2023-08-29 20:18:45,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 61 transitions, 433 flow [2023-08-29 20:18:45,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 61 transitions, 391 flow, removed 15 selfloop flow, removed 6 redundant places. [2023-08-29 20:18:45,666 INFO L231 Difference]: Finished difference. Result has 54 places, 29 transitions, 168 flow [2023-08-29 20:18:45,666 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=168, PETRI_PLACES=54, PETRI_TRANSITIONS=29} [2023-08-29 20:18:45,667 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 13 predicate places. [2023-08-29 20:18:45,667 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 29 transitions, 168 flow [2023-08-29 20:18:45,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 104.83333333333333) internal successors, (629), 6 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:45,668 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:18:45,668 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] [2023-08-29 20:18:45,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-29 20:18:45,668 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:18:45,669 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:18:45,669 INFO L85 PathProgramCache]: Analyzing trace with hash 483546928, now seen corresponding path program 1 times [2023-08-29 20:18:45,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:18:45,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196994863] [2023-08-29 20:18:45,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:18:45,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:18:45,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:18:45,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:18:45,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:18:45,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196994863] [2023-08-29 20:18:45,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196994863] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:18:45,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:18:45,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:18:45,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795481501] [2023-08-29 20:18:45,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:18:45,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:18:45,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:18:45,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:18:45,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:18:45,934 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 230 [2023-08-29 20:18:45,935 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 29 transitions, 168 flow. Second operand has 5 states, 5 states have (on average 102.2) internal successors, (511), 5 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:45,935 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:18:45,935 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 230 [2023-08-29 20:18:45,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:18:46,073 INFO L130 PetriNetUnfolder]: 153/309 cut-off events. [2023-08-29 20:18:46,073 INFO L131 PetriNetUnfolder]: For 603/603 co-relation queries the response was YES. [2023-08-29 20:18:46,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1170 conditions, 309 events. 153/309 cut-off events. For 603/603 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1175 event pairs, 30 based on Foata normal form. 1/310 useless extension candidates. Maximal degree in co-relation 1154. Up to 197 conditions per place. [2023-08-29 20:18:46,075 INFO L137 encePairwiseOnDemand]: 222/230 looper letters, 43 selfloop transitions, 9 changer transitions 13/65 dead transitions. [2023-08-29 20:18:46,076 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 65 transitions, 497 flow [2023-08-29 20:18:46,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:18:46,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:18:46,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 639 transitions. [2023-08-29 20:18:46,078 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46304347826086956 [2023-08-29 20:18:46,078 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 639 transitions. [2023-08-29 20:18:46,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 639 transitions. [2023-08-29 20:18:46,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:18:46,079 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 639 transitions. [2023-08-29 20:18:46,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 106.5) internal successors, (639), 6 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:46,088 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:46,089 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:46,089 INFO L175 Difference]: Start difference. First operand has 54 places, 29 transitions, 168 flow. Second operand 6 states and 639 transitions. [2023-08-29 20:18:46,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 65 transitions, 497 flow [2023-08-29 20:18:46,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 65 transitions, 404 flow, removed 26 selfloop flow, removed 9 redundant places. [2023-08-29 20:18:46,093 INFO L231 Difference]: Finished difference. Result has 49 places, 34 transitions, 184 flow [2023-08-29 20:18:46,094 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=184, PETRI_PLACES=49, PETRI_TRANSITIONS=34} [2023-08-29 20:18:46,095 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 8 predicate places. [2023-08-29 20:18:46,095 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 34 transitions, 184 flow [2023-08-29 20:18:46,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.2) internal successors, (511), 5 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:46,096 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:18:46,096 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] [2023-08-29 20:18:46,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-29 20:18:46,096 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:18:46,097 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:18:46,097 INFO L85 PathProgramCache]: Analyzing trace with hash -883504648, now seen corresponding path program 2 times [2023-08-29 20:18:46,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:18:46,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987430183] [2023-08-29 20:18:46,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:18:46,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:18:46,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:18:46,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:18:46,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:18:46,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987430183] [2023-08-29 20:18:46,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987430183] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:18:46,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:18:46,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:18:46,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570712789] [2023-08-29 20:18:46,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:18:46,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:18:46,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:18:46,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:18:46,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:18:46,333 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 230 [2023-08-29 20:18:46,334 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 34 transitions, 184 flow. Second operand has 5 states, 5 states have (on average 106.0) internal successors, (530), 5 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:46,334 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:18:46,334 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 230 [2023-08-29 20:18:46,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:18:46,459 INFO L130 PetriNetUnfolder]: 167/353 cut-off events. [2023-08-29 20:18:46,459 INFO L131 PetriNetUnfolder]: For 561/561 co-relation queries the response was YES. [2023-08-29 20:18:46,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1253 conditions, 353 events. 167/353 cut-off events. For 561/561 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1476 event pairs, 47 based on Foata normal form. 1/351 useless extension candidates. Maximal degree in co-relation 1240. Up to 179 conditions per place. [2023-08-29 20:18:46,461 INFO L137 encePairwiseOnDemand]: 226/230 looper letters, 27 selfloop transitions, 1 changer transitions 32/61 dead transitions. [2023-08-29 20:18:46,462 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 61 transitions, 426 flow [2023-08-29 20:18:46,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:18:46,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:18:46,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 552 transitions. [2023-08-29 20:18:46,464 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48 [2023-08-29 20:18:46,464 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 552 transitions. [2023-08-29 20:18:46,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 552 transitions. [2023-08-29 20:18:46,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:18:46,464 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 552 transitions. [2023-08-29 20:18:46,466 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 110.4) internal successors, (552), 5 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:46,467 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 230.0) internal successors, (1380), 6 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:46,468 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 230.0) internal successors, (1380), 6 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:46,468 INFO L175 Difference]: Start difference. First operand has 49 places, 34 transitions, 184 flow. Second operand 5 states and 552 transitions. [2023-08-29 20:18:46,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 61 transitions, 426 flow [2023-08-29 20:18:46,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 61 transitions, 424 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-29 20:18:46,473 INFO L231 Difference]: Finished difference. Result has 53 places, 27 transitions, 135 flow [2023-08-29 20:18:46,473 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=135, PETRI_PLACES=53, PETRI_TRANSITIONS=27} [2023-08-29 20:18:46,474 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 12 predicate places. [2023-08-29 20:18:46,474 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 27 transitions, 135 flow [2023-08-29 20:18:46,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 106.0) internal successors, (530), 5 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:46,474 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:18:46,475 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] [2023-08-29 20:18:46,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-29 20:18:46,475 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:18:46,475 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:18:46,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1675455154, now seen corresponding path program 3 times [2023-08-29 20:18:46,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:18:46,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118076587] [2023-08-29 20:18:46,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:18:46,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:18:46,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:18:47,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:18:47,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:18:47,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118076587] [2023-08-29 20:18:47,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118076587] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:18:47,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:18:47,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:18:47,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491860078] [2023-08-29 20:18:47,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:18:47,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-29 20:18:47,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:18:47,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-29 20:18:47,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-08-29 20:18:47,607 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 230 [2023-08-29 20:18:47,608 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 27 transitions, 135 flow. Second operand has 8 states, 8 states have (on average 103.375) internal successors, (827), 8 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:47,609 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:18:47,609 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 230 [2023-08-29 20:18:47,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:18:47,763 INFO L130 PetriNetUnfolder]: 60/149 cut-off events. [2023-08-29 20:18:47,763 INFO L131 PetriNetUnfolder]: For 306/306 co-relation queries the response was YES. [2023-08-29 20:18:47,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 552 conditions, 149 events. 60/149 cut-off events. For 306/306 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 540 event pairs, 10 based on Foata normal form. 1/145 useless extension candidates. Maximal degree in co-relation 537. Up to 63 conditions per place. [2023-08-29 20:18:47,764 INFO L137 encePairwiseOnDemand]: 222/230 looper letters, 24 selfloop transitions, 5 changer transitions 16/47 dead transitions. [2023-08-29 20:18:47,764 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 47 transitions, 338 flow [2023-08-29 20:18:47,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-29 20:18:47,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-29 20:18:47,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 941 transitions. [2023-08-29 20:18:47,767 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45458937198067634 [2023-08-29 20:18:47,767 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 941 transitions. [2023-08-29 20:18:47,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 941 transitions. [2023-08-29 20:18:47,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:18:47,768 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 941 transitions. [2023-08-29 20:18:47,770 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 104.55555555555556) internal successors, (941), 9 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:47,773 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 230.0) internal successors, (2300), 10 states have internal predecessors, (2300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:47,773 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 230.0) internal successors, (2300), 10 states have internal predecessors, (2300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:47,774 INFO L175 Difference]: Start difference. First operand has 53 places, 27 transitions, 135 flow. Second operand 9 states and 941 transitions. [2023-08-29 20:18:47,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 47 transitions, 338 flow [2023-08-29 20:18:47,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 47 transitions, 311 flow, removed 10 selfloop flow, removed 6 redundant places. [2023-08-29 20:18:47,776 INFO L231 Difference]: Finished difference. Result has 55 places, 27 transitions, 136 flow [2023-08-29 20:18:47,776 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=136, PETRI_PLACES=55, PETRI_TRANSITIONS=27} [2023-08-29 20:18:47,777 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 14 predicate places. [2023-08-29 20:18:47,777 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 27 transitions, 136 flow [2023-08-29 20:18:47,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 103.375) internal successors, (827), 8 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:47,777 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:18:47,777 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] [2023-08-29 20:18:47,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-29 20:18:47,778 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:18:47,778 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:18:47,778 INFO L85 PathProgramCache]: Analyzing trace with hash 258857692, now seen corresponding path program 4 times [2023-08-29 20:18:47,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:18:47,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192107033] [2023-08-29 20:18:47,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:18:47,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:18:47,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:18:47,820 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:18:47,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:18:47,889 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 20:18:47,890 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:18:47,890 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-08-29 20:18:47,892 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-08-29 20:18:47,893 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-08-29 20:18:47,893 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-08-29 20:18:47,893 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-08-29 20:18:47,893 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-08-29 20:18:47,894 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-08-29 20:18:47,894 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-08-29 20:18:47,894 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-08-29 20:18:47,894 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-08-29 20:18:47,894 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-08-29 20:18:47,894 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-08-29 20:18:47,895 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-08-29 20:18:47,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-29 20:18:47,895 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:18:47,900 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:18:47,900 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:18:47,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:18:47 BasicIcfg [2023-08-29 20:18:47,948 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:18:47,949 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:18:47,949 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:18:47,949 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:18:47,950 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:18:36" (3/4) ... [2023-08-29 20:18:47,952 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:18:47,952 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:18:47,952 INFO L158 Benchmark]: Toolchain (without parser) took 12759.74ms. Allocated memory was 94.4MB in the beginning and 299.9MB in the end (delta: 205.5MB). Free memory was 73.6MB in the beginning and 137.8MB in the end (delta: -64.2MB). Peak memory consumption was 139.7MB. Max. memory is 16.1GB. [2023-08-29 20:18:47,953 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 65.0MB. Free memory was 42.9MB in the beginning and 42.8MB in the end (delta: 57.1kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:18:47,953 INFO L158 Benchmark]: CACSL2BoogieTranslator took 611.76ms. Allocated memory is still 94.4MB. Free memory was 73.6MB in the beginning and 71.5MB in the end (delta: 2.0MB). Peak memory consumption was 26.4MB. Max. memory is 16.1GB. [2023-08-29 20:18:47,953 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.85ms. Allocated memory is still 94.4MB. Free memory was 71.5MB in the beginning and 68.7MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:18:47,953 INFO L158 Benchmark]: Boogie Preprocessor took 44.10ms. Allocated memory is still 94.4MB. Free memory was 68.7MB in the beginning and 66.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:18:47,954 INFO L158 Benchmark]: RCFGBuilder took 732.81ms. Allocated memory is still 94.4MB. Free memory was 66.9MB in the beginning and 58.0MB in the end (delta: 8.9MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. [2023-08-29 20:18:47,954 INFO L158 Benchmark]: TraceAbstraction took 11287.92ms. Allocated memory was 94.4MB in the beginning and 299.9MB in the end (delta: 205.5MB). Free memory was 57.5MB in the beginning and 138.9MB in the end (delta: -81.3MB). Peak memory consumption was 124.1MB. Max. memory is 16.1GB. [2023-08-29 20:18:47,954 INFO L158 Benchmark]: Witness Printer took 3.26ms. Allocated memory is still 299.9MB. Free memory was 138.9MB in the beginning and 137.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:18:47,956 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.25ms. Allocated memory is still 65.0MB. Free memory was 42.9MB in the beginning and 42.8MB in the end (delta: 57.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 611.76ms. Allocated memory is still 94.4MB. Free memory was 73.6MB in the beginning and 71.5MB in the end (delta: 2.0MB). Peak memory consumption was 26.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.85ms. Allocated memory is still 94.4MB. Free memory was 71.5MB in the beginning and 68.7MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.10ms. Allocated memory is still 94.4MB. Free memory was 68.7MB in the beginning and 66.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 732.81ms. Allocated memory is still 94.4MB. Free memory was 66.9MB in the beginning and 58.0MB in the end (delta: 8.9MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. * TraceAbstraction took 11287.92ms. Allocated memory was 94.4MB in the beginning and 299.9MB in the end (delta: 205.5MB). Free memory was 57.5MB in the beginning and 138.9MB in the end (delta: -81.3MB). Peak memory consumption was 124.1MB. Max. memory is 16.1GB. * Witness Printer took 3.26ms. Allocated memory is still 299.9MB. Free memory was 138.9MB in the beginning and 137.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.1s, 124 PlacesBefore, 41 PlacesAfterwards, 116 TransitionsBefore, 32 TransitionsAfterwards, 1956 CoEnabledTransitionPairs, 7 FixpointIterations, 45 TrivialSequentialCompositions, 58 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 111 TotalNumberOfCompositions, 5209 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2714, independent: 2538, independent conditional: 0, independent unconditional: 2538, dependent: 176, dependent conditional: 0, dependent unconditional: 176, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1047, independent: 1019, independent conditional: 0, independent unconditional: 1019, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2714, independent: 1519, independent conditional: 0, independent unconditional: 1519, dependent: 148, dependent conditional: 0, dependent unconditional: 148, unknown: 1047, unknown conditional: 0, unknown unconditional: 1047] , Statistics on independence cache: Total cache size (in pairs): 107, Positive cache size: 94, Positive conditional cache size: 0, Positive unconditional cache size: 94, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L724] 0 _Bool y$flush_delayed; [L725] 0 int y$mem_tmp; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L728] 0 _Bool y$r_buff0_thd2; [L729] 0 _Bool y$r_buff0_thd3; [L730] 0 _Bool y$r_buff1_thd0; [L731] 0 _Bool y$r_buff1_thd1; [L732] 0 _Bool y$r_buff1_thd2; [L733] 0 _Bool y$r_buff1_thd3; [L734] 0 _Bool y$read_delayed; [L735] 0 int *y$read_delayed_var; [L736] 0 int y$w_buff0; [L737] 0 _Bool y$w_buff0_used; [L738] 0 int y$w_buff1; [L739] 0 _Bool y$w_buff1_used; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L843] 0 pthread_t t418; [L844] FCALL, FORK 0 pthread_create(&t418, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t418, ((void *)0), P0, ((void *)0))=7, t418={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L845] 0 pthread_t t419; [L846] FCALL, FORK 0 pthread_create(&t419, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t419, ((void *)0), P1, ((void *)0))=8, t418={5:0}, t419={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L847] 0 pthread_t t420; [L848] FCALL, FORK 0 pthread_create(&t420, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t420, ((void *)0), P2, ((void *)0))=9, t418={5:0}, t419={6:0}, t420={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L790] 3 y$w_buff1 = y$w_buff0 [L791] 3 y$w_buff0 = 1 [L792] 3 y$w_buff1_used = y$w_buff0_used [L793] 3 y$w_buff0_used = (_Bool)1 [L794] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L794] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L795] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L796] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L797] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L798] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L799] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L802] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L803] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L804] 3 y$flush_delayed = weak$$choice2 [L805] 3 y$mem_tmp = y [L806] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L807] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L808] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L809] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L810] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L811] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L812] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] 3 __unbuffered_p2_EAX = y [L814] 3 y = y$flush_delayed ? y$mem_tmp : y [L815] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L818] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L747] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L750] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L762] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 y$flush_delayed = weak$$choice2 [L768] 2 y$mem_tmp = y [L769] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L770] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L771] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L772] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L773] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L775] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 __unbuffered_p1_EAX = y [L777] 2 y = y$flush_delayed ? y$mem_tmp : y [L778] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L821] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L822] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L823] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L824] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L825] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L757] 1 return 0; [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L830] 3 return 0; [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L852] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L852] RET 0 assume_abort_if_not(main$tmp_guard0) [L854] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L856] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L857] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L858] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t418={5:0}, t419={6:0}, t420={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L861] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L863] 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}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 841]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 846]: 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: 848]: 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: 844]: 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 7 procedures, 145 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.1s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 552 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 452 mSDsluCounter, 226 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 196 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1475 IncrementalHoareTripleChecker+Invalid, 1520 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 30 mSDtfsCounter, 1475 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=223occurred in iteration=7, InterpolantAutomatonStates: 67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 187 NumberOfCodeBlocks, 187 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 154 ConstructedInterpolants, 0 QuantifiedInterpolants, 1068 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-29 20:18:47,974 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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/mix016_pso.opt_tso.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 2135a1882b0d27098e68a161f8694a670a72069d61776627736073247b8e4e23 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 20:18:49,880 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:18:49,882 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:18:49,926 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:18:49,928 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:18:49,931 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:18:49,942 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:18:49,945 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:18:49,947 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:18:49,951 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:18:49,952 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:18:49,955 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:18:49,955 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:18:49,957 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:18:49,958 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:18:49,963 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:18:49,964 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:18:49,965 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:18:49,967 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:18:49,971 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:18:49,972 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:18:49,973 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:18:49,974 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:18:49,975 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:18:49,981 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:18:49,981 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:18:49,981 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:18:49,983 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:18:49,984 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:18:49,984 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:18:49,984 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:18:49,989 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:18:49,991 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:18:49,992 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:18:49,993 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:18:49,993 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:18:49,993 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:18:49,994 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:18:49,994 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:18:49,994 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:18:49,995 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:18:49,996 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-29 20:18:50,028 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:18:50,028 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:18:50,029 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:18:50,029 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:18:50,030 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:18:50,030 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:18:50,031 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:18:50,031 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:18:50,031 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:18:50,031 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:18:50,032 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:18:50,032 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:18:50,033 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:18:50,033 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:18:50,033 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:18:50,033 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:18:50,033 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:18:50,033 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:18:50,034 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:18:50,034 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:18:50,034 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-29 20:18:50,034 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-29 20:18:50,034 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:18:50,034 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:18:50,035 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:18:50,035 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:18:50,035 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:18:50,035 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:18:50,035 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:18:50,036 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:18:50,036 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-29 20:18:50,036 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-29 20:18:50,036 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:18:50,036 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:18:50,037 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:18:50,037 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-29 20:18:50,037 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:18:50,037 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 -> 2135a1882b0d27098e68a161f8694a670a72069d61776627736073247b8e4e23 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-29 20:18:50,324 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:18:50,347 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:18:50,350 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:18:50,352 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:18:50,352 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:18:50,353 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix016_pso.opt_tso.opt.i [2023-08-29 20:18:51,548 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:18:51,760 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:18:51,761 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix016_pso.opt_tso.opt.i [2023-08-29 20:18:51,779 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f47308799/3d91a3f77e534aa4a5535a971be6e2e2/FLAG10ecc25fc [2023-08-29 20:18:51,793 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f47308799/3d91a3f77e534aa4a5535a971be6e2e2 [2023-08-29 20:18:51,795 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:18:51,796 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:18:51,797 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:18:51,797 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:18:51,800 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:18:51,800 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:18:51" (1/1) ... [2023-08-29 20:18:51,801 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48bae38a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:18:51, skipping insertion in model container [2023-08-29 20:18:51,802 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:18:51" (1/1) ... [2023-08-29 20:18:51,807 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:18:51,840 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:18:52,019 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/mix016_pso.opt_tso.opt.i[956,969] [2023-08-29 20:18:52,264 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:18:52,279 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:18:52,293 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/mix016_pso.opt_tso.opt.i[956,969] [2023-08-29 20:18:52,341 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:18:52,379 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:18:52,380 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:18:52,386 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:18:52,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:18:52 WrapperNode [2023-08-29 20:18:52,386 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:18:52,387 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:18:52,388 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:18:52,388 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:18:52,394 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:18:52" (1/1) ... [2023-08-29 20:18:52,412 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:18:52" (1/1) ... [2023-08-29 20:18:52,438 INFO L138 Inliner]: procedures = 179, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 151 [2023-08-29 20:18:52,439 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:18:52,440 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:18:52,440 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:18:52,440 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:18:52,447 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:18:52" (1/1) ... [2023-08-29 20:18:52,448 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:18:52" (1/1) ... [2023-08-29 20:18:52,451 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:18:52" (1/1) ... [2023-08-29 20:18:52,451 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:18:52" (1/1) ... [2023-08-29 20:18:52,459 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:18:52" (1/1) ... [2023-08-29 20:18:52,461 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:18:52" (1/1) ... [2023-08-29 20:18:52,463 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:18:52" (1/1) ... [2023-08-29 20:18:52,465 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:18:52" (1/1) ... [2023-08-29 20:18:52,468 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:18:52,469 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:18:52,469 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:18:52,469 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:18:52,470 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:18:52" (1/1) ... [2023-08-29 20:18:52,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:18:52,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:18:52,502 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-29 20:18:52,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-29 20:18:52,540 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:18:52,541 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:18:52,541 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:18:52,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:18:52,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-29 20:18:52,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-29 20:18:52,541 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:18:52,542 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:18:52,542 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:18:52,542 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:18:52,542 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-29 20:18:52,542 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-29 20:18:52,542 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:18:52,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:18:52,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:18:52,544 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 20:18:52,734 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:18:52,736 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:18:53,174 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:18:53,318 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:18:53,319 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:18:53,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:18:53 BoogieIcfgContainer [2023-08-29 20:18:53,321 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:18:53,323 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:18:53,324 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:18:53,326 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:18:53,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:18:51" (1/3) ... [2023-08-29 20:18:53,327 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d1511ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:18:53, skipping insertion in model container [2023-08-29 20:18:53,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:18:52" (2/3) ... [2023-08-29 20:18:53,328 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d1511ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:18:53, skipping insertion in model container [2023-08-29 20:18:53,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:18:53" (3/3) ... [2023-08-29 20:18:53,329 INFO L112 eAbstractionObserver]: Analyzing ICFG mix016_pso.opt_tso.opt.i [2023-08-29 20:18:53,345 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:18:53,345 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-08-29 20:18:53,345 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:18:53,409 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:18:53,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 120 transitions, 255 flow [2023-08-29 20:18:53,492 INFO L130 PetriNetUnfolder]: 2/117 cut-off events. [2023-08-29 20:18:53,493 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:18:53,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 117 events. 2/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 78 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2023-08-29 20:18:53,498 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 120 transitions, 255 flow [2023-08-29 20:18:53,504 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 125 places, 117 transitions, 243 flow [2023-08-29 20:18:53,507 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:18:53,515 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 117 transitions, 243 flow [2023-08-29 20:18:53,517 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 117 transitions, 243 flow [2023-08-29 20:18:53,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 117 transitions, 243 flow [2023-08-29 20:18:53,555 INFO L130 PetriNetUnfolder]: 2/117 cut-off events. [2023-08-29 20:18:53,556 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:18:53,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 117 events. 2/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 77 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2023-08-29 20:18:53,567 INFO L119 LiptonReduction]: Number of co-enabled transitions 1956 [2023-08-29 20:18:59,374 INFO L134 LiptonReduction]: Checked pairs total: 4520 [2023-08-29 20:18:59,375 INFO L136 LiptonReduction]: Total number of compositions: 120 [2023-08-29 20:18:59,388 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:18:59,393 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;@5016f0b5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:18:59,393 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-08-29 20:18:59,395 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-29 20:18:59,395 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:18:59,395 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:18:59,396 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:18:59,396 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:18:59,400 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:18:59,401 INFO L85 PathProgramCache]: Analyzing trace with hash 545, now seen corresponding path program 1 times [2023-08-29 20:18:59,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:18:59,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1351821646] [2023-08-29 20:18:59,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:18:59,412 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:18:59,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:18:59,419 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:18:59,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-08-29 20:18:59,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:18:59,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-29 20:18:59,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:18:59,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:18:59,503 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:18:59,503 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:18:59,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1351821646] [2023-08-29 20:18:59,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1351821646] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:18:59,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:18:59,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:18:59,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020186198] [2023-08-29 20:18:59,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:18:59,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:18:59,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:18:59,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:18:59,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:18:59,535 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 240 [2023-08-29 20:18:59,537 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 71 flow. Second operand has 2 states, 2 states have (on average 108.5) internal successors, (217), 2 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:59,537 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:18:59,537 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 240 [2023-08-29 20:18:59,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:18:59,987 INFO L130 PetriNetUnfolder]: 1101/1673 cut-off events. [2023-08-29 20:18:59,988 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2023-08-29 20:18:59,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3346 conditions, 1673 events. 1101/1673 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 7786 event pairs, 1101 based on Foata normal form. 0/1420 useless extension candidates. Maximal degree in co-relation 3335. Up to 1637 conditions per place. [2023-08-29 20:19:00,019 INFO L137 encePairwiseOnDemand]: 233/240 looper letters, 22 selfloop transitions, 0 changer transitions 0/24 dead transitions. [2023-08-29 20:19:00,019 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 24 transitions, 101 flow [2023-08-29 20:19:00,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:19:00,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:19:00,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 245 transitions. [2023-08-29 20:19:00,035 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5104166666666666 [2023-08-29 20:19:00,036 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 245 transitions. [2023-08-29 20:19:00,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 245 transitions. [2023-08-29 20:19:00,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:19:00,040 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 245 transitions. [2023-08-29 20:19:00,046 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 122.5) internal successors, (245), 2 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:00,052 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 240.0) internal successors, (720), 3 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:00,053 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 240.0) internal successors, (720), 3 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:00,055 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 71 flow. Second operand 2 states and 245 transitions. [2023-08-29 20:19:00,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 24 transitions, 101 flow [2023-08-29 20:19:00,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 24 transitions, 98 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 20:19:00,062 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 54 flow [2023-08-29 20:19:00,064 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=54, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2023-08-29 20:19:00,067 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -8 predicate places. [2023-08-29 20:19:00,068 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 54 flow [2023-08-29 20:19:00,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 108.5) internal successors, (217), 2 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:00,068 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:19:00,069 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:19:00,084 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-29 20:19:00,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:19:00,278 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:19:00,279 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:19:00,279 INFO L85 PathProgramCache]: Analyzing trace with hash 618869119, now seen corresponding path program 1 times [2023-08-29 20:19:00,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:19:00,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1919756948] [2023-08-29 20:19:00,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:19:00,280 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:19:00,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:19:00,282 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:19:00,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-08-29 20:19:00,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:19:00,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:19:00,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:19:00,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:19:00,390 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:19:00,390 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:19:00,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1919756948] [2023-08-29 20:19:00,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1919756948] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:19:00,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:19:00,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:19:00,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519959582] [2023-08-29 20:19:00,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:19:00,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:19:00,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:19:00,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:19:00,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:19:00,397 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 240 [2023-08-29 20:19:00,397 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:00,397 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:19:00,398 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 240 [2023-08-29 20:19:00,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:19:00,628 INFO L130 PetriNetUnfolder]: 910/1446 cut-off events. [2023-08-29 20:19:00,628 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:19:00,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2842 conditions, 1446 events. 910/1446 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 7007 event pairs, 146 based on Foata normal form. 0/1325 useless extension candidates. Maximal degree in co-relation 2839. Up to 1101 conditions per place. [2023-08-29 20:19:00,636 INFO L137 encePairwiseOnDemand]: 237/240 looper letters, 28 selfloop transitions, 2 changer transitions 2/34 dead transitions. [2023-08-29 20:19:00,637 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 34 transitions, 138 flow [2023-08-29 20:19:00,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:19:00,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:19:00,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 354 transitions. [2023-08-29 20:19:00,643 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49166666666666664 [2023-08-29 20:19:00,643 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 354 transitions. [2023-08-29 20:19:00,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 354 transitions. [2023-08-29 20:19:00,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:19:00,643 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 354 transitions. [2023-08-29 20:19:00,645 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:00,648 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:00,649 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:00,649 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 54 flow. Second operand 3 states and 354 transitions. [2023-08-29 20:19:00,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 34 transitions, 138 flow [2023-08-29 20:19:00,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 34 transitions, 138 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:19:00,650 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 54 flow [2023-08-29 20:19:00,650 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2023-08-29 20:19:00,651 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -7 predicate places. [2023-08-29 20:19:00,652 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 54 flow [2023-08-29 20:19:00,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:00,652 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:19:00,652 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:19:00,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-08-29 20:19:00,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:19:00,862 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:19:00,863 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:19:00,863 INFO L85 PathProgramCache]: Analyzing trace with hash 2027779260, now seen corresponding path program 1 times [2023-08-29 20:19:00,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:19:00,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1965453688] [2023-08-29 20:19:00,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:19:00,864 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:19:00,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:19:00,865 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:19:00,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-08-29 20:19:00,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:19:00,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:19:00,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:19:00,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:19:00,983 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:19:00,984 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:19:00,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1965453688] [2023-08-29 20:19:00,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1965453688] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:19:00,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:19:00,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:19:00,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24226844] [2023-08-29 20:19:00,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:19:00,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:19:00,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:19:00,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:19:00,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:19:01,004 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 240 [2023-08-29 20:19:01,005 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 105.25) internal successors, (421), 4 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:01,005 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:19:01,006 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 240 [2023-08-29 20:19:01,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:19:01,235 INFO L130 PetriNetUnfolder]: 514/852 cut-off events. [2023-08-29 20:19:01,236 INFO L131 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2023-08-29 20:19:01,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1788 conditions, 852 events. 514/852 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3824 event pairs, 96 based on Foata normal form. 60/875 useless extension candidates. Maximal degree in co-relation 1784. Up to 609 conditions per place. [2023-08-29 20:19:01,240 INFO L137 encePairwiseOnDemand]: 234/240 looper letters, 29 selfloop transitions, 4 changer transitions 19/54 dead transitions. [2023-08-29 20:19:01,241 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 54 transitions, 232 flow [2023-08-29 20:19:01,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:19:01,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:19:01,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 569 transitions. [2023-08-29 20:19:01,243 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4741666666666667 [2023-08-29 20:19:01,243 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 569 transitions. [2023-08-29 20:19:01,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 569 transitions. [2023-08-29 20:19:01,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:19:01,244 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 569 transitions. [2023-08-29 20:19:01,246 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 113.8) internal successors, (569), 5 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:01,249 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 240.0) internal successors, (1440), 6 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:01,250 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 240.0) internal successors, (1440), 6 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:01,250 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 54 flow. Second operand 5 states and 569 transitions. [2023-08-29 20:19:01,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 54 transitions, 232 flow [2023-08-29 20:19:01,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 54 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:19:01,254 INFO L231 Difference]: Finished difference. Result has 37 places, 25 transitions, 86 flow [2023-08-29 20:19:01,254 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=86, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2023-08-29 20:19:01,255 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places. [2023-08-29 20:19:01,255 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 86 flow [2023-08-29 20:19:01,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 105.25) internal successors, (421), 4 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:01,256 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:19:01,256 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:19:01,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 (4)] Forceful destruction successful, exit code 0 [2023-08-29 20:19:01,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:19:01,466 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:19:01,467 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:19:01,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1266146423, now seen corresponding path program 1 times [2023-08-29 20:19:01,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:19:01,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1962255722] [2023-08-29 20:19:01,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:19:01,468 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:19:01,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:19:01,469 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:19:01,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-08-29 20:19:01,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:19:01,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:19:01,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:19:01,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:19:01,607 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:19:01,607 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:19:01,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1962255722] [2023-08-29 20:19:01,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1962255722] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:19:01,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:19:01,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:19:01,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713226817] [2023-08-29 20:19:01,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:19:01,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:19:01,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:19:01,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:19:01,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:19:01,628 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 240 [2023-08-29 20:19:01,629 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 86 flow. Second operand has 5 states, 5 states have (on average 105.2) internal successors, (526), 5 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:01,629 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:19:01,629 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 240 [2023-08-29 20:19:01,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:19:01,839 INFO L130 PetriNetUnfolder]: 208/392 cut-off events. [2023-08-29 20:19:01,839 INFO L131 PetriNetUnfolder]: For 147/147 co-relation queries the response was YES. [2023-08-29 20:19:01,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1071 conditions, 392 events. 208/392 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1514 event pairs, 44 based on Foata normal form. 36/417 useless extension candidates. Maximal degree in co-relation 1064. Up to 136 conditions per place. [2023-08-29 20:19:01,842 INFO L137 encePairwiseOnDemand]: 234/240 looper letters, 37 selfloop transitions, 7 changer transitions 19/65 dead transitions. [2023-08-29 20:19:01,842 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 65 transitions, 336 flow [2023-08-29 20:19:01,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:19:01,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:19:01,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 683 transitions. [2023-08-29 20:19:01,845 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47430555555555554 [2023-08-29 20:19:01,845 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 683 transitions. [2023-08-29 20:19:01,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 683 transitions. [2023-08-29 20:19:01,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:19:01,845 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 683 transitions. [2023-08-29 20:19:01,847 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 113.83333333333333) internal successors, (683), 6 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:01,849 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 240.0) internal successors, (1680), 7 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:01,850 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 240.0) internal successors, (1680), 7 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:01,850 INFO L175 Difference]: Start difference. First operand has 37 places, 25 transitions, 86 flow. Second operand 6 states and 683 transitions. [2023-08-29 20:19:01,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 65 transitions, 336 flow [2023-08-29 20:19:01,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 65 transitions, 330 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-29 20:19:01,853 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 136 flow [2023-08-29 20:19:01,854 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=136, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2023-08-29 20:19:01,855 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2023-08-29 20:19:01,855 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 136 flow [2023-08-29 20:19:01,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.2) internal successors, (526), 5 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:01,856 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:19:01,856 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:19:01,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-08-29 20:19:02,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:19:02,066 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:19:02,066 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:19:02,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1095360954, now seen corresponding path program 1 times [2023-08-29 20:19:02,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:19:02,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [499895153] [2023-08-29 20:19:02,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:19:02,067 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:19:02,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:19:02,069 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:19:02,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-08-29 20:19:02,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:19:02,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-29 20:19:02,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:19:02,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:19:02,207 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:19:02,207 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:19:02,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [499895153] [2023-08-29 20:19:02,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [499895153] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:19:02,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:19:02,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:19:02,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775183522] [2023-08-29 20:19:02,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:19:02,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:19:02,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:19:02,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:19:02,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:19:02,231 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 240 [2023-08-29 20:19:02,233 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 136 flow. Second operand has 6 states, 6 states have (on average 105.33333333333333) internal successors, (632), 6 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:02,233 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:19:02,233 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 240 [2023-08-29 20:19:02,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:19:02,469 INFO L130 PetriNetUnfolder]: 120/233 cut-off events. [2023-08-29 20:19:02,469 INFO L131 PetriNetUnfolder]: For 263/263 co-relation queries the response was YES. [2023-08-29 20:19:02,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 713 conditions, 233 events. 120/233 cut-off events. For 263/263 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 768 event pairs, 39 based on Foata normal form. 10/241 useless extension candidates. Maximal degree in co-relation 704. Up to 90 conditions per place. [2023-08-29 20:19:02,470 INFO L137 encePairwiseOnDemand]: 234/240 looper letters, 34 selfloop transitions, 10 changer transitions 10/56 dead transitions. [2023-08-29 20:19:02,471 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 56 transitions, 334 flow [2023-08-29 20:19:02,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:19:02,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:19:02,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 777 transitions. [2023-08-29 20:19:02,473 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4625 [2023-08-29 20:19:02,473 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 777 transitions. [2023-08-29 20:19:02,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 777 transitions. [2023-08-29 20:19:02,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:19:02,474 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 777 transitions. [2023-08-29 20:19:02,476 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 111.0) internal successors, (777), 7 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:02,478 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 240.0) internal successors, (1920), 8 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:02,479 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 240.0) internal successors, (1920), 8 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:02,479 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 136 flow. Second operand 7 states and 777 transitions. [2023-08-29 20:19:02,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 56 transitions, 334 flow [2023-08-29 20:19:02,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 56 transitions, 298 flow, removed 14 selfloop flow, removed 4 redundant places. [2023-08-29 20:19:02,483 INFO L231 Difference]: Finished difference. Result has 44 places, 28 transitions, 138 flow [2023-08-29 20:19:02,483 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=138, PETRI_PLACES=44, PETRI_TRANSITIONS=28} [2023-08-29 20:19:02,484 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 4 predicate places. [2023-08-29 20:19:02,484 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 28 transitions, 138 flow [2023-08-29 20:19:02,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 105.33333333333333) internal successors, (632), 6 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:02,485 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:19:02,485 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-29 20:19:02,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-08-29 20:19:02,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:19:02,694 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:19:02,695 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:19:02,695 INFO L85 PathProgramCache]: Analyzing trace with hash -869200437, now seen corresponding path program 1 times [2023-08-29 20:19:02,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:19:02,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [25900317] [2023-08-29 20:19:02,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:19:02,696 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:19:02,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:19:02,697 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:19:02,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-08-29 20:19:02,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:19:02,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:19:02,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:19:02,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:19:02,835 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:19:02,835 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:19:02,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [25900317] [2023-08-29 20:19:02,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [25900317] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:19:02,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:19:02,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:19:02,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456611307] [2023-08-29 20:19:02,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:19:02,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:19:02,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:19:02,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:19:02,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:19:02,846 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 240 [2023-08-29 20:19:02,846 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 28 transitions, 138 flow. Second operand has 4 states, 4 states have (on average 108.75) internal successors, (435), 4 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:02,847 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:19:02,847 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 240 [2023-08-29 20:19:02,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:19:03,020 INFO L130 PetriNetUnfolder]: 202/378 cut-off events. [2023-08-29 20:19:03,020 INFO L131 PetriNetUnfolder]: For 418/418 co-relation queries the response was YES. [2023-08-29 20:19:03,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1145 conditions, 378 events. 202/378 cut-off events. For 418/418 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1476 event pairs, 35 based on Foata normal form. 0/377 useless extension candidates. Maximal degree in co-relation 1135. Up to 203 conditions per place. [2023-08-29 20:19:03,023 INFO L137 encePairwiseOnDemand]: 237/240 looper letters, 55 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2023-08-29 20:19:03,023 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 58 transitions, 410 flow [2023-08-29 20:19:03,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:19:03,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:19:03,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 460 transitions. [2023-08-29 20:19:03,025 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4791666666666667 [2023-08-29 20:19:03,025 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 460 transitions. [2023-08-29 20:19:03,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 460 transitions. [2023-08-29 20:19:03,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:19:03,026 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 460 transitions. [2023-08-29 20:19:03,027 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:03,028 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 240.0) internal successors, (1200), 5 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:03,029 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 240.0) internal successors, (1200), 5 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:03,029 INFO L175 Difference]: Start difference. First operand has 44 places, 28 transitions, 138 flow. Second operand 4 states and 460 transitions. [2023-08-29 20:19:03,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 58 transitions, 410 flow [2023-08-29 20:19:03,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 58 transitions, 330 flow, removed 24 selfloop flow, removed 6 redundant places. [2023-08-29 20:19:03,033 INFO L231 Difference]: Finished difference. Result has 41 places, 29 transitions, 113 flow [2023-08-29 20:19:03,033 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=41, PETRI_TRANSITIONS=29} [2023-08-29 20:19:03,034 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2023-08-29 20:19:03,034 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 113 flow [2023-08-29 20:19:03,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.75) internal successors, (435), 4 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:03,035 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:19:03,035 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-29 20:19:03,042 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-08-29 20:19:03,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:19:03,237 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:19:03,237 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:19:03,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1964655285, now seen corresponding path program 2 times [2023-08-29 20:19:03,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:19:03,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [572462097] [2023-08-29 20:19:03,238 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 20:19:03,238 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:19:03,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:19:03,239 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:19:03,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-08-29 20:19:03,344 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-29 20:19:03,345 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:19:03,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:19:03,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:19:03,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:19:03,387 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:19:03,387 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:19:03,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [572462097] [2023-08-29 20:19:03,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [572462097] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:19:03,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:19:03,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:19:03,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628854981] [2023-08-29 20:19:03,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:19:03,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:19:03,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:19:03,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:19:03,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:19:03,396 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 240 [2023-08-29 20:19:03,396 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 113 flow. Second operand has 4 states, 4 states have (on average 108.75) internal successors, (435), 4 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:03,397 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:19:03,397 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 240 [2023-08-29 20:19:03,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:19:03,550 INFO L130 PetriNetUnfolder]: 227/470 cut-off events. [2023-08-29 20:19:03,551 INFO L131 PetriNetUnfolder]: For 488/488 co-relation queries the response was YES. [2023-08-29 20:19:03,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1385 conditions, 470 events. 227/470 cut-off events. For 488/488 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2182 event pairs, 36 based on Foata normal form. 1/468 useless extension candidates. Maximal degree in co-relation 1376. Up to 277 conditions per place. [2023-08-29 20:19:03,554 INFO L137 encePairwiseOnDemand]: 237/240 looper letters, 55 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2023-08-29 20:19:03,554 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 59 transitions, 349 flow [2023-08-29 20:19:03,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:19:03,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:19:03,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 460 transitions. [2023-08-29 20:19:03,556 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4791666666666667 [2023-08-29 20:19:03,556 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 460 transitions. [2023-08-29 20:19:03,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 460 transitions. [2023-08-29 20:19:03,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:19:03,557 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 460 transitions. [2023-08-29 20:19:03,558 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:03,560 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 240.0) internal successors, (1200), 5 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:03,560 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 240.0) internal successors, (1200), 5 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:03,560 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 113 flow. Second operand 4 states and 460 transitions. [2023-08-29 20:19:03,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 59 transitions, 349 flow [2023-08-29 20:19:03,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 59 transitions, 346 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:19:03,565 INFO L231 Difference]: Finished difference. Result has 45 places, 30 transitions, 125 flow [2023-08-29 20:19:03,565 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=125, PETRI_PLACES=45, PETRI_TRANSITIONS=30} [2023-08-29 20:19:03,565 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 5 predicate places. [2023-08-29 20:19:03,566 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 30 transitions, 125 flow [2023-08-29 20:19:03,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.75) internal successors, (435), 4 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:03,566 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:19:03,566 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-29 20:19:03,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-08-29 20:19:03,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:19:03,781 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:19:03,782 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:19:03,782 INFO L85 PathProgramCache]: Analyzing trace with hash 193317673, now seen corresponding path program 3 times [2023-08-29 20:19:03,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:19:03,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [518506739] [2023-08-29 20:19:03,782 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-29 20:19:03,782 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:19:03,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:19:03,783 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:19:03,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-08-29 20:19:03,879 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-29 20:19:03,880 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:19:03,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 19 conjunts are in the unsatisfiable core [2023-08-29 20:19:03,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:19:04,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:19:04,697 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:19:04,697 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:19:04,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [518506739] [2023-08-29 20:19:04,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [518506739] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:19:04,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:19:04,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:19:04,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503178613] [2023-08-29 20:19:04,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:19:04,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:19:04,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:19:04,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:19:04,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:19:04,758 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 240 [2023-08-29 20:19:04,759 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 30 transitions, 125 flow. Second operand has 7 states, 7 states have (on average 104.57142857142857) internal successors, (732), 7 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:04,759 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:19:04,759 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 240 [2023-08-29 20:19:04,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:19:05,089 INFO L130 PetriNetUnfolder]: 226/494 cut-off events. [2023-08-29 20:19:05,090 INFO L131 PetriNetUnfolder]: For 554/554 co-relation queries the response was YES. [2023-08-29 20:19:05,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1545 conditions, 494 events. 226/494 cut-off events. For 554/554 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2390 event pairs, 58 based on Foata normal form. 1/483 useless extension candidates. Maximal degree in co-relation 1534. Up to 136 conditions per place. [2023-08-29 20:19:05,093 INFO L137 encePairwiseOnDemand]: 233/240 looper letters, 54 selfloop transitions, 7 changer transitions 0/65 dead transitions. [2023-08-29 20:19:05,093 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 65 transitions, 419 flow [2023-08-29 20:19:05,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:19:05,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:19:05,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 860 transitions. [2023-08-29 20:19:05,097 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4479166666666667 [2023-08-29 20:19:05,097 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 860 transitions. [2023-08-29 20:19:05,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 860 transitions. [2023-08-29 20:19:05,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:19:05,098 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 860 transitions. [2023-08-29 20:19:05,099 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 107.5) internal successors, (860), 8 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:05,102 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 240.0) internal successors, (2160), 9 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:05,103 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 240.0) internal successors, (2160), 9 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:05,103 INFO L175 Difference]: Start difference. First operand has 45 places, 30 transitions, 125 flow. Second operand 8 states and 860 transitions. [2023-08-29 20:19:05,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 65 transitions, 419 flow [2023-08-29 20:19:05,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 65 transitions, 414 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:19:05,108 INFO L231 Difference]: Finished difference. Result has 53 places, 32 transitions, 150 flow [2023-08-29 20:19:05,108 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=150, PETRI_PLACES=53, PETRI_TRANSITIONS=32} [2023-08-29 20:19:05,110 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 13 predicate places. [2023-08-29 20:19:05,110 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 32 transitions, 150 flow [2023-08-29 20:19:05,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 104.57142857142857) internal successors, (732), 7 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:05,111 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:19:05,111 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-29 20:19:05,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-08-29 20:19:05,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:19:05,322 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:19:05,323 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:19:05,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1004619655, now seen corresponding path program 4 times [2023-08-29 20:19:05,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:19:05,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1715733125] [2023-08-29 20:19:05,324 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-29 20:19:05,324 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:19:05,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:19:05,325 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:19:05,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-08-29 20:19:05,460 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-29 20:19:05,461 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-29 20:19:05,461 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:19:05,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:19:05,617 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-29 20:19:05,618 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:19:05,619 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-08-29 20:19:05,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-08-29 20:19:05,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-08-29 20:19:05,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-08-29 20:19:05,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-08-29 20:19:05,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-08-29 20:19:05,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-08-29 20:19:05,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-08-29 20:19:05,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-08-29 20:19:05,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-08-29 20:19:05,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-08-29 20:19:05,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-08-29 20:19:05,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-08-29 20:19:05,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-08-29 20:19:05,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:19:05,835 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2023-08-29 20:19:05,840 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:19:05,840 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:19:05,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:19:05 BasicIcfg [2023-08-29 20:19:05,919 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:19:05,920 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:19:05,920 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:19:05,920 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:19:05,921 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:18:53" (3/4) ... [2023-08-29 20:19:05,923 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:19:05,923 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:19:05,924 INFO L158 Benchmark]: Toolchain (without parser) took 14127.96ms. Allocated memory was 75.5MB in the beginning and 134.2MB in the end (delta: 58.7MB). Free memory was 45.8MB in the beginning and 86.2MB in the end (delta: -40.4MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. [2023-08-29 20:19:05,924 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 75.5MB. Free memory is still 52.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:19:05,924 INFO L158 Benchmark]: CACSL2BoogieTranslator took 589.68ms. Allocated memory is still 75.5MB. Free memory was 45.6MB in the beginning and 44.0MB in the end (delta: 1.6MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. [2023-08-29 20:19:05,925 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.62ms. Allocated memory is still 75.5MB. Free memory was 44.0MB in the beginning and 41.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:19:05,925 INFO L158 Benchmark]: Boogie Preprocessor took 28.62ms. Allocated memory is still 75.5MB. Free memory was 41.4MB in the beginning and 39.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:19:05,925 INFO L158 Benchmark]: RCFGBuilder took 851.97ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 39.1MB in the beginning and 61.1MB in the end (delta: -22.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-08-29 20:19:05,925 INFO L158 Benchmark]: TraceAbstraction took 12596.35ms. Allocated memory was 92.3MB in the beginning and 134.2MB in the end (delta: 41.9MB). Free memory was 60.5MB in the beginning and 86.2MB in the end (delta: -25.7MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. [2023-08-29 20:19:05,926 INFO L158 Benchmark]: Witness Printer took 3.28ms. Allocated memory is still 134.2MB. Free memory is still 86.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:19:05,927 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 75.5MB. Free memory is still 52.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 589.68ms. Allocated memory is still 75.5MB. Free memory was 45.6MB in the beginning and 44.0MB in the end (delta: 1.6MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.62ms. Allocated memory is still 75.5MB. Free memory was 44.0MB in the beginning and 41.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.62ms. Allocated memory is still 75.5MB. Free memory was 41.4MB in the beginning and 39.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 851.97ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 39.1MB in the beginning and 61.1MB in the end (delta: -22.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 12596.35ms. Allocated memory was 92.3MB in the beginning and 134.2MB in the end (delta: 41.9MB). Free memory was 60.5MB in the beginning and 86.2MB in the end (delta: -25.7MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. * Witness Printer took 3.28ms. Allocated memory is still 134.2MB. Free memory is still 86.2MB. 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: 5.9s, 125 PlacesBefore, 40 PlacesAfterwards, 117 TransitionsBefore, 31 TransitionsAfterwards, 1956 CoEnabledTransitionPairs, 6 FixpointIterations, 52 TrivialSequentialCompositions, 60 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 120 TotalNumberOfCompositions, 4520 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2338, independent: 2193, independent conditional: 0, independent unconditional: 2193, dependent: 145, dependent conditional: 0, dependent unconditional: 145, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1063, independent: 1032, independent conditional: 0, independent unconditional: 1032, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2338, independent: 1161, independent conditional: 0, independent unconditional: 1161, dependent: 114, dependent conditional: 0, dependent unconditional: 114, unknown: 1063, unknown conditional: 0, unknown unconditional: 1063] , Statistics on independence cache: Total cache size (in pairs): 90, Positive cache size: 78, Positive conditional cache size: 0, Positive unconditional cache size: 78, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L724] 0 _Bool y$flush_delayed; [L725] 0 int y$mem_tmp; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L728] 0 _Bool y$r_buff0_thd2; [L729] 0 _Bool y$r_buff0_thd3; [L730] 0 _Bool y$r_buff1_thd0; [L731] 0 _Bool y$r_buff1_thd1; [L732] 0 _Bool y$r_buff1_thd2; [L733] 0 _Bool y$r_buff1_thd3; [L734] 0 _Bool y$read_delayed; [L735] 0 int *y$read_delayed_var; [L736] 0 int y$w_buff0; [L737] 0 _Bool y$w_buff0_used; [L738] 0 int y$w_buff1; [L739] 0 _Bool y$w_buff1_used; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L843] 0 pthread_t t418; [L844] FCALL, FORK 0 pthread_create(&t418, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t418, ((void *)0), P0, ((void *)0))=0, t418={-6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L845] 0 pthread_t t419; [L846] FCALL, FORK 0 pthread_create(&t419, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t419, ((void *)0), P1, ((void *)0))=1, t418={-6:0}, t419={-10:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L847] 0 pthread_t t420; [L848] FCALL, FORK 0 pthread_create(&t420, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t420, ((void *)0), P2, ((void *)0))=2, t418={-6:0}, t419={-10:0}, t420={-2:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L790] 3 y$w_buff1 = y$w_buff0 [L791] 3 y$w_buff0 = 1 [L792] 3 y$w_buff1_used = y$w_buff0_used [L793] 3 y$w_buff0_used = (_Bool)1 [L794] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L794] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L795] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L796] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L797] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L798] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L799] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L802] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L803] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L804] 3 y$flush_delayed = weak$$choice2 [L805] 3 y$mem_tmp = y [L806] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L807] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L808] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L809] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L810] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L811] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L812] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] 3 __unbuffered_p2_EAX = y [L814] 3 y = y$flush_delayed ? y$mem_tmp : y [L815] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L818] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L747] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L750] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L762] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L757] 1 return 0; [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 y$flush_delayed = weak$$choice2 [L768] 2 y$mem_tmp = y [L769] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L770] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L771] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L772] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L773] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L775] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 __unbuffered_p1_EAX = y [L777] 2 y = y$flush_delayed ? y$mem_tmp : y [L778] 2 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L821] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L822] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L823] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L824] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L825] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L830] 3 return 0; [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L852] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L852] RET 0 assume_abort_if_not(main$tmp_guard0) [L854] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L856] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L857] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L858] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t418={-6:0}, t419={-10:0}, t420={-2:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L861] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L863] 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}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 841]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 846]: 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: 848]: 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: 844]: 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 7 procedures, 146 locations, 13 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: 12.4s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 243 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 201 mSDsluCounter, 74 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 64 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 995 IncrementalHoareTripleChecker+Invalid, 1026 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 10 mSDtfsCounter, 995 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 103 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=150occurred in iteration=8, InterpolantAutomatonStates: 39, 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.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 124 NumberOfCodeBlocks, 124 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 96 ConstructedInterpolants, 0 QuantifiedInterpolants, 461 SizeOfPredicates, 10 NumberOfNonLiveVariables, 946 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-29 20:19:05,965 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