./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix037_power.oepc_pso.oepc_rmo.oepc.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/mix037_power.oepc_pso.oepc_rmo.oepc.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 82646a2180350347ed217a12e2836ec5fdce4b0371f5e0f7afa776fd6812fa0f --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:25:32,364 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:25:32,366 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:25:32,407 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:25:32,409 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:25:32,412 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:25:32,420 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:25:32,423 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:25:32,425 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:25:32,429 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:25:32,431 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:25:32,433 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:25:32,434 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:25:32,435 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:25:32,437 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:25:32,442 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:25:32,443 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:25:32,444 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:25:32,446 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:25:32,450 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:25:32,452 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:25:32,453 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:25:32,454 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:25:32,455 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:25:32,461 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:25:32,461 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:25:32,462 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:25:32,463 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:25:32,464 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:25:32,465 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:25:32,465 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:25:32,470 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:25:32,471 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:25:32,472 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:25:32,473 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:25:32,474 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:25:32,474 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:25:32,475 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:25:32,475 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:25:32,476 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:25:32,476 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:25:32,478 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:25:32,510 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:25:32,511 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:25:32,512 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:25:32,512 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:25:32,513 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:25:32,513 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:25:32,513 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:25:32,513 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:25:32,514 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:25:32,514 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:25:32,515 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:25:32,515 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:25:32,515 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:25:32,515 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:25:32,515 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:25:32,516 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:25:32,516 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:25:32,516 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:25:32,516 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:25:32,516 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:25:32,516 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:25:32,517 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:25:32,517 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:25:32,517 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:25:32,517 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:25:32,517 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:25:32,517 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:25:32,518 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:25:32,518 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 20:25:32,518 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 20:25:32,518 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:25:32,518 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:25:32,519 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:25:32,519 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:25:32,519 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 -> 82646a2180350347ed217a12e2836ec5fdce4b0371f5e0f7afa776fd6812fa0f 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:25:32,798 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:25:32,814 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:25:32,818 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:25:32,819 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:25:32,820 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:25:32,822 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix037_power.oepc_pso.oepc_rmo.oepc.i [2023-08-29 20:25:33,880 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:25:34,182 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:25:34,185 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix037_power.oepc_pso.oepc_rmo.oepc.i [2023-08-29 20:25:34,207 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d8810a49/1918b0c7f5c14c2eb7d8ef8917c9efa3/FLAGeab615d02 [2023-08-29 20:25:34,221 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d8810a49/1918b0c7f5c14c2eb7d8ef8917c9efa3 [2023-08-29 20:25:34,223 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:25:34,225 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:25:34,226 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:25:34,226 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:25:34,229 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:25:34,230 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:25:34" (1/1) ... [2023-08-29 20:25:34,231 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:25:34, skipping insertion in model container [2023-08-29 20:25:34,231 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:25:34" (1/1) ... [2023-08-29 20:25:34,237 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:25:34,291 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:25:34,462 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/mix037_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-29 20:25:34,709 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:25:34,723 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:25:34,735 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/mix037_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-29 20:25:34,826 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:25:34,866 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:25:34,867 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:25:34,873 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:25:34,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:25:34 WrapperNode [2023-08-29 20:25:34,873 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:25:34,875 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:25:34,875 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:25:34,875 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:25:34,881 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:25:34" (1/1) ... [2023-08-29 20:25:34,912 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:25:34" (1/1) ... [2023-08-29 20:25:34,952 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2023-08-29 20:25:34,953 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:25:34,954 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:25:34,954 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:25:34,954 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:25:34,962 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:25:34" (1/1) ... [2023-08-29 20:25:34,963 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:25:34" (1/1) ... [2023-08-29 20:25:34,979 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:25:34" (1/1) ... [2023-08-29 20:25:34,979 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:25:34" (1/1) ... [2023-08-29 20:25:34,990 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:25:34" (1/1) ... [2023-08-29 20:25:34,999 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:25:34" (1/1) ... [2023-08-29 20:25:35,002 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:25:34" (1/1) ... [2023-08-29 20:25:35,010 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:25:34" (1/1) ... [2023-08-29 20:25:35,014 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:25:35,016 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:25:35,016 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:25:35,017 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:25:35,017 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:25:34" (1/1) ... [2023-08-29 20:25:35,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:25:35,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:25:35,052 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:25:35,068 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:25:35,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 20:25:35,096 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:25:35,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:25:35,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:25:35,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:25:35,100 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:25:35,100 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:25:35,100 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:25:35,100 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:25:35,100 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-29 20:25:35,100 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-29 20:25:35,100 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-29 20:25:35,101 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-29 20:25:35,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-29 20:25:35,101 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:25:35,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:25:35,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:25:35,102 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:25:35,219 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:25:35,221 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:25:35,738 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:25:35,826 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:25:35,826 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:25:35,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:25:35 BoogieIcfgContainer [2023-08-29 20:25:35,831 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:25:35,833 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:25:35,833 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:25:35,835 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:25:35,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:25:34" (1/3) ... [2023-08-29 20:25:35,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18de3a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:25:35, skipping insertion in model container [2023-08-29 20:25:35,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:25:34" (2/3) ... [2023-08-29 20:25:35,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18de3a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:25:35, skipping insertion in model container [2023-08-29 20:25:35,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:25:35" (3/3) ... [2023-08-29 20:25:35,838 INFO L112 eAbstractionObserver]: Analyzing ICFG mix037_power.oepc_pso.oepc_rmo.oepc.i [2023-08-29 20:25:35,854 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:25:35,854 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-29 20:25:35,854 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:25:35,921 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:25:35,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 145 transitions, 310 flow [2023-08-29 20:25:36,024 INFO L130 PetriNetUnfolder]: 2/141 cut-off events. [2023-08-29 20:25:36,024 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:25:36,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 141 events. 2/141 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 108 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-29 20:25:36,031 INFO L82 GeneralOperation]: Start removeDead. Operand has 156 places, 145 transitions, 310 flow [2023-08-29 20:25:36,039 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 152 places, 141 transitions, 294 flow [2023-08-29 20:25:36,042 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:25:36,050 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 141 transitions, 294 flow [2023-08-29 20:25:36,053 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 152 places, 141 transitions, 294 flow [2023-08-29 20:25:36,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 141 transitions, 294 flow [2023-08-29 20:25:36,078 INFO L130 PetriNetUnfolder]: 2/141 cut-off events. [2023-08-29 20:25:36,078 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:25:36,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 141 events. 2/141 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 108 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-29 20:25:36,081 INFO L119 LiptonReduction]: Number of co-enabled transitions 3636 [2023-08-29 20:25:40,630 INFO L134 LiptonReduction]: Checked pairs total: 10048 [2023-08-29 20:25:40,631 INFO L136 LiptonReduction]: Total number of compositions: 138 [2023-08-29 20:25:40,643 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:25:40,649 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;@43e38c78, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:25:40,649 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-29 20:25:40,651 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-29 20:25:40,651 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:25:40,651 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:25:40,651 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:25:40,652 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:25:40,656 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:25:40,656 INFO L85 PathProgramCache]: Analyzing trace with hash 614, now seen corresponding path program 1 times [2023-08-29 20:25:40,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:25:40,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523977885] [2023-08-29 20:25:40,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:25:40,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:25:40,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:25:40,755 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:25:40,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:25:40,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523977885] [2023-08-29 20:25:40,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523977885] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:25:40,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:25:40,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:25:40,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332799673] [2023-08-29 20:25:40,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:25:40,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:25:40,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:25:40,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:25:40,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:25:40,795 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 283 [2023-08-29 20:25:40,799 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 90 flow. Second operand has 2 states, 2 states have (on average 130.5) internal successors, (261), 2 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:25:40,800 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:25:40,800 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 283 [2023-08-29 20:25:40,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:25:42,045 INFO L130 PetriNetUnfolder]: 7479/10189 cut-off events. [2023-08-29 20:25:42,046 INFO L131 PetriNetUnfolder]: For 82/82 co-relation queries the response was YES. [2023-08-29 20:25:42,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20497 conditions, 10189 events. 7479/10189 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 481. Compared 52520 event pairs, 7479 based on Foata normal form. 0/8785 useless extension candidates. Maximal degree in co-relation 20485. Up to 10091 conditions per place. [2023-08-29 20:25:42,122 INFO L137 encePairwiseOnDemand]: 275/283 looper letters, 27 selfloop transitions, 0 changer transitions 0/31 dead transitions. [2023-08-29 20:25:42,122 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 31 transitions, 128 flow [2023-08-29 20:25:42,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:25:42,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:25:42,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 295 transitions. [2023-08-29 20:25:42,141 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5212014134275619 [2023-08-29 20:25:42,142 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 295 transitions. [2023-08-29 20:25:42,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 295 transitions. [2023-08-29 20:25:42,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:25:42,148 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 295 transitions. [2023-08-29 20:25:42,154 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 147.5) internal successors, (295), 2 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:25:42,158 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:25:42,158 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:25:42,160 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 90 flow. Second operand 2 states and 295 transitions. [2023-08-29 20:25:42,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 31 transitions, 128 flow [2023-08-29 20:25:42,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 31 transitions, 124 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-29 20:25:42,167 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 70 flow [2023-08-29 20:25:42,169 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=70, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2023-08-29 20:25:42,173 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -11 predicate places. [2023-08-29 20:25:42,173 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 70 flow [2023-08-29 20:25:42,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 130.5) internal successors, (261), 2 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:25:42,175 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:25:42,176 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 20:25:42,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 20:25:42,178 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:25:42,186 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:25:42,187 INFO L85 PathProgramCache]: Analyzing trace with hash 605298, now seen corresponding path program 1 times [2023-08-29 20:25:42,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:25:42,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734803668] [2023-08-29 20:25:42,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:25:42,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:25:42,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:25:42,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:25:42,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:25:42,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734803668] [2023-08-29 20:25:42,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734803668] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:25:42,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:25:42,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:25:42,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843597775] [2023-08-29 20:25:42,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:25:42,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:25:42,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:25:42,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:25:42,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:25:42,461 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 283 [2023-08-29 20:25:42,462 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:25:42,462 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:25:42,462 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 283 [2023-08-29 20:25:42,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:25:43,434 INFO L130 PetriNetUnfolder]: 5879/8050 cut-off events. [2023-08-29 20:25:43,435 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:25:43,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16191 conditions, 8050 events. 5879/8050 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 39630 event pairs, 3031 based on Foata normal form. 0/7394 useless extension candidates. Maximal degree in co-relation 16188. Up to 6367 conditions per place. [2023-08-29 20:25:43,480 INFO L137 encePairwiseOnDemand]: 280/283 looper letters, 43 selfloop transitions, 2 changer transitions 2/51 dead transitions. [2023-08-29 20:25:43,480 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 51 transitions, 210 flow [2023-08-29 20:25:43,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:25:43,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:25:43,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 435 transitions. [2023-08-29 20:25:43,483 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5123674911660777 [2023-08-29 20:25:43,483 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 435 transitions. [2023-08-29 20:25:43,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 435 transitions. [2023-08-29 20:25:43,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:25:43,483 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 435 transitions. [2023-08-29 20:25:43,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.0) internal successors, (435), 3 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:25:43,487 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:25:43,487 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:25:43,488 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 70 flow. Second operand 3 states and 435 transitions. [2023-08-29 20:25:43,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 51 transitions, 210 flow [2023-08-29 20:25:43,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 51 transitions, 210 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:25:43,489 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 70 flow [2023-08-29 20:25:43,490 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2023-08-29 20:25:43,490 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -10 predicate places. [2023-08-29 20:25:43,491 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 70 flow [2023-08-29 20:25:43,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:25:43,491 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:25:43,491 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:25:43,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-29 20:25:43,492 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:25:43,492 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:25:43,493 INFO L85 PathProgramCache]: Analyzing trace with hash -587374610, now seen corresponding path program 1 times [2023-08-29 20:25:43,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:25:43,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913575152] [2023-08-29 20:25:43,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:25:43,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:25:43,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:25:43,880 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:25:43,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:25:43,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913575152] [2023-08-29 20:25:43,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913575152] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:25:43,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:25:43,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:25:43,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587426068] [2023-08-29 20:25:43,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:25:43,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:25:43,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:25:43,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:25:43,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:25:43,904 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 283 [2023-08-29 20:25:43,905 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:25:43,905 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:25:43,905 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 283 [2023-08-29 20:25:43,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:25:46,067 INFO L130 PetriNetUnfolder]: 18915/25600 cut-off events. [2023-08-29 20:25:46,067 INFO L131 PetriNetUnfolder]: For 953/953 co-relation queries the response was YES. [2023-08-29 20:25:46,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52633 conditions, 25600 events. 18915/25600 cut-off events. For 953/953 co-relation queries the response was YES. Maximal size of possible extension queue 820. Compared 136785 event pairs, 6960 based on Foata normal form. 0/24870 useless extension candidates. Maximal degree in co-relation 52629. Up to 16550 conditions per place. [2023-08-29 20:25:46,207 INFO L137 encePairwiseOnDemand]: 274/283 looper letters, 45 selfloop transitions, 8 changer transitions 0/53 dead transitions. [2023-08-29 20:25:46,208 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 53 transitions, 230 flow [2023-08-29 20:25:46,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:25:46,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:25:46,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 414 transitions. [2023-08-29 20:25:46,210 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4876325088339223 [2023-08-29 20:25:46,210 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 414 transitions. [2023-08-29 20:25:46,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 414 transitions. [2023-08-29 20:25:46,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:25:46,210 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 414 transitions. [2023-08-29 20:25:46,211 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:25:46,213 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:25:46,214 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:25:46,214 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 70 flow. Second operand 3 states and 414 transitions. [2023-08-29 20:25:46,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 53 transitions, 230 flow [2023-08-29 20:25:46,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 53 transitions, 224 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:25:46,216 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 128 flow [2023-08-29 20:25:46,216 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2023-08-29 20:25:46,217 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -9 predicate places. [2023-08-29 20:25:46,221 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 128 flow [2023-08-29 20:25:46,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:25:46,222 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:25:46,222 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:25:46,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-29 20:25:46,223 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:25:46,224 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:25:46,224 INFO L85 PathProgramCache]: Analyzing trace with hash -587374603, now seen corresponding path program 1 times [2023-08-29 20:25:46,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:25:46,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664390559] [2023-08-29 20:25:46,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:25:46,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:25:46,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:25:46,868 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:25:46,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:25:46,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664390559] [2023-08-29 20:25:46,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664390559] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:25:46,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:25:46,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:25:46,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540569856] [2023-08-29 20:25:46,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:25:46,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:25:46,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:25:46,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:25:46,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:25:47,103 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 283 [2023-08-29 20:25:47,104 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 128 flow. Second operand has 6 states, 6 states have (on average 114.83333333333333) internal successors, (689), 6 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:25:47,104 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:25:47,104 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 283 [2023-08-29 20:25:47,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:25:48,672 INFO L130 PetriNetUnfolder]: 12928/18171 cut-off events. [2023-08-29 20:25:48,673 INFO L131 PetriNetUnfolder]: For 5981/6082 co-relation queries the response was YES. [2023-08-29 20:25:48,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43033 conditions, 18171 events. 12928/18171 cut-off events. For 5981/6082 co-relation queries the response was YES. Maximal size of possible extension queue 707. Compared 102870 event pairs, 2395 based on Foata normal form. 500/18361 useless extension candidates. Maximal degree in co-relation 43028. Up to 13078 conditions per place. [2023-08-29 20:25:48,784 INFO L137 encePairwiseOnDemand]: 276/283 looper letters, 55 selfloop transitions, 6 changer transitions 0/67 dead transitions. [2023-08-29 20:25:48,785 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 67 transitions, 328 flow [2023-08-29 20:25:48,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:25:48,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:25:48,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 735 transitions. [2023-08-29 20:25:48,791 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43286219081272087 [2023-08-29 20:25:48,792 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 735 transitions. [2023-08-29 20:25:48,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 735 transitions. [2023-08-29 20:25:48,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:25:48,793 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 735 transitions. [2023-08-29 20:25:48,794 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 122.5) internal successors, (735), 6 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:25:48,797 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 283.0) internal successors, (1981), 7 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:25:48,798 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 283.0) internal successors, (1981), 7 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:25:48,798 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 128 flow. Second operand 6 states and 735 transitions. [2023-08-29 20:25:48,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 67 transitions, 328 flow [2023-08-29 20:25:48,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 67 transitions, 306 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:25:48,864 INFO L231 Difference]: Finished difference. Result has 47 places, 36 transitions, 133 flow [2023-08-29 20:25:48,864 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=133, PETRI_PLACES=47, PETRI_TRANSITIONS=36} [2023-08-29 20:25:48,865 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -5 predicate places. [2023-08-29 20:25:48,866 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 36 transitions, 133 flow [2023-08-29 20:25:48,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.83333333333333) internal successors, (689), 6 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:25:48,866 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:25:48,867 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:25:48,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-29 20:25:48,867 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:25:48,867 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:25:48,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1834465813, now seen corresponding path program 1 times [2023-08-29 20:25:48,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:25:48,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653930404] [2023-08-29 20:25:48,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:25:48,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:25:48,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:25:49,087 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:25:49,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:25:49,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653930404] [2023-08-29 20:25:49,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653930404] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:25:49,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:25:49,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:25:49,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627098827] [2023-08-29 20:25:49,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:25:49,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:25:49,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:25:49,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:25:49,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:25:49,103 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 283 [2023-08-29 20:25:49,104 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 36 transitions, 133 flow. Second operand has 4 states, 4 states have (on average 123.25) internal successors, (493), 4 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:25:49,104 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:25:49,104 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 283 [2023-08-29 20:25:49,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:25:50,584 INFO L130 PetriNetUnfolder]: 15998/21725 cut-off events. [2023-08-29 20:25:50,585 INFO L131 PetriNetUnfolder]: For 6027/6027 co-relation queries the response was YES. [2023-08-29 20:25:50,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53538 conditions, 21725 events. 15998/21725 cut-off events. For 6027/6027 co-relation queries the response was YES. Maximal size of possible extension queue 661. Compared 114727 event pairs, 3579 based on Foata normal form. 0/21265 useless extension candidates. Maximal degree in co-relation 53532. Up to 13591 conditions per place. [2023-08-29 20:25:50,839 INFO L137 encePairwiseOnDemand]: 274/283 looper letters, 67 selfloop transitions, 12 changer transitions 0/79 dead transitions. [2023-08-29 20:25:50,839 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 79 transitions, 429 flow [2023-08-29 20:25:50,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:25:50,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:25:50,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 555 transitions. [2023-08-29 20:25:50,845 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4902826855123675 [2023-08-29 20:25:50,846 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 555 transitions. [2023-08-29 20:25:50,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 555 transitions. [2023-08-29 20:25:50,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:25:50,848 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 555 transitions. [2023-08-29 20:25:50,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 138.75) internal successors, (555), 4 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:25:50,856 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 283.0) internal successors, (1415), 5 states have internal predecessors, (1415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:25:50,857 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 283.0) internal successors, (1415), 5 states have internal predecessors, (1415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:25:50,857 INFO L175 Difference]: Start difference. First operand has 47 places, 36 transitions, 133 flow. Second operand 4 states and 555 transitions. [2023-08-29 20:25:50,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 79 transitions, 429 flow [2023-08-29 20:25:50,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 79 transitions, 403 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-29 20:25:50,861 INFO L231 Difference]: Finished difference. Result has 48 places, 44 transitions, 218 flow [2023-08-29 20:25:50,861 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=218, PETRI_PLACES=48, PETRI_TRANSITIONS=44} [2023-08-29 20:25:50,864 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -4 predicate places. [2023-08-29 20:25:50,864 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 44 transitions, 218 flow [2023-08-29 20:25:50,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.25) internal successors, (493), 4 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:25:50,864 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:25:50,864 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:25:50,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-29 20:25:50,865 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:25:50,865 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:25:50,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1834594146, now seen corresponding path program 1 times [2023-08-29 20:25:50,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:25:50,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048598627] [2023-08-29 20:25:50,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:25:50,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:25:50,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:25:51,436 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:25:51,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:25:51,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048598627] [2023-08-29 20:25:51,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048598627] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:25:51,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:25:51,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:25:51,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273557045] [2023-08-29 20:25:51,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:25:51,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:25:51,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:25:51,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:25:51,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:25:51,598 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 283 [2023-08-29 20:25:51,599 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 44 transitions, 218 flow. Second operand has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:25:51,599 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:25:51,599 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 283 [2023-08-29 20:25:51,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:25:52,807 INFO L130 PetriNetUnfolder]: 9742/13729 cut-off events. [2023-08-29 20:25:52,808 INFO L131 PetriNetUnfolder]: For 15607/16880 co-relation queries the response was YES. [2023-08-29 20:25:52,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33904 conditions, 13729 events. 9742/13729 cut-off events. For 15607/16880 co-relation queries the response was YES. Maximal size of possible extension queue 619. Compared 76863 event pairs, 3981 based on Foata normal form. 1178/14397 useless extension candidates. Maximal degree in co-relation 33896. Up to 12600 conditions per place. [2023-08-29 20:25:52,882 INFO L137 encePairwiseOnDemand]: 278/283 looper letters, 46 selfloop transitions, 4 changer transitions 0/61 dead transitions. [2023-08-29 20:25:52,883 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 61 transitions, 360 flow [2023-08-29 20:25:52,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:25:52,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:25:52,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 709 transitions. [2023-08-29 20:25:52,886 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4175500588928151 [2023-08-29 20:25:52,886 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 709 transitions. [2023-08-29 20:25:52,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 709 transitions. [2023-08-29 20:25:52,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:25:52,887 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 709 transitions. [2023-08-29 20:25:52,889 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 118.16666666666667) internal successors, (709), 6 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:25:52,892 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 283.0) internal successors, (1981), 7 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:25:52,893 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 283.0) internal successors, (1981), 7 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:25:52,893 INFO L175 Difference]: Start difference. First operand has 48 places, 44 transitions, 218 flow. Second operand 6 states and 709 transitions. [2023-08-29 20:25:52,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 61 transitions, 360 flow [2023-08-29 20:25:52,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 61 transitions, 346 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:25:52,911 INFO L231 Difference]: Finished difference. Result has 51 places, 39 transitions, 181 flow [2023-08-29 20:25:52,911 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=181, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2023-08-29 20:25:52,912 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -1 predicate places. [2023-08-29 20:25:52,912 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 181 flow [2023-08-29 20:25:52,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:25:52,912 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:25:52,913 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:25:52,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-29 20:25:52,913 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:25:52,913 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:25:52,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1109411966, now seen corresponding path program 1 times [2023-08-29 20:25:52,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:25:52,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704426384] [2023-08-29 20:25:52,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:25:52,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:25:52,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:25:53,179 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:25:53,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:25:53,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704426384] [2023-08-29 20:25:53,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704426384] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:25:53,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:25:53,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:25:53,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117709278] [2023-08-29 20:25:53,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:25:53,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:25:53,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:25:53,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:25:53,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:25:53,199 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 283 [2023-08-29 20:25:53,200 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 181 flow. Second operand has 4 states, 4 states have (on average 126.25) internal successors, (505), 4 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:25:53,201 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:25:53,201 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 283 [2023-08-29 20:25:53,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:25:54,384 INFO L130 PetriNetUnfolder]: 8363/12342 cut-off events. [2023-08-29 20:25:54,384 INFO L131 PetriNetUnfolder]: For 5145/5491 co-relation queries the response was YES. [2023-08-29 20:25:54,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30020 conditions, 12342 events. 8363/12342 cut-off events. For 5145/5491 co-relation queries the response was YES. Maximal size of possible extension queue 582. Compared 76271 event pairs, 1618 based on Foata normal form. 1059/12992 useless extension candidates. Maximal degree in co-relation 30011. Up to 5185 conditions per place. [2023-08-29 20:25:54,465 INFO L137 encePairwiseOnDemand]: 276/283 looper letters, 61 selfloop transitions, 6 changer transitions 0/78 dead transitions. [2023-08-29 20:25:54,465 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 78 transitions, 448 flow [2023-08-29 20:25:54,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:25:54,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:25:54,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 551 transitions. [2023-08-29 20:25:54,468 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48674911660777387 [2023-08-29 20:25:54,468 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 551 transitions. [2023-08-29 20:25:54,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 551 transitions. [2023-08-29 20:25:54,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:25:54,469 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 551 transitions. [2023-08-29 20:25:54,470 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.75) internal successors, (551), 4 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:25:54,472 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 283.0) internal successors, (1415), 5 states have internal predecessors, (1415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:25:54,473 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 283.0) internal successors, (1415), 5 states have internal predecessors, (1415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:25:54,473 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 181 flow. Second operand 4 states and 551 transitions. [2023-08-29 20:25:54,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 78 transitions, 448 flow [2023-08-29 20:25:54,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 78 transitions, 436 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-29 20:25:54,487 INFO L231 Difference]: Finished difference. Result has 52 places, 44 transitions, 220 flow [2023-08-29 20:25:54,488 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=220, PETRI_PLACES=52, PETRI_TRANSITIONS=44} [2023-08-29 20:25:54,488 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places. [2023-08-29 20:25:54,488 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 44 transitions, 220 flow [2023-08-29 20:25:54,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.25) internal successors, (505), 4 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:25:54,489 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:25:54,489 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:25:54,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-29 20:25:54,490 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:25:54,490 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:25:54,490 INFO L85 PathProgramCache]: Analyzing trace with hash -760233177, now seen corresponding path program 1 times [2023-08-29 20:25:54,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:25:54,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620050808] [2023-08-29 20:25:54,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:25:54,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:25:54,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:25:54,841 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:25:54,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:25:54,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620050808] [2023-08-29 20:25:54,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620050808] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:25:54,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:25:54,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:25:54,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645663954] [2023-08-29 20:25:54,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:25:54,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:25:54,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:25:54,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:25:54,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:25:54,860 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 283 [2023-08-29 20:25:54,861 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 220 flow. Second operand has 5 states, 5 states have (on average 126.2) internal successors, (631), 5 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:25:54,861 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:25:54,862 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 283 [2023-08-29 20:25:54,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:25:55,855 INFO L130 PetriNetUnfolder]: 6802/10307 cut-off events. [2023-08-29 20:25:55,855 INFO L131 PetriNetUnfolder]: For 6880/7218 co-relation queries the response was YES. [2023-08-29 20:25:55,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30409 conditions, 10307 events. 6802/10307 cut-off events. For 6880/7218 co-relation queries the response was YES. Maximal size of possible extension queue 497. Compared 65226 event pairs, 1509 based on Foata normal form. 714/10653 useless extension candidates. Maximal degree in co-relation 30398. Up to 3924 conditions per place. [2023-08-29 20:25:55,892 INFO L137 encePairwiseOnDemand]: 276/283 looper letters, 78 selfloop transitions, 10 changer transitions 0/99 dead transitions. [2023-08-29 20:25:55,892 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 99 transitions, 602 flow [2023-08-29 20:25:55,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:25:55,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:25:55,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 692 transitions. [2023-08-29 20:25:55,894 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4890459363957597 [2023-08-29 20:25:55,895 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 692 transitions. [2023-08-29 20:25:55,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 692 transitions. [2023-08-29 20:25:55,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:25:55,895 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 692 transitions. [2023-08-29 20:25:55,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.4) internal successors, (692), 5 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:25:55,899 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:25:55,899 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:25:55,899 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 220 flow. Second operand 5 states and 692 transitions. [2023-08-29 20:25:55,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 99 transitions, 602 flow [2023-08-29 20:25:55,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 99 transitions, 599 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:25:55,909 INFO L231 Difference]: Finished difference. Result has 57 places, 49 transitions, 285 flow [2023-08-29 20:25:55,909 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=285, PETRI_PLACES=57, PETRI_TRANSITIONS=49} [2023-08-29 20:25:55,910 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 5 predicate places. [2023-08-29 20:25:55,910 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 285 flow [2023-08-29 20:25:55,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.2) internal successors, (631), 5 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:25:55,911 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:25:55,911 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:25:55,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-29 20:25:55,911 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:25:55,912 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:25:55,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1543424239, now seen corresponding path program 1 times [2023-08-29 20:25:55,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:25:55,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541317664] [2023-08-29 20:25:55,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:25:55,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:25:55,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:25:56,360 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:25:56,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:25:56,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541317664] [2023-08-29 20:25:56,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541317664] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:25:56,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:25:56,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:25:56,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535384424] [2023-08-29 20:25:56,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:25:56,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:25:56,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:25:56,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:25:56,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:25:56,373 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 283 [2023-08-29 20:25:56,373 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 285 flow. Second operand has 5 states, 5 states have (on average 128.6) internal successors, (643), 5 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:25:56,374 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:25:56,374 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 283 [2023-08-29 20:25:56,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:25:58,142 INFO L130 PetriNetUnfolder]: 11164/17382 cut-off events. [2023-08-29 20:25:58,143 INFO L131 PetriNetUnfolder]: For 30118/30527 co-relation queries the response was YES. [2023-08-29 20:25:58,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59367 conditions, 17382 events. 11164/17382 cut-off events. For 30118/30527 co-relation queries the response was YES. Maximal size of possible extension queue 927. Compared 123521 event pairs, 2843 based on Foata normal form. 235/17277 useless extension candidates. Maximal degree in co-relation 59354. Up to 10060 conditions per place. [2023-08-29 20:25:58,261 INFO L137 encePairwiseOnDemand]: 275/283 looper letters, 91 selfloop transitions, 15 changer transitions 35/152 dead transitions. [2023-08-29 20:25:58,261 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 152 transitions, 1165 flow [2023-08-29 20:25:58,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:25:58,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:25:58,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 837 transitions. [2023-08-29 20:25:58,263 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4929328621908127 [2023-08-29 20:25:58,264 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 837 transitions. [2023-08-29 20:25:58,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 837 transitions. [2023-08-29 20:25:58,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:25:58,264 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 837 transitions. [2023-08-29 20:25:58,266 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 139.5) internal successors, (837), 6 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:25:58,268 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 283.0) internal successors, (1981), 7 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:25:58,269 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 283.0) internal successors, (1981), 7 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:25:58,269 INFO L175 Difference]: Start difference. First operand has 57 places, 49 transitions, 285 flow. Second operand 6 states and 837 transitions. [2023-08-29 20:25:58,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 152 transitions, 1165 flow [2023-08-29 20:25:58,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 152 transitions, 1104 flow, removed 18 selfloop flow, removed 2 redundant places. [2023-08-29 20:25:58,324 INFO L231 Difference]: Finished difference. Result has 63 places, 63 transitions, 388 flow [2023-08-29 20:25:58,324 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=388, PETRI_PLACES=63, PETRI_TRANSITIONS=63} [2023-08-29 20:25:58,324 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 11 predicate places. [2023-08-29 20:25:58,325 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 63 transitions, 388 flow [2023-08-29 20:25:58,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 128.6) internal successors, (643), 5 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:25:58,325 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:25:58,325 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:25:58,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-29 20:25:58,326 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:25:58,326 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:25:58,326 INFO L85 PathProgramCache]: Analyzing trace with hash -2121504141, now seen corresponding path program 2 times [2023-08-29 20:25:58,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:25:58,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176458201] [2023-08-29 20:25:58,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:25:58,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:25:58,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:25:58,579 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:25:58,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:25:58,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176458201] [2023-08-29 20:25:58,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176458201] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:25:58,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:25:58,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:25:58,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417787748] [2023-08-29 20:25:58,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:25:58,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:25:58,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:25:58,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:25:58,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:25:58,586 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 283 [2023-08-29 20:25:58,587 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 63 transitions, 388 flow. Second operand has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:25:58,587 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:25:58,587 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 283 [2023-08-29 20:25:58,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:25:59,883 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([435] L831-->L847: Formula: (let ((.cse4 (= (mod v_~b$r_buff1_thd4~0_60 256) 0)) (.cse6 (= (mod v_~b$r_buff0_thd4~0_62 256) 0))) (let ((.cse8 (not .cse6)) (.cse7 (and .cse6 .cse4)) (.cse12 (= (mod v_~b$w_buff0_used~0_150 256) 0)) (.cse9 (and .cse6 (= (mod v_~b$w_buff1_used~0_133 256) 0)))) (let ((.cse10 (or .cse7 .cse12 .cse9)) (.cse11 (and (not .cse12) .cse8))) (let ((.cse2 (= (mod v_~b$w_buff1_used~0_132 256) 0)) (.cse5 (ite .cse10 v_~b~0_93 (ite .cse11 v_~b$w_buff0~0_61 v_~b$w_buff1~0_64))) (.cse3 (= (mod v_~b$w_buff0_used~0_149 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_32 256) 0)))) (and (= v_~b$w_buff0~0_61 v_~b$w_buff0~0_60) (= (ite .cse0 v_~b$r_buff1_thd4~0_60 (ite (let ((.cse1 (= (mod v_~b$r_buff0_thd4~0_61 256) 0))) (or (and .cse1 .cse2) .cse3 (and .cse1 .cse4))) v_~b$r_buff1_thd4~0_60 0)) v_~b$r_buff1_thd4~0_59) (= v_~b~0_92 (ite .cse0 v_~b$mem_tmp~0_18 .cse5)) (= v_~b$flush_delayed~0_25 0) (= (ite .cse0 v_~b$r_buff0_thd4~0_62 (ite (or (and .cse6 .cse2) .cse7 .cse3) v_~b$r_buff0_thd4~0_62 (ite (and .cse8 (not .cse3)) 0 v_~b$r_buff0_thd4~0_62))) v_~b$r_buff0_thd4~0_61) (= .cse5 v_~__unbuffered_p3_EBX~0_10) (= v_~b$mem_tmp~0_18 v_~b~0_93) (= v_~b$w_buff1_used~0_132 (ite .cse0 v_~b$w_buff1_used~0_133 (ite (or .cse7 .cse3 .cse9) v_~b$w_buff1_used~0_133 0))) (= v_~b$w_buff1~0_64 v_~b$w_buff1~0_63) (= (ite .cse0 v_~b$w_buff0_used~0_150 (ite .cse10 v_~b$w_buff0_used~0_150 (ite .cse11 0 v_~b$w_buff0_used~0_150))) v_~b$w_buff0_used~0_149)))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_150, ~b~0=v_~b~0_93, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_133, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_60, ~b$w_buff1~0=v_~b$w_buff1~0_64, ~b$w_buff0~0=v_~b$w_buff0~0_61, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_62} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_18, ~b$flush_delayed~0=v_~b$flush_delayed~0_25, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_149, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~b~0=v_~b~0_92, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_132, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_59, ~b$w_buff1~0=v_~b$w_buff1~0_63, ~b$w_buff0~0=v_~b$w_buff0~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_61, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_1|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_1|} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4][53], [Black: 200#(and (= ~__unbuffered_cnt~0 0) (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), Black: 208#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork2InUse, 180#true, P3Thread1of1ForFork1InUse, P2Thread1of1ForFork3InUse, P1Thread1of1ForFork0InUse, Black: 220#(= ~__unbuffered_p3_EBX~0 1), Black: 218#(and (= ~b$r_buff0_thd1~0 1) (= ~b$w_buff0_used~0 1) (= ~b$w_buff0~0 1)), Black: 222#(and (= ~__unbuffered_p3_EBX~0 1) (<= ~b$w_buff0_used~0 (* (div ~b$w_buff0_used~0 256) 256)) (< 0 (+ (div ~b$w_buff0_used~0 256) 1)) (= ~b~0 1)), 37#L808true, 193#(and (not (= |ULTIMATE.start_main_~#t970~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (not (= |ULTIMATE.start_main_~#t971~0#1.base| |ULTIMATE.start_main_~#t970~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t969~0#1.base| 0) |ULTIMATE.start_main_~#t970~0#1.base| 0) |ULTIMATE.start_main_~#t972~0#1.base| 0) |ULTIMATE.start_main_~#t971~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t971~0#1.base|)) (not (= |ULTIMATE.start_main_~#t971~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t970~0#1.base|))), 77#L847true, Black: 168#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 36#L795true, 159#true, 115#L881true, 227#true, Black: 177#(and (not (= |ULTIMATE.start_main_~#t970~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (not (= |ULTIMATE.start_main_~#t971~0#1.base| |ULTIMATE.start_main_~#t970~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t969~0#1.base| 0) |ULTIMATE.start_main_~#t970~0#1.base| 0) |ULTIMATE.start_main_~#t972~0#1.base| 0) |ULTIMATE.start_main_~#t971~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t971~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t971~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t970~0#1.base|))), 85#P0EXITtrue, Black: 182#(= ~x~0 0), Black: 183#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 198#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), 216#true, 212#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0))]) [2023-08-29 20:25:59,883 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is not cut-off event [2023-08-29 20:25:59,883 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2023-08-29 20:25:59,883 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2023-08-29 20:25:59,884 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2023-08-29 20:25:59,902 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([435] L831-->L847: Formula: (let ((.cse4 (= (mod v_~b$r_buff1_thd4~0_60 256) 0)) (.cse6 (= (mod v_~b$r_buff0_thd4~0_62 256) 0))) (let ((.cse8 (not .cse6)) (.cse7 (and .cse6 .cse4)) (.cse12 (= (mod v_~b$w_buff0_used~0_150 256) 0)) (.cse9 (and .cse6 (= (mod v_~b$w_buff1_used~0_133 256) 0)))) (let ((.cse10 (or .cse7 .cse12 .cse9)) (.cse11 (and (not .cse12) .cse8))) (let ((.cse2 (= (mod v_~b$w_buff1_used~0_132 256) 0)) (.cse5 (ite .cse10 v_~b~0_93 (ite .cse11 v_~b$w_buff0~0_61 v_~b$w_buff1~0_64))) (.cse3 (= (mod v_~b$w_buff0_used~0_149 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_32 256) 0)))) (and (= v_~b$w_buff0~0_61 v_~b$w_buff0~0_60) (= (ite .cse0 v_~b$r_buff1_thd4~0_60 (ite (let ((.cse1 (= (mod v_~b$r_buff0_thd4~0_61 256) 0))) (or (and .cse1 .cse2) .cse3 (and .cse1 .cse4))) v_~b$r_buff1_thd4~0_60 0)) v_~b$r_buff1_thd4~0_59) (= v_~b~0_92 (ite .cse0 v_~b$mem_tmp~0_18 .cse5)) (= v_~b$flush_delayed~0_25 0) (= (ite .cse0 v_~b$r_buff0_thd4~0_62 (ite (or (and .cse6 .cse2) .cse7 .cse3) v_~b$r_buff0_thd4~0_62 (ite (and .cse8 (not .cse3)) 0 v_~b$r_buff0_thd4~0_62))) v_~b$r_buff0_thd4~0_61) (= .cse5 v_~__unbuffered_p3_EBX~0_10) (= v_~b$mem_tmp~0_18 v_~b~0_93) (= v_~b$w_buff1_used~0_132 (ite .cse0 v_~b$w_buff1_used~0_133 (ite (or .cse7 .cse3 .cse9) v_~b$w_buff1_used~0_133 0))) (= v_~b$w_buff1~0_64 v_~b$w_buff1~0_63) (= (ite .cse0 v_~b$w_buff0_used~0_150 (ite .cse10 v_~b$w_buff0_used~0_150 (ite .cse11 0 v_~b$w_buff0_used~0_150))) v_~b$w_buff0_used~0_149)))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_150, ~b~0=v_~b~0_93, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_133, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_60, ~b$w_buff1~0=v_~b$w_buff1~0_64, ~b$w_buff0~0=v_~b$w_buff0~0_61, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_62} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_18, ~b$flush_delayed~0=v_~b$flush_delayed~0_25, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_149, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~b~0=v_~b~0_92, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_132, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_59, ~b$w_buff1~0=v_~b$w_buff1~0_63, ~b$w_buff0~0=v_~b$w_buff0~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_61, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_1|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_1|} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4][53], [Black: 200#(and (= ~__unbuffered_cnt~0 0) (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), 208#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork2InUse, Black: 212#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 180#true, P3Thread1of1ForFork1InUse, P2Thread1of1ForFork3InUse, P1Thread1of1ForFork0InUse, Black: 220#(= ~__unbuffered_p3_EBX~0 1), Black: 218#(and (= ~b$r_buff0_thd1~0 1) (= ~b$w_buff0_used~0 1) (= ~b$w_buff0~0 1)), Black: 222#(and (= ~__unbuffered_p3_EBX~0 1) (<= ~b$w_buff0_used~0 (* (div ~b$w_buff0_used~0 256) 256)) (< 0 (+ (div ~b$w_buff0_used~0 256) 1)) (= ~b~0 1)), 37#L808true, 193#(and (not (= |ULTIMATE.start_main_~#t970~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (not (= |ULTIMATE.start_main_~#t971~0#1.base| |ULTIMATE.start_main_~#t970~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t969~0#1.base| 0) |ULTIMATE.start_main_~#t970~0#1.base| 0) |ULTIMATE.start_main_~#t972~0#1.base| 0) |ULTIMATE.start_main_~#t971~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t971~0#1.base|)) (not (= |ULTIMATE.start_main_~#t971~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t970~0#1.base|))), 77#L847true, Black: 168#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 159#true, 38#P1EXITtrue, 115#L881true, Black: 177#(and (not (= |ULTIMATE.start_main_~#t970~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (not (= |ULTIMATE.start_main_~#t971~0#1.base| |ULTIMATE.start_main_~#t970~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t969~0#1.base| 0) |ULTIMATE.start_main_~#t970~0#1.base| 0) |ULTIMATE.start_main_~#t972~0#1.base| 0) |ULTIMATE.start_main_~#t971~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t971~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t971~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t970~0#1.base|))), 227#true, 85#P0EXITtrue, Black: 182#(= ~x~0 0), 198#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), Black: 183#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 216#true]) [2023-08-29 20:25:59,903 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-29 20:25:59,903 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:25:59,903 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:25:59,903 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:26:00,295 INFO L130 PetriNetUnfolder]: 14293/21975 cut-off events. [2023-08-29 20:26:00,295 INFO L131 PetriNetUnfolder]: For 41341/42022 co-relation queries the response was YES. [2023-08-29 20:26:00,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82113 conditions, 21975 events. 14293/21975 cut-off events. For 41341/42022 co-relation queries the response was YES. Maximal size of possible extension queue 1111. Compared 155619 event pairs, 3744 based on Foata normal form. 232/21767 useless extension candidates. Maximal degree in co-relation 82097. Up to 12720 conditions per place. [2023-08-29 20:26:00,423 INFO L137 encePairwiseOnDemand]: 280/283 looper letters, 86 selfloop transitions, 5 changer transitions 5/104 dead transitions. [2023-08-29 20:26:00,423 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 104 transitions, 811 flow [2023-08-29 20:26:00,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:26:00,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:26:00,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 427 transitions. [2023-08-29 20:26:00,425 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.502944640753828 [2023-08-29 20:26:00,425 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 427 transitions. [2023-08-29 20:26:00,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 427 transitions. [2023-08-29 20:26:00,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:26:00,425 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 427 transitions. [2023-08-29 20:26:00,426 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:00,427 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:00,428 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:00,428 INFO L175 Difference]: Start difference. First operand has 63 places, 63 transitions, 388 flow. Second operand 3 states and 427 transitions. [2023-08-29 20:26:00,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 104 transitions, 811 flow [2023-08-29 20:26:00,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 104 transitions, 811 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:26:00,553 INFO L231 Difference]: Finished difference. Result has 66 places, 62 transitions, 398 flow [2023-08-29 20:26:00,553 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=398, PETRI_PLACES=66, PETRI_TRANSITIONS=62} [2023-08-29 20:26:00,553 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 14 predicate places. [2023-08-29 20:26:00,553 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 62 transitions, 398 flow [2023-08-29 20:26:00,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:00,554 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:26:00,554 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:26:00,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-29 20:26:00,554 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:26:00,555 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:26:00,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1081167317, now seen corresponding path program 1 times [2023-08-29 20:26:00,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:26:00,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930421991] [2023-08-29 20:26:00,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:26:00,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:26:00,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:26:00,745 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:26:00,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:26:00,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930421991] [2023-08-29 20:26:00,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930421991] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:26:00,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:26:00,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:26:00,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136412232] [2023-08-29 20:26:00,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:26:00,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:26:00,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:26:00,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:26:00,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:26:00,762 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 283 [2023-08-29 20:26:00,763 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 62 transitions, 398 flow. Second operand has 5 states, 5 states have (on average 122.2) internal successors, (611), 5 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:00,763 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:26:00,763 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 283 [2023-08-29 20:26:00,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:26:03,622 INFO L130 PetriNetUnfolder]: 27083/40053 cut-off events. [2023-08-29 20:26:03,622 INFO L131 PetriNetUnfolder]: For 87168/87168 co-relation queries the response was YES. [2023-08-29 20:26:03,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155763 conditions, 40053 events. 27083/40053 cut-off events. For 87168/87168 co-relation queries the response was YES. Maximal size of possible extension queue 1583. Compared 280039 event pairs, 2599 based on Foata normal form. 78/40131 useless extension candidates. Maximal degree in co-relation 155745. Up to 15293 conditions per place. [2023-08-29 20:26:03,836 INFO L137 encePairwiseOnDemand]: 274/283 looper letters, 141 selfloop transitions, 23 changer transitions 51/215 dead transitions. [2023-08-29 20:26:03,836 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 215 transitions, 1794 flow [2023-08-29 20:26:03,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:26:03,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:26:03,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 813 transitions. [2023-08-29 20:26:03,838 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4787985865724382 [2023-08-29 20:26:03,838 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 813 transitions. [2023-08-29 20:26:03,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 813 transitions. [2023-08-29 20:26:03,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:26:03,839 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 813 transitions. [2023-08-29 20:26:03,840 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 135.5) internal successors, (813), 6 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:03,842 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 283.0) internal successors, (1981), 7 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:03,843 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 283.0) internal successors, (1981), 7 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:03,843 INFO L175 Difference]: Start difference. First operand has 66 places, 62 transitions, 398 flow. Second operand 6 states and 813 transitions. [2023-08-29 20:26:03,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 215 transitions, 1794 flow [2023-08-29 20:26:04,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 215 transitions, 1779 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-29 20:26:04,084 INFO L231 Difference]: Finished difference. Result has 72 places, 70 transitions, 523 flow [2023-08-29 20:26:04,084 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=523, PETRI_PLACES=72, PETRI_TRANSITIONS=70} [2023-08-29 20:26:04,085 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 20 predicate places. [2023-08-29 20:26:04,085 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 70 transitions, 523 flow [2023-08-29 20:26:04,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 122.2) internal successors, (611), 5 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:04,086 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:26:04,086 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:26:04,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-29 20:26:04,086 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:26:04,086 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:26:04,087 INFO L85 PathProgramCache]: Analyzing trace with hash -368934333, now seen corresponding path program 1 times [2023-08-29 20:26:04,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:26:04,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741026852] [2023-08-29 20:26:04,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:26:04,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:26:04,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:26:04,391 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:26:04,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:26:04,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741026852] [2023-08-29 20:26:04,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741026852] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:26:04,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:26:04,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:26:04,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077491104] [2023-08-29 20:26:04,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:26:04,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:26:04,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:26:04,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:26:04,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:26:04,402 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 283 [2023-08-29 20:26:04,403 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 70 transitions, 523 flow. Second operand has 6 states, 6 states have (on average 126.0) internal successors, (756), 6 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:04,403 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:26:04,404 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 283 [2023-08-29 20:26:04,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:26:05,667 INFO L130 PetriNetUnfolder]: 7549/12258 cut-off events. [2023-08-29 20:26:05,667 INFO L131 PetriNetUnfolder]: For 28570/28831 co-relation queries the response was YES. [2023-08-29 20:26:05,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46992 conditions, 12258 events. 7549/12258 cut-off events. For 28570/28831 co-relation queries the response was YES. Maximal size of possible extension queue 605. Compared 87607 event pairs, 864 based on Foata normal form. 775/12788 useless extension candidates. Maximal degree in co-relation 46972. Up to 4127 conditions per place. [2023-08-29 20:26:05,715 INFO L137 encePairwiseOnDemand]: 276/283 looper letters, 122 selfloop transitions, 14 changer transitions 27/178 dead transitions. [2023-08-29 20:26:05,715 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 178 transitions, 1475 flow [2023-08-29 20:26:05,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:26:05,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:26:05,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 829 transitions. [2023-08-29 20:26:05,717 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4882214369846879 [2023-08-29 20:26:05,717 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 829 transitions. [2023-08-29 20:26:05,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 829 transitions. [2023-08-29 20:26:05,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:26:05,718 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 829 transitions. [2023-08-29 20:26:05,720 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 138.16666666666666) internal successors, (829), 6 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:05,722 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 283.0) internal successors, (1981), 7 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:05,722 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 283.0) internal successors, (1981), 7 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:05,722 INFO L175 Difference]: Start difference. First operand has 72 places, 70 transitions, 523 flow. Second operand 6 states and 829 transitions. [2023-08-29 20:26:05,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 178 transitions, 1475 flow [2023-08-29 20:26:06,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 178 transitions, 1415 flow, removed 9 selfloop flow, removed 6 redundant places. [2023-08-29 20:26:06,048 INFO L231 Difference]: Finished difference. Result has 73 places, 70 transitions, 524 flow [2023-08-29 20:26:06,048 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=524, PETRI_PLACES=73, PETRI_TRANSITIONS=70} [2023-08-29 20:26:06,048 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 21 predicate places. [2023-08-29 20:26:06,049 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 70 transitions, 524 flow [2023-08-29 20:26:06,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 126.0) internal successors, (756), 6 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:06,049 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:26:06,049 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:26:06,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-29 20:26:06,049 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:26:06,049 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:26:06,049 INFO L85 PathProgramCache]: Analyzing trace with hash 700480388, now seen corresponding path program 1 times [2023-08-29 20:26:06,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:26:06,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371848374] [2023-08-29 20:26:06,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:26:06,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:26:06,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:26:06,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:26:06,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:26:06,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371848374] [2023-08-29 20:26:06,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371848374] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:26:06,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:26:06,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:26:06,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676360917] [2023-08-29 20:26:06,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:26:06,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:26:06,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:26:06,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:26:06,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:26:06,827 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 283 [2023-08-29 20:26:06,828 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 70 transitions, 524 flow. Second operand has 7 states, 7 states have (on average 119.42857142857143) internal successors, (836), 7 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:06,828 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:26:06,828 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 283 [2023-08-29 20:26:06,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:26:08,482 INFO L130 PetriNetUnfolder]: 10120/15650 cut-off events. [2023-08-29 20:26:08,482 INFO L131 PetriNetUnfolder]: For 42072/42072 co-relation queries the response was YES. [2023-08-29 20:26:08,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64807 conditions, 15650 events. 10120/15650 cut-off events. For 42072/42072 co-relation queries the response was YES. Maximal size of possible extension queue 578. Compared 100692 event pairs, 1326 based on Foata normal form. 9/15659 useless extension candidates. Maximal degree in co-relation 64789. Up to 7598 conditions per place. [2023-08-29 20:26:08,566 INFO L137 encePairwiseOnDemand]: 271/283 looper letters, 166 selfloop transitions, 54 changer transitions 35/255 dead transitions. [2023-08-29 20:26:08,566 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 255 transitions, 2188 flow [2023-08-29 20:26:08,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-29 20:26:08,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-29 20:26:08,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1195 transitions. [2023-08-29 20:26:08,569 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4691794267765999 [2023-08-29 20:26:08,570 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1195 transitions. [2023-08-29 20:26:08,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1195 transitions. [2023-08-29 20:26:08,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:26:08,570 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1195 transitions. [2023-08-29 20:26:08,573 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 132.77777777777777) internal successors, (1195), 9 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:08,575 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 283.0) internal successors, (2830), 10 states have internal predecessors, (2830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:08,576 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 283.0) internal successors, (2830), 10 states have internal predecessors, (2830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:08,576 INFO L175 Difference]: Start difference. First operand has 73 places, 70 transitions, 524 flow. Second operand 9 states and 1195 transitions. [2023-08-29 20:26:08,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 255 transitions, 2188 flow [2023-08-29 20:26:08,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 255 transitions, 2072 flow, removed 28 selfloop flow, removed 3 redundant places. [2023-08-29 20:26:08,901 INFO L231 Difference]: Finished difference. Result has 82 places, 107 transitions, 994 flow [2023-08-29 20:26:08,901 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=493, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=994, PETRI_PLACES=82, PETRI_TRANSITIONS=107} [2023-08-29 20:26:08,901 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 30 predicate places. [2023-08-29 20:26:08,902 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 107 transitions, 994 flow [2023-08-29 20:26:08,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 119.42857142857143) internal successors, (836), 7 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:08,902 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:26:08,902 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:26:08,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-29 20:26:08,903 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:26:08,903 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:26:08,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1125498404, now seen corresponding path program 2 times [2023-08-29 20:26:08,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:26:08,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904219170] [2023-08-29 20:26:08,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:26:08,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:26:08,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:26:09,209 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:26:09,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:26:09,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904219170] [2023-08-29 20:26:09,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904219170] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:26:09,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:26:09,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:26:09,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494008082] [2023-08-29 20:26:09,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:26:09,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:26:09,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:26:09,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:26:09,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:26:09,229 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 283 [2023-08-29 20:26:09,230 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 107 transitions, 994 flow. Second operand has 7 states, 7 states have (on average 126.0) internal successors, (882), 7 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:09,230 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:26:09,230 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 283 [2023-08-29 20:26:09,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:26:10,243 INFO L130 PetriNetUnfolder]: 4866/7864 cut-off events. [2023-08-29 20:26:10,243 INFO L131 PetriNetUnfolder]: For 26493/26847 co-relation queries the response was YES. [2023-08-29 20:26:10,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34803 conditions, 7864 events. 4866/7864 cut-off events. For 26493/26847 co-relation queries the response was YES. Maximal size of possible extension queue 434. Compared 52502 event pairs, 542 based on Foata normal form. 211/7910 useless extension candidates. Maximal degree in co-relation 34779. Up to 3117 conditions per place. [2023-08-29 20:26:10,304 INFO L137 encePairwiseOnDemand]: 276/283 looper letters, 103 selfloop transitions, 18 changer transitions 70/202 dead transitions. [2023-08-29 20:26:10,304 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 202 transitions, 2040 flow [2023-08-29 20:26:10,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:26:10,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:26:10,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 939 transitions. [2023-08-29 20:26:10,307 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47400302877334677 [2023-08-29 20:26:10,307 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 939 transitions. [2023-08-29 20:26:10,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 939 transitions. [2023-08-29 20:26:10,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:26:10,308 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 939 transitions. [2023-08-29 20:26:10,310 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 134.14285714285714) internal successors, (939), 7 states have internal predecessors, (939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:10,312 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:10,312 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:10,313 INFO L175 Difference]: Start difference. First operand has 82 places, 107 transitions, 994 flow. Second operand 7 states and 939 transitions. [2023-08-29 20:26:10,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 202 transitions, 2040 flow [2023-08-29 20:26:10,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 202 transitions, 1996 flow, removed 9 selfloop flow, removed 3 redundant places. [2023-08-29 20:26:10,611 INFO L231 Difference]: Finished difference. Result has 87 places, 72 transitions, 593 flow [2023-08-29 20:26:10,611 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=904, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=593, PETRI_PLACES=87, PETRI_TRANSITIONS=72} [2023-08-29 20:26:10,612 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 35 predicate places. [2023-08-29 20:26:10,612 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 72 transitions, 593 flow [2023-08-29 20:26:10,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 126.0) internal successors, (882), 7 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:10,612 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:26:10,613 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:26:10,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-29 20:26:10,613 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:26:10,613 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:26:10,613 INFO L85 PathProgramCache]: Analyzing trace with hash -428302937, now seen corresponding path program 1 times [2023-08-29 20:26:10,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:26:10,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392786093] [2023-08-29 20:26:10,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:26:10,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:26:10,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:26:10,884 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:26:10,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:26:10,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392786093] [2023-08-29 20:26:10,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392786093] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:26:10,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:26:10,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:26:10,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771145314] [2023-08-29 20:26:10,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:26:10,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:26:10,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:26:10,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:26:10,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:26:10,895 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 283 [2023-08-29 20:26:10,896 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 72 transitions, 593 flow. Second operand has 4 states, 4 states have (on average 132.25) internal successors, (529), 4 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:10,896 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:26:10,896 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 283 [2023-08-29 20:26:10,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:26:11,266 INFO L130 PetriNetUnfolder]: 1617/2669 cut-off events. [2023-08-29 20:26:11,267 INFO L131 PetriNetUnfolder]: For 9142/9185 co-relation queries the response was YES. [2023-08-29 20:26:11,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11952 conditions, 2669 events. 1617/2669 cut-off events. For 9142/9185 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 14221 event pairs, 430 based on Foata normal form. 10/2654 useless extension candidates. Maximal degree in co-relation 11927. Up to 1129 conditions per place. [2023-08-29 20:26:11,281 INFO L137 encePairwiseOnDemand]: 280/283 looper letters, 65 selfloop transitions, 1 changer transitions 69/138 dead transitions. [2023-08-29 20:26:11,281 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 138 transitions, 1377 flow [2023-08-29 20:26:11,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:26:11,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:26:11,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 554 transitions. [2023-08-29 20:26:11,283 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48939929328621906 [2023-08-29 20:26:11,283 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 554 transitions. [2023-08-29 20:26:11,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 554 transitions. [2023-08-29 20:26:11,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:26:11,284 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 554 transitions. [2023-08-29 20:26:11,285 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 138.5) internal successors, (554), 4 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:11,287 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 283.0) internal successors, (1415), 5 states have internal predecessors, (1415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:11,287 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 283.0) internal successors, (1415), 5 states have internal predecessors, (1415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:11,287 INFO L175 Difference]: Start difference. First operand has 87 places, 72 transitions, 593 flow. Second operand 4 states and 554 transitions. [2023-08-29 20:26:11,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 138 transitions, 1377 flow [2023-08-29 20:26:11,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 138 transitions, 1220 flow, removed 30 selfloop flow, removed 10 redundant places. [2023-08-29 20:26:11,322 INFO L231 Difference]: Finished difference. Result has 80 places, 50 transitions, 325 flow [2023-08-29 20:26:11,322 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=505, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=325, PETRI_PLACES=80, PETRI_TRANSITIONS=50} [2023-08-29 20:26:11,323 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 28 predicate places. [2023-08-29 20:26:11,323 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 50 transitions, 325 flow [2023-08-29 20:26:11,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.25) internal successors, (529), 4 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:11,324 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:26:11,324 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:26:11,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-29 20:26:11,325 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:26:11,325 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:26:11,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1328716811, now seen corresponding path program 2 times [2023-08-29 20:26:11,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:26:11,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214606278] [2023-08-29 20:26:11,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:26:11,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:26:11,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:26:12,288 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:26:12,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:26:12,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214606278] [2023-08-29 20:26:12,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214606278] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:26:12,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:26:12,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:26:12,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993447252] [2023-08-29 20:26:12,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:26:12,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-29 20:26:12,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:26:12,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-29 20:26:12,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-29 20:26:12,359 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 283 [2023-08-29 20:26:12,360 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 50 transitions, 325 flow. Second operand has 8 states, 8 states have (on average 118.5) internal successors, (948), 8 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:12,360 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:26:12,360 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 283 [2023-08-29 20:26:12,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:26:12,767 INFO L130 PetriNetUnfolder]: 960/1558 cut-off events. [2023-08-29 20:26:12,767 INFO L131 PetriNetUnfolder]: For 3421/3421 co-relation queries the response was YES. [2023-08-29 20:26:12,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6382 conditions, 1558 events. 960/1558 cut-off events. For 3421/3421 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 6761 event pairs, 200 based on Foata normal form. 1/1559 useless extension candidates. Maximal degree in co-relation 6359. Up to 1009 conditions per place. [2023-08-29 20:26:12,775 INFO L137 encePairwiseOnDemand]: 276/283 looper letters, 60 selfloop transitions, 6 changer transitions 44/110 dead transitions. [2023-08-29 20:26:12,775 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 110 transitions, 862 flow [2023-08-29 20:26:12,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:26:12,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:26:12,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 994 transitions. [2023-08-29 20:26:12,778 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43904593639575973 [2023-08-29 20:26:12,778 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 994 transitions. [2023-08-29 20:26:12,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 994 transitions. [2023-08-29 20:26:12,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:26:12,779 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 994 transitions. [2023-08-29 20:26:12,781 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 124.25) internal successors, (994), 8 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:12,784 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 283.0) internal successors, (2547), 9 states have internal predecessors, (2547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:12,796 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 283.0) internal successors, (2547), 9 states have internal predecessors, (2547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:12,797 INFO L175 Difference]: Start difference. First operand has 80 places, 50 transitions, 325 flow. Second operand 8 states and 994 transitions. [2023-08-29 20:26:12,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 110 transitions, 862 flow [2023-08-29 20:26:12,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 110 transitions, 679 flow, removed 26 selfloop flow, removed 17 redundant places. [2023-08-29 20:26:12,811 INFO L231 Difference]: Finished difference. Result has 69 places, 45 transitions, 221 flow [2023-08-29 20:26:12,812 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=221, PETRI_PLACES=69, PETRI_TRANSITIONS=45} [2023-08-29 20:26:12,813 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 17 predicate places. [2023-08-29 20:26:12,813 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 45 transitions, 221 flow [2023-08-29 20:26:12,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 118.5) internal successors, (948), 8 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:12,814 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:26:12,814 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:26:12,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-29 20:26:12,814 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:26:12,815 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:26:12,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1988139123, now seen corresponding path program 3 times [2023-08-29 20:26:12,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:26:12,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137157591] [2023-08-29 20:26:12,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:26:12,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:26:12,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:26:12,878 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:26:12,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:26:12,983 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 20:26:12,984 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:26:12,985 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-29 20:26:12,987 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-29 20:26:12,990 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-29 20:26:12,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-29 20:26:12,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-29 20:26:12,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-29 20:26:12,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-29 20:26:12,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-29 20:26:12,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-29 20:26:12,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-29 20:26:12,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-29 20:26:12,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-29 20:26:12,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-29 20:26:12,993 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-29 20:26:12,993 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-29 20:26:12,993 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-29 20:26:12,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-29 20:26:12,993 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:26:12,999 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:26:12,999 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:26:13,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:26:13 BasicIcfg [2023-08-29 20:26:13,076 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:26:13,077 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:26:13,077 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:26:13,077 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:26:13,078 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:25:35" (3/4) ... [2023-08-29 20:26:13,080 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:26:13,080 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:26:13,081 INFO L158 Benchmark]: Toolchain (without parser) took 38856.09ms. Allocated memory was 73.4MB in the beginning and 4.0GB in the end (delta: 3.9GB). Free memory was 49.2MB in the beginning and 2.0GB in the end (delta: -2.0GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. [2023-08-29 20:26:13,081 INFO L158 Benchmark]: CDTParser took 0.91ms. Allocated memory is still 73.4MB. Free memory is still 50.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:26:13,081 INFO L158 Benchmark]: CACSL2BoogieTranslator took 647.83ms. Allocated memory was 73.4MB in the beginning and 104.9MB in the end (delta: 31.5MB). Free memory was 49.1MB in the beginning and 75.1MB in the end (delta: -26.0MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. [2023-08-29 20:26:13,082 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.56ms. Allocated memory is still 104.9MB. Free memory was 75.1MB in the beginning and 72.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:26:13,082 INFO L158 Benchmark]: Boogie Preprocessor took 61.37ms. Allocated memory is still 104.9MB. Free memory was 72.4MB in the beginning and 70.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:26:13,082 INFO L158 Benchmark]: RCFGBuilder took 814.81ms. Allocated memory is still 104.9MB. Free memory was 70.2MB in the beginning and 59.0MB in the end (delta: 11.2MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. [2023-08-29 20:26:13,082 INFO L158 Benchmark]: TraceAbstraction took 37244.04ms. Allocated memory was 104.9MB in the beginning and 4.0GB in the end (delta: 3.9GB). Free memory was 58.1MB in the beginning and 2.0GB in the end (delta: -2.0GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. [2023-08-29 20:26:13,083 INFO L158 Benchmark]: Witness Printer took 3.23ms. Allocated memory is still 4.0GB. Free memory is still 2.0GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:26:13,084 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.91ms. Allocated memory is still 73.4MB. Free memory is still 50.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 647.83ms. Allocated memory was 73.4MB in the beginning and 104.9MB in the end (delta: 31.5MB). Free memory was 49.1MB in the beginning and 75.1MB in the end (delta: -26.0MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.56ms. Allocated memory is still 104.9MB. Free memory was 75.1MB in the beginning and 72.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.37ms. Allocated memory is still 104.9MB. Free memory was 72.4MB in the beginning and 70.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 814.81ms. Allocated memory is still 104.9MB. Free memory was 70.2MB in the beginning and 59.0MB in the end (delta: 11.2MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. * TraceAbstraction took 37244.04ms. Allocated memory was 104.9MB in the beginning and 4.0GB in the end (delta: 3.9GB). Free memory was 58.1MB in the beginning and 2.0GB in the end (delta: -2.0GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. * Witness Printer took 3.23ms. Allocated memory is still 4.0GB. Free memory is still 2.0GB. 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.6s, 152 PlacesBefore, 52 PlacesAfterwards, 141 TransitionsBefore, 39 TransitionsAfterwards, 3636 CoEnabledTransitionPairs, 7 FixpointIterations, 53 TrivialSequentialCompositions, 74 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 138 TotalNumberOfCompositions, 10048 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4437, independent: 4199, independent conditional: 0, independent unconditional: 4199, dependent: 238, dependent conditional: 0, dependent unconditional: 238, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1933, independent: 1875, independent conditional: 0, independent unconditional: 1875, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4437, independent: 2324, independent conditional: 0, independent unconditional: 2324, dependent: 180, dependent conditional: 0, dependent unconditional: 180, unknown: 1933, unknown conditional: 0, unknown unconditional: 1933] , Statistics on independence cache: Total cache size (in pairs): 208, Positive cache size: 186, Positive conditional cache size: 0, Positive unconditional cache size: 186, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool b$flush_delayed; [L724] 0 int b$mem_tmp; [L725] 0 _Bool b$r_buff0_thd0; [L726] 0 _Bool b$r_buff0_thd1; [L727] 0 _Bool b$r_buff0_thd2; [L728] 0 _Bool b$r_buff0_thd3; [L729] 0 _Bool b$r_buff0_thd4; [L730] 0 _Bool b$r_buff1_thd0; [L731] 0 _Bool b$r_buff1_thd1; [L732] 0 _Bool b$r_buff1_thd2; [L733] 0 _Bool b$r_buff1_thd3; [L734] 0 _Bool b$r_buff1_thd4; [L735] 0 _Bool b$read_delayed; [L736] 0 int *b$read_delayed_var; [L737] 0 int b$w_buff0; [L738] 0 _Bool b$w_buff0_used; [L739] 0 int b$w_buff1; [L740] 0 _Bool b$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t969; [L872] FCALL, FORK 0 pthread_create(&t969, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t969, ((void *)0), P0, ((void *)0))=-3, t969={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t970; [L874] FCALL, FORK 0 pthread_create(&t970, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t970, ((void *)0), P1, ((void *)0))=-2, t969={5:0}, t970={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t971; [L876] FCALL, FORK 0 pthread_create(&t971, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t971, ((void *)0), P2, ((void *)0))=-1, t969={5:0}, t970={6:0}, t971={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L877] 0 pthread_t t972; [L878] FCALL, FORK 0 pthread_create(&t972, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t972, ((void *)0), P3, ((void *)0))=0, t969={5:0}, t970={6:0}, t971={7:0}, t972={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 b$w_buff1 = b$w_buff0 [L755] 1 b$w_buff0 = 1 [L756] 1 b$w_buff1_used = b$w_buff0_used [L757] 1 b$w_buff0_used = (_Bool)1 [L758] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L758] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L759] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L760] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L761] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L762] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L763] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L764] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L767] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L784] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L790] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L791] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L792] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L793] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L794] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L804] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L824] 4 z = 1 [L827] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L830] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 b$flush_delayed = weak$$choice2 [L836] 4 b$mem_tmp = b [L837] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L838] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L839] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L840] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L841] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L843] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = b [L845] 4 b = b$flush_delayed ? b$mem_tmp : b [L846] 4 b$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L849] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L850] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L851] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L852] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L853] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L770] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L771] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L772] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L773] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L774] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L810] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L811] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L812] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L813] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L814] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L819] 3 return 0; [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t969={5:0}, t970={6:0}, t971={7:0}, t972={3:0}, weak$$choice2=0, x=2, y=1, z=1] [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L885] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L886] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L887] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L888] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t969={5:0}, t970={6:0}, t971={7:0}, t972={3:0}, weak$$choice2=0, x=2, y=1, z=1] [L891] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, 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: -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: 869]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 872]: 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: 878]: 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: 876]: 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: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 183 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 37.0s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 25.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1284 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1079 mSDsluCounter, 420 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 296 mSDsCounter, 159 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2786 IncrementalHoareTripleChecker+Invalid, 2945 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 159 mSolverCounterUnsat, 124 mSDtfsCounter, 2786 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=994occurred in iteration=13, InterpolantAutomatonStates: 82, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 297 NumberOfCodeBlocks, 297 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 253 ConstructedInterpolants, 0 QuantifiedInterpolants, 2644 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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:26:13,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix037_power.oepc_pso.oepc_rmo.oepc.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 82646a2180350347ed217a12e2836ec5fdce4b0371f5e0f7afa776fd6812fa0f --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:26:15,386 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:26:15,389 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:26:15,434 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:26:15,434 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:26:15,437 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:26:15,439 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:26:15,442 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:26:15,444 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:26:15,451 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:26:15,452 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:26:15,454 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:26:15,454 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:26:15,456 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:26:15,457 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:26:15,463 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:26:15,464 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:26:15,465 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:26:15,467 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:26:15,472 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:26:15,474 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:26:15,475 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:26:15,476 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:26:15,477 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:26:15,483 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:26:15,483 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:26:15,484 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:26:15,485 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:26:15,487 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:26:15,488 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:26:15,488 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:26:15,490 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:26:15,492 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:26:15,492 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:26:15,493 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:26:15,493 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:26:15,494 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:26:15,494 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:26:15,494 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:26:15,495 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:26:15,495 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:26:15,497 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:26:15,534 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:26:15,534 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:26:15,536 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:26:15,536 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:26:15,537 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:26:15,537 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:26:15,538 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:26:15,538 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:26:15,538 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:26:15,538 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:26:15,539 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:26:15,539 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:26:15,539 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:26:15,540 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:26:15,540 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:26:15,540 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:26:15,540 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:26:15,540 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:26:15,541 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:26:15,541 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:26:15,541 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-29 20:26:15,541 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-29 20:26:15,541 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:26:15,541 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:26:15,542 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:26:15,542 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:26:15,542 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:26:15,542 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:26:15,543 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:26:15,543 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:26:15,543 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-29 20:26:15,543 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-29 20:26:15,544 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:26:15,544 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:26:15,544 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:26:15,544 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-29 20:26:15,544 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:26:15,545 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 -> 82646a2180350347ed217a12e2836ec5fdce4b0371f5e0f7afa776fd6812fa0f 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:26:15,839 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:26:15,858 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:26:15,860 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:26:15,861 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:26:15,863 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:26:15,864 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix037_power.oepc_pso.oepc_rmo.oepc.i [2023-08-29 20:26:17,050 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:26:17,285 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:26:17,296 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix037_power.oepc_pso.oepc_rmo.oepc.i [2023-08-29 20:26:17,315 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/037c88d91/31d8131d9b57480497c9a5aa0b9923d5/FLAG92e8ef145 [2023-08-29 20:26:17,328 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/037c88d91/31d8131d9b57480497c9a5aa0b9923d5 [2023-08-29 20:26:17,330 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:26:17,331 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:26:17,337 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:26:17,337 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:26:17,340 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:26:17,345 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:26:17" (1/1) ... [2023-08-29 20:26:17,346 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bb94e00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:26:17, skipping insertion in model container [2023-08-29 20:26:17,346 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:26:17" (1/1) ... [2023-08-29 20:26:17,352 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:26:17,401 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:26:17,589 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/mix037_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-29 20:26:17,805 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:26:17,822 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:26:17,834 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/mix037_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-29 20:26:17,897 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:26:17,937 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:26:17,937 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:26:17,943 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:26:17,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:26:17 WrapperNode [2023-08-29 20:26:17,944 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:26:17,945 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:26:17,946 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:26:17,946 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:26:17,952 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:26:17" (1/1) ... [2023-08-29 20:26:17,989 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:26:17" (1/1) ... [2023-08-29 20:26:18,023 INFO L138 Inliner]: procedures = 180, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 147 [2023-08-29 20:26:18,024 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:26:18,025 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:26:18,025 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:26:18,025 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:26:18,035 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:26:17" (1/1) ... [2023-08-29 20:26:18,036 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:26:17" (1/1) ... [2023-08-29 20:26:18,049 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:26:17" (1/1) ... [2023-08-29 20:26:18,052 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:26:17" (1/1) ... [2023-08-29 20:26:18,062 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:26:17" (1/1) ... [2023-08-29 20:26:18,076 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:26:17" (1/1) ... [2023-08-29 20:26:18,079 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:26:17" (1/1) ... [2023-08-29 20:26:18,082 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:26:17" (1/1) ... [2023-08-29 20:26:18,093 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:26:18,094 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:26:18,097 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:26:18,098 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:26:18,098 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:26:17" (1/1) ... [2023-08-29 20:26:18,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:26:18,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:26:18,127 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:26:18,139 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:26:18,170 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:26:18,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:26:18,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:26:18,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:26:18,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-29 20:26:18,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-29 20:26:18,171 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:26:18,171 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:26:18,171 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:26:18,172 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:26:18,172 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-29 20:26:18,172 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-29 20:26:18,172 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-29 20:26:18,172 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-29 20:26:18,172 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:26:18,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:26:18,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:26:18,174 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:26:18,354 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:26:18,371 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:26:18,750 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:26:18,872 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:26:18,873 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:26:18,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:26:18 BoogieIcfgContainer [2023-08-29 20:26:18,876 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:26:18,878 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:26:18,878 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:26:18,882 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:26:18,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:26:17" (1/3) ... [2023-08-29 20:26:18,883 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5550b84f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:26:18, skipping insertion in model container [2023-08-29 20:26:18,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:26:17" (2/3) ... [2023-08-29 20:26:18,883 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5550b84f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:26:18, skipping insertion in model container [2023-08-29 20:26:18,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:26:18" (3/3) ... [2023-08-29 20:26:18,885 INFO L112 eAbstractionObserver]: Analyzing ICFG mix037_power.oepc_pso.oepc_rmo.oepc.i [2023-08-29 20:26:18,899 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:26:18,899 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-29 20:26:18,899 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:26:18,984 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:26:19,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 146 transitions, 312 flow [2023-08-29 20:26:19,104 INFO L130 PetriNetUnfolder]: 2/142 cut-off events. [2023-08-29 20:26:19,105 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:26:19,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 142 events. 2/142 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 109 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-29 20:26:19,111 INFO L82 GeneralOperation]: Start removeDead. Operand has 157 places, 146 transitions, 312 flow [2023-08-29 20:26:19,120 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 153 places, 142 transitions, 296 flow [2023-08-29 20:26:19,124 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:26:19,142 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 142 transitions, 296 flow [2023-08-29 20:26:19,148 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 153 places, 142 transitions, 296 flow [2023-08-29 20:26:19,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 142 transitions, 296 flow [2023-08-29 20:26:19,198 INFO L130 PetriNetUnfolder]: 2/142 cut-off events. [2023-08-29 20:26:19,198 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:26:19,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 142 events. 2/142 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 108 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-29 20:26:19,204 INFO L119 LiptonReduction]: Number of co-enabled transitions 3636 [2023-08-29 20:26:25,727 INFO L134 LiptonReduction]: Checked pairs total: 9249 [2023-08-29 20:26:25,727 INFO L136 LiptonReduction]: Total number of compositions: 135 [2023-08-29 20:26:25,751 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:26:25,759 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;@17a34acc, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:26:25,759 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-29 20:26:25,761 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-29 20:26:25,761 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:26:25,761 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:26:25,762 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:26:25,763 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:26:25,767 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:26:25,767 INFO L85 PathProgramCache]: Analyzing trace with hash 615, now seen corresponding path program 1 times [2023-08-29 20:26:25,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:26:25,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2023946410] [2023-08-29 20:26:25,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:26:25,779 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:26:25,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:26:25,783 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:26:25,794 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:26:25,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:26:25,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-29 20:26:25,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:26:25,869 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:26:25,869 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:26:25,870 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:26:25,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2023946410] [2023-08-29 20:26:25,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2023946410] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:26:25,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:26:25,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:26:25,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733872529] [2023-08-29 20:26:25,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:26:25,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:26:25,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:26:25,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:26:25,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:26:25,910 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 281 [2023-08-29 20:26:25,912 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 90 flow. Second operand has 2 states, 2 states have (on average 131.5) internal successors, (263), 2 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:25,912 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:26:25,912 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 281 [2023-08-29 20:26:25,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:26:27,228 INFO L130 PetriNetUnfolder]: 7479/10189 cut-off events. [2023-08-29 20:26:27,228 INFO L131 PetriNetUnfolder]: For 82/82 co-relation queries the response was YES. [2023-08-29 20:26:27,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20497 conditions, 10189 events. 7479/10189 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 478. Compared 52492 event pairs, 7479 based on Foata normal form. 0/8785 useless extension candidates. Maximal degree in co-relation 20485. Up to 10091 conditions per place. [2023-08-29 20:26:27,304 INFO L137 encePairwiseOnDemand]: 273/281 looper letters, 27 selfloop transitions, 0 changer transitions 0/31 dead transitions. [2023-08-29 20:26:27,304 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 31 transitions, 128 flow [2023-08-29 20:26:27,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:26:27,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:26:27,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 297 transitions. [2023-08-29 20:26:27,316 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5284697508896797 [2023-08-29 20:26:27,316 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 297 transitions. [2023-08-29 20:26:27,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 297 transitions. [2023-08-29 20:26:27,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:26:27,320 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 297 transitions. [2023-08-29 20:26:27,322 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 148.5) internal successors, (297), 2 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:27,326 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:27,327 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:27,328 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 90 flow. Second operand 2 states and 297 transitions. [2023-08-29 20:26:27,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 31 transitions, 128 flow [2023-08-29 20:26:27,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 31 transitions, 124 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-29 20:26:27,335 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 70 flow [2023-08-29 20:26:27,336 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=70, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2023-08-29 20:26:27,339 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -11 predicate places. [2023-08-29 20:26:27,339 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 70 flow [2023-08-29 20:26:27,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 131.5) internal successors, (263), 2 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:27,340 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:26:27,340 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 20:26:27,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-08-29 20:26:27,549 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:26:27,549 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:26:27,550 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:26:27,550 INFO L85 PathProgramCache]: Analyzing trace with hash 604401, now seen corresponding path program 1 times [2023-08-29 20:26:27,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:26:27,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1362507841] [2023-08-29 20:26:27,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:26:27,551 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:26:27,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:26:27,552 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:26:27,564 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:26:27,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:26:27,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:26:27,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:26:27,668 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:26:27,668 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:26:27,668 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:26:27,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1362507841] [2023-08-29 20:26:27,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1362507841] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:26:27,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:26:27,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:26:27,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486910107] [2023-08-29 20:26:27,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:26:27,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:26:27,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:26:27,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:26:27,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:26:27,706 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 281 [2023-08-29 20:26:27,706 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:27,706 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:26:27,706 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 281 [2023-08-29 20:26:27,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:26:28,826 INFO L130 PetriNetUnfolder]: 5879/8510 cut-off events. [2023-08-29 20:26:28,827 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:26:28,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16651 conditions, 8510 events. 5879/8510 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 51046 event pairs, 1079 based on Foata normal form. 0/7854 useless extension candidates. Maximal degree in co-relation 16648. Up to 6367 conditions per place. [2023-08-29 20:26:28,895 INFO L137 encePairwiseOnDemand]: 278/281 looper letters, 43 selfloop transitions, 2 changer transitions 2/51 dead transitions. [2023-08-29 20:26:28,895 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 51 transitions, 210 flow [2023-08-29 20:26:28,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:26:28,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:26:28,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 438 transitions. [2023-08-29 20:26:28,900 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5195729537366548 [2023-08-29 20:26:28,900 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 438 transitions. [2023-08-29 20:26:28,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 438 transitions. [2023-08-29 20:26:28,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:26:28,901 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 438 transitions. [2023-08-29 20:26:28,902 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:28,905 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:28,906 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:28,906 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 70 flow. Second operand 3 states and 438 transitions. [2023-08-29 20:26:28,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 51 transitions, 210 flow [2023-08-29 20:26:28,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 51 transitions, 210 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:26:28,907 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 70 flow [2023-08-29 20:26:28,907 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2023-08-29 20:26:28,908 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -10 predicate places. [2023-08-29 20:26:28,908 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 70 flow [2023-08-29 20:26:28,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:28,909 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:26:28,909 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:26:28,920 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:26:29,117 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:26:29,117 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:26:29,117 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:26:29,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1634148415, now seen corresponding path program 1 times [2023-08-29 20:26:29,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:26:29,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [464473317] [2023-08-29 20:26:29,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:26:29,119 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:26:29,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:26:29,120 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:26:29,123 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:26:29,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:26:29,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:26:29,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:26:29,278 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:26:29,278 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:26:29,279 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:26:29,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [464473317] [2023-08-29 20:26:29,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [464473317] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:26:29,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:26:29,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:26:29,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520994476] [2023-08-29 20:26:29,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:26:29,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:26:29,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:26:29,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:26:29,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:26:29,309 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 281 [2023-08-29 20:26:29,310 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:29,310 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:26:29,310 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 281 [2023-08-29 20:26:29,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:26:29,930 INFO L130 PetriNetUnfolder]: 3939/5649 cut-off events. [2023-08-29 20:26:29,930 INFO L131 PetriNetUnfolder]: For 377/377 co-relation queries the response was YES. [2023-08-29 20:26:29,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11798 conditions, 5649 events. 3939/5649 cut-off events. For 377/377 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 30531 event pairs, 655 based on Foata normal form. 320/5714 useless extension candidates. Maximal degree in co-relation 11794. Up to 3025 conditions per place. [2023-08-29 20:26:29,966 INFO L137 encePairwiseOnDemand]: 274/281 looper letters, 51 selfloop transitions, 6 changer transitions 1/62 dead transitions. [2023-08-29 20:26:29,966 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 62 transitions, 262 flow [2023-08-29 20:26:29,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:26:29,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:26:29,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 556 transitions. [2023-08-29 20:26:29,968 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49466192170818507 [2023-08-29 20:26:29,968 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 556 transitions. [2023-08-29 20:26:29,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 556 transitions. [2023-08-29 20:26:29,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:26:29,969 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 556 transitions. [2023-08-29 20:26:29,970 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.0) internal successors, (556), 4 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:29,972 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:29,973 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:29,973 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 70 flow. Second operand 4 states and 556 transitions. [2023-08-29 20:26:29,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 62 transitions, 262 flow [2023-08-29 20:26:29,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 62 transitions, 254 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:26:29,975 INFO L231 Difference]: Finished difference. Result has 44 places, 33 transitions, 108 flow [2023-08-29 20:26:29,975 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2023-08-29 20:26:29,976 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -8 predicate places. [2023-08-29 20:26:29,976 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 108 flow [2023-08-29 20:26:29,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:29,977 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:26:29,977 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:26:29,989 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:26:30,186 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:26:30,186 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:26:30,187 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:26:30,187 INFO L85 PathProgramCache]: Analyzing trace with hash 791621518, now seen corresponding path program 1 times [2023-08-29 20:26:30,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:26:30,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [937164097] [2023-08-29 20:26:30,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:26:30,188 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:26:30,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:26:30,189 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:26:30,196 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:26:30,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:26:30,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:26:30,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:26:30,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:26:30,340 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:26:30,340 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:26:30,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [937164097] [2023-08-29 20:26:30,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [937164097] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:26:30,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:26:30,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:26:30,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199497137] [2023-08-29 20:26:30,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:26:30,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:26:30,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:26:30,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:26:30,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:26:30,355 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 281 [2023-08-29 20:26:30,356 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 108 flow. Second operand has 5 states, 5 states have (on average 126.8) internal successors, (634), 5 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:30,356 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:26:30,356 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 281 [2023-08-29 20:26:30,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:26:30,896 INFO L130 PetriNetUnfolder]: 2022/3083 cut-off events. [2023-08-29 20:26:30,896 INFO L131 PetriNetUnfolder]: For 914/914 co-relation queries the response was YES. [2023-08-29 20:26:30,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7831 conditions, 3083 events. 2022/3083 cut-off events. For 914/914 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 16180 event pairs, 328 based on Foata normal form. 212/3202 useless extension candidates. Maximal degree in co-relation 7825. Up to 1044 conditions per place. [2023-08-29 20:26:30,911 INFO L137 encePairwiseOnDemand]: 274/281 looper letters, 64 selfloop transitions, 10 changer transitions 1/79 dead transitions. [2023-08-29 20:26:30,911 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 79 transitions, 379 flow [2023-08-29 20:26:30,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:26:30,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:26:30,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 697 transitions. [2023-08-29 20:26:30,914 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49608540925266903 [2023-08-29 20:26:30,914 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 697 transitions. [2023-08-29 20:26:30,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 697 transitions. [2023-08-29 20:26:30,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:26:30,915 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 697 transitions. [2023-08-29 20:26:30,917 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 139.4) internal successors, (697), 5 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:30,919 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:30,920 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:30,920 INFO L175 Difference]: Start difference. First operand has 44 places, 33 transitions, 108 flow. Second operand 5 states and 697 transitions. [2023-08-29 20:26:30,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 79 transitions, 379 flow [2023-08-29 20:26:30,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 79 transitions, 368 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-29 20:26:30,924 INFO L231 Difference]: Finished difference. Result has 48 places, 37 transitions, 160 flow [2023-08-29 20:26:30,924 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=160, PETRI_PLACES=48, PETRI_TRANSITIONS=37} [2023-08-29 20:26:30,925 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -4 predicate places. [2023-08-29 20:26:30,925 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 160 flow [2023-08-29 20:26:30,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.8) internal successors, (634), 5 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:30,926 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:26:30,926 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:26:30,939 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:26:31,136 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:26:31,137 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:26:31,137 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:26:31,137 INFO L85 PathProgramCache]: Analyzing trace with hash -914658613, now seen corresponding path program 1 times [2023-08-29 20:26:31,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:26:31,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2128680393] [2023-08-29 20:26:31,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:26:31,138 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:26:31,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:26:31,139 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:26:31,142 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:26:31,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:26:31,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-29 20:26:31,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:26:31,301 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:26:31,301 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:26:31,301 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:26:31,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2128680393] [2023-08-29 20:26:31,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2128680393] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:26:31,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:26:31,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:26:31,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747567708] [2023-08-29 20:26:31,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:26:31,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:26:31,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:26:31,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:26:31,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:26:31,317 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 281 [2023-08-29 20:26:31,318 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 160 flow. Second operand has 6 states, 6 states have (on average 126.83333333333333) internal successors, (761), 6 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:31,318 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:26:31,318 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 281 [2023-08-29 20:26:31,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:26:31,723 INFO L130 PetriNetUnfolder]: 1176/1850 cut-off events. [2023-08-29 20:26:31,724 INFO L131 PetriNetUnfolder]: For 1577/1577 co-relation queries the response was YES. [2023-08-29 20:26:31,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5346 conditions, 1850 events. 1176/1850 cut-off events. For 1577/1577 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 9136 event pairs, 326 based on Foata normal form. 77/1897 useless extension candidates. Maximal degree in co-relation 5339. Up to 630 conditions per place. [2023-08-29 20:26:31,733 INFO L137 encePairwiseOnDemand]: 274/281 looper letters, 75 selfloop transitions, 14 changer transitions 1/94 dead transitions. [2023-08-29 20:26:31,734 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 94 transitions, 502 flow [2023-08-29 20:26:31,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:26:31,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:26:31,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 836 transitions. [2023-08-29 20:26:31,737 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4958481613285884 [2023-08-29 20:26:31,737 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 836 transitions. [2023-08-29 20:26:31,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 836 transitions. [2023-08-29 20:26:31,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:26:31,738 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 836 transitions. [2023-08-29 20:26:31,740 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 139.33333333333334) internal successors, (836), 6 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:31,743 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 281.0) internal successors, (1967), 7 states have internal predecessors, (1967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:31,744 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 281.0) internal successors, (1967), 7 states have internal predecessors, (1967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:31,744 INFO L175 Difference]: Start difference. First operand has 48 places, 37 transitions, 160 flow. Second operand 6 states and 836 transitions. [2023-08-29 20:26:31,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 94 transitions, 502 flow [2023-08-29 20:26:31,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 94 transitions, 472 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-08-29 20:26:31,758 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 210 flow [2023-08-29 20:26:31,758 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=210, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2023-08-29 20:26:31,760 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -1 predicate places. [2023-08-29 20:26:31,760 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 210 flow [2023-08-29 20:26:31,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 126.83333333333333) internal successors, (761), 6 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:31,762 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:26:31,762 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:26:31,772 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:26:31,972 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:26:31,972 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:26:31,973 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:26:31,973 INFO L85 PathProgramCache]: Analyzing trace with hash -61646761, now seen corresponding path program 1 times [2023-08-29 20:26:31,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:26:31,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1652214247] [2023-08-29 20:26:31,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:26:31,973 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:26:31,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:26:31,974 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:26:31,977 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:26:32,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:26:32,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-29 20:26:32,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:26:32,167 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:26:32,167 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:26:32,167 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:26:32,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1652214247] [2023-08-29 20:26:32,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1652214247] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:26:32,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:26:32,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:26:32,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681051656] [2023-08-29 20:26:32,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:26:32,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:26:32,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:26:32,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:26:32,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:26:32,184 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 281 [2023-08-29 20:26:32,186 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 210 flow. Second operand has 7 states, 7 states have (on average 126.85714285714286) internal successors, (888), 7 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:32,186 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:26:32,186 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 281 [2023-08-29 20:26:32,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:26:32,642 INFO L130 PetriNetUnfolder]: 1011/1570 cut-off events. [2023-08-29 20:26:32,642 INFO L131 PetriNetUnfolder]: For 1446/1446 co-relation queries the response was YES. [2023-08-29 20:26:32,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4611 conditions, 1570 events. 1011/1570 cut-off events. For 1446/1446 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7534 event pairs, 326 based on Foata normal form. 14/1567 useless extension candidates. Maximal degree in co-relation 4603. Up to 630 conditions per place. [2023-08-29 20:26:32,651 INFO L137 encePairwiseOnDemand]: 274/281 looper letters, 58 selfloop transitions, 18 changer transitions 1/81 dead transitions. [2023-08-29 20:26:32,651 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 81 transitions, 460 flow [2023-08-29 20:26:32,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:26:32,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:26:32,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 947 transitions. [2023-08-29 20:26:32,654 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4814438230808338 [2023-08-29 20:26:32,654 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 947 transitions. [2023-08-29 20:26:32,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 947 transitions. [2023-08-29 20:26:32,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:26:32,655 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 947 transitions. [2023-08-29 20:26:32,657 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 135.28571428571428) internal successors, (947), 7 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:32,659 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 281.0) internal successors, (2248), 8 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:32,660 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 281.0) internal successors, (2248), 8 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:32,660 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 210 flow. Second operand 7 states and 947 transitions. [2023-08-29 20:26:32,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 81 transitions, 460 flow [2023-08-29 20:26:32,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 81 transitions, 414 flow, removed 9 selfloop flow, removed 5 redundant places. [2023-08-29 20:26:32,673 INFO L231 Difference]: Finished difference. Result has 54 places, 41 transitions, 220 flow [2023-08-29 20:26:32,673 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=220, PETRI_PLACES=54, PETRI_TRANSITIONS=41} [2023-08-29 20:26:32,675 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 2 predicate places. [2023-08-29 20:26:32,675 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 41 transitions, 220 flow [2023-08-29 20:26:32,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 126.85714285714286) internal successors, (888), 7 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:32,676 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:26:32,676 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:26:32,692 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:26:32,886 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:26:32,886 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:26:32,886 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:26:32,886 INFO L85 PathProgramCache]: Analyzing trace with hash 466172065, now seen corresponding path program 1 times [2023-08-29 20:26:32,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:26:32,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1986799886] [2023-08-29 20:26:32,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:26:32,887 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:26:32,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:26:32,888 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:26:32,889 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:26:33,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:26:33,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-29 20:26:33,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:26:33,649 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:26:33,649 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:26:33,649 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:26:33,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1986799886] [2023-08-29 20:26:33,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1986799886] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:26:33,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:26:33,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:26:33,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594460203] [2023-08-29 20:26:33,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:26:33,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:26:33,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:26:33,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:26:33,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:26:34,032 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 281 [2023-08-29 20:26:34,033 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 41 transitions, 220 flow. Second operand has 6 states, 6 states have (on average 115.0) internal successors, (690), 6 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:26:34,033 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:26:34,033 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 281 [2023-08-29 20:26:34,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:26:34,437 INFO L130 PetriNetUnfolder]: 999/1543 cut-off events. [2023-08-29 20:26:34,438 INFO L131 PetriNetUnfolder]: For 1611/1611 co-relation queries the response was YES. [2023-08-29 20:26:34,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4484 conditions, 1543 events. 999/1543 cut-off events. For 1611/1611 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7162 event pairs, 151 based on Foata normal form. 0/1543 useless extension candidates. Maximal degree in co-relation 4475. Up to 1251 conditions per place. [2023-08-29 20:26:34,446 INFO L137 encePairwiseOnDemand]: 276/281 looper letters, 58 selfloop transitions, 4 changer transitions 0/66 dead transitions. [2023-08-29 20:26:34,447 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 66 transitions, 478 flow [2023-08-29 20:26:34,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:26:34,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:26:34,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 709 transitions. [2023-08-29 20:26:34,450 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42052194543297744 [2023-08-29 20:26:34,450 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 709 transitions. [2023-08-29 20:26:34,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 709 transitions. [2023-08-29 20:26:34,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:26:34,450 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 709 transitions. [2023-08-29 20:26:34,452 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 118.16666666666667) internal successors, (709), 6 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:34,454 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 281.0) internal successors, (1967), 7 states have internal predecessors, (1967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:34,454 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 281.0) internal successors, (1967), 7 states have internal predecessors, (1967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:34,454 INFO L175 Difference]: Start difference. First operand has 54 places, 41 transitions, 220 flow. Second operand 6 states and 709 transitions. [2023-08-29 20:26:34,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 66 transitions, 478 flow [2023-08-29 20:26:34,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 66 transitions, 324 flow, removed 17 selfloop flow, removed 11 redundant places. [2023-08-29 20:26:34,461 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 128 flow [2023-08-29 20:26:34,461 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=128, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2023-08-29 20:26:34,462 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -5 predicate places. [2023-08-29 20:26:34,462 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 128 flow [2023-08-29 20:26:34,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.0) internal successors, (690), 6 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:26:34,463 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:26:34,463 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:26:34,477 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:26:34,673 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:26:34,674 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:26:34,674 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:26:34,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1405210741, now seen corresponding path program 1 times [2023-08-29 20:26:34,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:26:34,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [178041698] [2023-08-29 20:26:34,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:26:34,675 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:26:34,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:26:34,676 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:26:34,678 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:26:34,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:26:34,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-29 20:26:34,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:26:35,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:26:35,094 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:26:35,094 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:26:35,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [178041698] [2023-08-29 20:26:35,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [178041698] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:26:35,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:26:35,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:26:35,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871224714] [2023-08-29 20:26:35,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:26:35,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:26:35,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:26:35,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:26:35,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:26:35,144 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 281 [2023-08-29 20:26:35,145 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 128 flow. Second operand has 7 states, 7 states have (on average 128.42857142857142) internal successors, (899), 7 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:35,145 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:26:35,145 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 281 [2023-08-29 20:26:35,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:26:35,540 INFO L130 PetriNetUnfolder]: 1527/2405 cut-off events. [2023-08-29 20:26:35,541 INFO L131 PetriNetUnfolder]: For 403/403 co-relation queries the response was YES. [2023-08-29 20:26:35,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5812 conditions, 2405 events. 1527/2405 cut-off events. For 403/403 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 12425 event pairs, 293 based on Foata normal form. 1/2402 useless extension candidates. Maximal degree in co-relation 5808. Up to 836 conditions per place. [2023-08-29 20:26:35,553 INFO L137 encePairwiseOnDemand]: 274/281 looper letters, 83 selfloop transitions, 6 changer transitions 45/138 dead transitions. [2023-08-29 20:26:35,553 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 138 transitions, 728 flow [2023-08-29 20:26:35,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:26:35,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:26:35,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 956 transitions. [2023-08-29 20:26:35,557 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4860193187595323 [2023-08-29 20:26:35,557 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 956 transitions. [2023-08-29 20:26:35,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 956 transitions. [2023-08-29 20:26:35,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:26:35,558 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 956 transitions. [2023-08-29 20:26:35,560 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 136.57142857142858) internal successors, (956), 7 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:35,562 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 281.0) internal successors, (2248), 8 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:35,563 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 281.0) internal successors, (2248), 8 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:35,563 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 128 flow. Second operand 7 states and 956 transitions. [2023-08-29 20:26:35,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 138 transitions, 728 flow [2023-08-29 20:26:35,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 138 transitions, 711 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-29 20:26:35,566 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 159 flow [2023-08-29 20:26:35,567 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=159, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2023-08-29 20:26:35,567 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 1 predicate places. [2023-08-29 20:26:35,567 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 159 flow [2023-08-29 20:26:35,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 128.42857142857142) internal successors, (899), 7 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:35,568 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:26:35,568 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:26:35,581 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:26:35,781 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:26:35,782 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:26:35,782 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:26:35,782 INFO L85 PathProgramCache]: Analyzing trace with hash 396946239, now seen corresponding path program 2 times [2023-08-29 20:26:35,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:26:35,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [203612150] [2023-08-29 20:26:35,783 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 20:26:35,783 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:26:35,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:26:35,785 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:26:35,787 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:26:35,908 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-29 20:26:35,908 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:26:35,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:26:35,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:26:35,936 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:26:35,937 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:26:35,937 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:26:35,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [203612150] [2023-08-29 20:26:35,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [203612150] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:26:35,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:26:35,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:26:35,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814542884] [2023-08-29 20:26:35,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:26:35,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:26:35,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:26:35,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:26:35,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:26:35,943 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 281 [2023-08-29 20:26:35,944 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 159 flow. Second operand has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:35,944 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:26:35,944 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 281 [2023-08-29 20:26:35,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:26:36,274 INFO L130 PetriNetUnfolder]: 2367/3731 cut-off events. [2023-08-29 20:26:36,274 INFO L131 PetriNetUnfolder]: For 1624/1624 co-relation queries the response was YES. [2023-08-29 20:26:36,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10081 conditions, 3731 events. 2367/3731 cut-off events. For 1624/1624 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 21484 event pairs, 885 based on Foata normal form. 1/3715 useless extension candidates. Maximal degree in co-relation 10073. Up to 2038 conditions per place. [2023-08-29 20:26:36,290 INFO L137 encePairwiseOnDemand]: 278/281 looper letters, 62 selfloop transitions, 2 changer transitions 12/79 dead transitions. [2023-08-29 20:26:36,290 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 79 transitions, 440 flow [2023-08-29 20:26:36,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:26:36,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:26:36,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 430 transitions. [2023-08-29 20:26:36,292 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5100830367734283 [2023-08-29 20:26:36,292 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 430 transitions. [2023-08-29 20:26:36,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 430 transitions. [2023-08-29 20:26:36,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:26:36,292 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 430 transitions. [2023-08-29 20:26:36,293 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:36,295 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:36,295 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:36,295 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 159 flow. Second operand 3 states and 430 transitions. [2023-08-29 20:26:36,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 79 transitions, 440 flow [2023-08-29 20:26:36,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 79 transitions, 433 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-29 20:26:36,298 INFO L231 Difference]: Finished difference. Result has 51 places, 44 transitions, 162 flow [2023-08-29 20:26:36,298 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=162, PETRI_PLACES=51, PETRI_TRANSITIONS=44} [2023-08-29 20:26:36,298 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -1 predicate places. [2023-08-29 20:26:36,298 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 162 flow [2023-08-29 20:26:36,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:36,299 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:26:36,299 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:26:36,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-08-29 20:26:36,509 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:26:36,509 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:26:36,510 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:26:36,510 INFO L85 PathProgramCache]: Analyzing trace with hash 607160477, now seen corresponding path program 3 times [2023-08-29 20:26:36,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:26:36,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [521181839] [2023-08-29 20:26:36,510 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-29 20:26:36,511 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:26:36,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:26:36,512 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:26:36,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-08-29 20:26:36,639 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-29 20:26:36,639 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:26:36,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:26:36,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:26:36,682 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:26:36,683 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:26:36,683 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:26:36,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [521181839] [2023-08-29 20:26:36,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [521181839] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:26:36,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:26:36,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:26:36,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324029136] [2023-08-29 20:26:36,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:26:36,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:26:36,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:26:36,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:26:36,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:26:36,695 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 281 [2023-08-29 20:26:36,696 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 44 transitions, 162 flow. Second operand has 4 states, 4 states have (on average 133.25) internal successors, (533), 4 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:36,696 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:26:36,696 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 281 [2023-08-29 20:26:36,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:26:37,014 INFO L130 PetriNetUnfolder]: 1658/2686 cut-off events. [2023-08-29 20:26:37,014 INFO L131 PetriNetUnfolder]: For 1452/1453 co-relation queries the response was YES. [2023-08-29 20:26:37,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7598 conditions, 2686 events. 1658/2686 cut-off events. For 1452/1453 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 14456 event pairs, 228 based on Foata normal form. 1/2685 useless extension candidates. Maximal degree in co-relation 7591. Up to 1241 conditions per place. [2023-08-29 20:26:37,026 INFO L137 encePairwiseOnDemand]: 278/281 looper letters, 54 selfloop transitions, 1 changer transitions 33/91 dead transitions. [2023-08-29 20:26:37,026 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 91 transitions, 514 flow [2023-08-29 20:26:37,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:26:37,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:26:37,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 561 transitions. [2023-08-29 20:26:37,028 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4991103202846975 [2023-08-29 20:26:37,028 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 561 transitions. [2023-08-29 20:26:37,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 561 transitions. [2023-08-29 20:26:37,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:26:37,029 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 561 transitions. [2023-08-29 20:26:37,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.25) internal successors, (561), 4 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:37,032 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:37,032 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:37,032 INFO L175 Difference]: Start difference. First operand has 51 places, 44 transitions, 162 flow. Second operand 4 states and 561 transitions. [2023-08-29 20:26:37,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 91 transitions, 514 flow [2023-08-29 20:26:37,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 91 transitions, 506 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-29 20:26:37,035 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 154 flow [2023-08-29 20:26:37,036 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=154, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2023-08-29 20:26:37,037 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 2 predicate places. [2023-08-29 20:26:37,037 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 154 flow [2023-08-29 20:26:37,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.25) internal successors, (533), 4 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:37,037 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:26:37,037 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:26:37,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-08-29 20:26:37,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:26:37,248 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:26:37,248 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:26:37,248 INFO L85 PathProgramCache]: Analyzing trace with hash 219714201, now seen corresponding path program 4 times [2023-08-29 20:26:37,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:26:37,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1204135057] [2023-08-29 20:26:37,249 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-29 20:26:37,249 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:26:37,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:26:37,250 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:26:37,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-08-29 20:26:37,367 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-29 20:26:37,367 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:26:37,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:26:37,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:26:37,403 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:26:37,403 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:26:37,403 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:26:37,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1204135057] [2023-08-29 20:26:37,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1204135057] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:26:37,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:26:37,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:26:37,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693852347] [2023-08-29 20:26:37,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:26:37,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:26:37,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:26:37,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:26:37,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:26:37,414 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 281 [2023-08-29 20:26:37,415 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 154 flow. Second operand has 4 states, 4 states have (on average 133.25) internal successors, (533), 4 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:37,415 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:26:37,415 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 281 [2023-08-29 20:26:37,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:26:37,643 INFO L130 PetriNetUnfolder]: 1342/2172 cut-off events. [2023-08-29 20:26:37,643 INFO L131 PetriNetUnfolder]: For 1455/1459 co-relation queries the response was YES. [2023-08-29 20:26:37,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6059 conditions, 2172 events. 1342/2172 cut-off events. For 1455/1459 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 11027 event pairs, 436 based on Foata normal form. 1/2149 useless extension candidates. Maximal degree in co-relation 6051. Up to 843 conditions per place. [2023-08-29 20:26:37,671 INFO L137 encePairwiseOnDemand]: 278/281 looper letters, 52 selfloop transitions, 1 changer transitions 31/87 dead transitions. [2023-08-29 20:26:37,671 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 87 transitions, 501 flow [2023-08-29 20:26:37,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:26:37,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:26:37,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 557 transitions. [2023-08-29 20:26:37,673 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49555160142348753 [2023-08-29 20:26:37,674 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 557 transitions. [2023-08-29 20:26:37,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 557 transitions. [2023-08-29 20:26:37,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:26:37,674 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 557 transitions. [2023-08-29 20:26:37,676 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.25) internal successors, (557), 4 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:37,677 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:37,678 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:37,678 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 154 flow. Second operand 4 states and 557 transitions. [2023-08-29 20:26:37,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 87 transitions, 501 flow [2023-08-29 20:26:37,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 87 transitions, 483 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-29 20:26:37,680 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 152 flow [2023-08-29 20:26:37,680 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=152, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2023-08-29 20:26:37,681 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 3 predicate places. [2023-08-29 20:26:37,681 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 152 flow [2023-08-29 20:26:37,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.25) internal successors, (533), 4 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:37,681 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:26:37,682 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:26:37,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-08-29 20:26:37,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:26:37,895 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:26:37,895 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:26:37,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1986792153, now seen corresponding path program 5 times [2023-08-29 20:26:37,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:26:37,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1894786876] [2023-08-29 20:26:37,896 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-29 20:26:37,896 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:26:37,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:26:37,897 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:26:37,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-08-29 20:26:38,014 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-29 20:26:38,015 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:26:38,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-29 20:26:38,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:26:38,457 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:26:38,457 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:26:38,458 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:26:38,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1894786876] [2023-08-29 20:26:38,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1894786876] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:26:38,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:26:38,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:26:38,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546667718] [2023-08-29 20:26:38,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:26:38,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-29 20:26:38,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:26:38,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-29 20:26:38,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-08-29 20:26:38,519 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 281 [2023-08-29 20:26:38,520 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 152 flow. Second operand has 8 states, 8 states have (on average 128.0) internal successors, (1024), 8 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:38,521 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:26:38,521 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 281 [2023-08-29 20:26:38,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:26:38,904 INFO L130 PetriNetUnfolder]: 966/1574 cut-off events. [2023-08-29 20:26:38,904 INFO L131 PetriNetUnfolder]: For 1054/1066 co-relation queries the response was YES. [2023-08-29 20:26:38,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4460 conditions, 1574 events. 966/1574 cut-off events. For 1054/1066 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 7640 event pairs, 150 based on Foata normal form. 11/1558 useless extension candidates. Maximal degree in co-relation 4451. Up to 981 conditions per place. [2023-08-29 20:26:38,910 INFO L137 encePairwiseOnDemand]: 275/281 looper letters, 50 selfloop transitions, 5 changer transitions 36/95 dead transitions. [2023-08-29 20:26:38,910 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 95 transitions, 520 flow [2023-08-29 20:26:38,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:26:38,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:26:38,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 936 transitions. [2023-08-29 20:26:38,913 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4758515505846467 [2023-08-29 20:26:38,914 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 936 transitions. [2023-08-29 20:26:38,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 936 transitions. [2023-08-29 20:26:38,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:26:38,914 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 936 transitions. [2023-08-29 20:26:38,916 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 133.71428571428572) internal successors, (936), 7 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:38,919 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 281.0) internal successors, (2248), 8 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:38,919 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 281.0) internal successors, (2248), 8 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:38,920 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 152 flow. Second operand 7 states and 936 transitions. [2023-08-29 20:26:38,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 95 transitions, 520 flow [2023-08-29 20:26:38,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 95 transitions, 515 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-29 20:26:38,923 INFO L231 Difference]: Finished difference. Result has 60 places, 42 transitions, 166 flow [2023-08-29 20:26:38,923 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=166, PETRI_PLACES=60, PETRI_TRANSITIONS=42} [2023-08-29 20:26:38,923 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 8 predicate places. [2023-08-29 20:26:38,923 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 42 transitions, 166 flow [2023-08-29 20:26:38,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 128.0) internal successors, (1024), 8 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:38,924 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:26:38,924 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:26:38,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-08-29 20:26:39,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:26:39,134 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:26:39,135 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:26:39,135 INFO L85 PathProgramCache]: Analyzing trace with hash 414423161, now seen corresponding path program 6 times [2023-08-29 20:26:39,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:26:39,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [990138628] [2023-08-29 20:26:39,136 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-29 20:26:39,137 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:26:39,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:26:39,138 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:26:39,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-08-29 20:26:39,268 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2023-08-29 20:26:39,268 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-29 20:26:39,268 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:26:39,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:26:39,411 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-29 20:26:39,411 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:26:39,412 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-29 20:26:39,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-29 20:26:39,414 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-29 20:26:39,414 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-29 20:26:39,414 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-29 20:26:39,414 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-29 20:26:39,414 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-29 20:26:39,414 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-29 20:26:39,415 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-29 20:26:39,415 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-29 20:26:39,415 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-29 20:26:39,415 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-29 20:26:39,415 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-29 20:26:39,415 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-29 20:26:39,415 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-29 20:26:39,416 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-29 20:26:39,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-08-29 20:26:39,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:26:39,627 INFO L445 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:26:39,631 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:26:39,631 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:26:39,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:26:39 BasicIcfg [2023-08-29 20:26:39,726 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:26:39,726 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:26:39,726 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:26:39,727 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:26:39,727 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:26:18" (3/4) ... [2023-08-29 20:26:39,729 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:26:39,729 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:26:39,729 INFO L158 Benchmark]: Toolchain (without parser) took 22398.16ms. Allocated memory was 75.5MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 44.5MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 404.5MB. Max. memory is 16.1GB. [2023-08-29 20:26:39,730 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 56.6MB. Free memory was 34.1MB in the beginning and 34.0MB in the end (delta: 81.6kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:26:39,730 INFO L158 Benchmark]: CACSL2BoogieTranslator took 607.35ms. Allocated memory is still 75.5MB. Free memory was 44.2MB in the beginning and 37.3MB in the end (delta: 6.9MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. [2023-08-29 20:26:39,730 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.71ms. Allocated memory is still 75.5MB. Free memory was 37.3MB in the beginning and 34.9MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-29 20:26:39,730 INFO L158 Benchmark]: Boogie Preprocessor took 69.22ms. Allocated memory is still 75.5MB. Free memory was 34.5MB in the beginning and 32.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:26:39,731 INFO L158 Benchmark]: RCFGBuilder took 781.50ms. Allocated memory is still 75.5MB. Free memory was 32.4MB in the beginning and 36.8MB in the end (delta: -4.4MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. [2023-08-29 20:26:39,731 INFO L158 Benchmark]: TraceAbstraction took 20848.03ms. Allocated memory was 75.5MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 36.0MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 397.5MB. Max. memory is 16.1GB. [2023-08-29 20:26:39,731 INFO L158 Benchmark]: Witness Printer took 2.74ms. Allocated memory is still 1.7GB. Free memory is still 1.2GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:26:39,732 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.16ms. Allocated memory is still 56.6MB. Free memory was 34.1MB in the beginning and 34.0MB in the end (delta: 81.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 607.35ms. Allocated memory is still 75.5MB. Free memory was 44.2MB in the beginning and 37.3MB in the end (delta: 6.9MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.71ms. Allocated memory is still 75.5MB. Free memory was 37.3MB in the beginning and 34.9MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.22ms. Allocated memory is still 75.5MB. Free memory was 34.5MB in the beginning and 32.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 781.50ms. Allocated memory is still 75.5MB. Free memory was 32.4MB in the beginning and 36.8MB in the end (delta: -4.4MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. * TraceAbstraction took 20848.03ms. Allocated memory was 75.5MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 36.0MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 397.5MB. Max. memory is 16.1GB. * Witness Printer took 2.74ms. Allocated memory is still 1.7GB. Free memory is still 1.2GB. 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: 6.6s, 153 PlacesBefore, 52 PlacesAfterwards, 142 TransitionsBefore, 39 TransitionsAfterwards, 3636 CoEnabledTransitionPairs, 6 FixpointIterations, 54 TrivialSequentialCompositions, 71 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 135 TotalNumberOfCompositions, 9249 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4043, independent: 3839, independent conditional: 0, independent unconditional: 3839, dependent: 204, dependent conditional: 0, dependent unconditional: 204, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1953, independent: 1888, independent conditional: 0, independent unconditional: 1888, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4043, independent: 1951, independent conditional: 0, independent unconditional: 1951, dependent: 139, dependent conditional: 0, dependent unconditional: 139, unknown: 1953, unknown conditional: 0, unknown unconditional: 1953] , Statistics on independence cache: Total cache size (in pairs): 207, Positive cache size: 186, Positive conditional cache size: 0, Positive unconditional cache size: 186, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool b$flush_delayed; [L724] 0 int b$mem_tmp; [L725] 0 _Bool b$r_buff0_thd0; [L726] 0 _Bool b$r_buff0_thd1; [L727] 0 _Bool b$r_buff0_thd2; [L728] 0 _Bool b$r_buff0_thd3; [L729] 0 _Bool b$r_buff0_thd4; [L730] 0 _Bool b$r_buff1_thd0; [L731] 0 _Bool b$r_buff1_thd1; [L732] 0 _Bool b$r_buff1_thd2; [L733] 0 _Bool b$r_buff1_thd3; [L734] 0 _Bool b$r_buff1_thd4; [L735] 0 _Bool b$read_delayed; [L736] 0 int *b$read_delayed_var; [L737] 0 int b$w_buff0; [L738] 0 _Bool b$w_buff0_used; [L739] 0 int b$w_buff1; [L740] 0 _Bool b$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t969; [L872] FCALL, FORK 0 pthread_create(&t969, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t969, ((void *)0), P0, ((void *)0))=0, t969={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t970; [L874] FCALL, FORK 0 pthread_create(&t970, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t970, ((void *)0), P1, ((void *)0))=1, t969={3:0}, t970={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t971; [L876] FCALL, FORK 0 pthread_create(&t971, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t971, ((void *)0), P2, ((void *)0))=2, t969={3:0}, t970={7:0}, t971={11:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L877] 0 pthread_t t972; [L878] FCALL, FORK 0 pthread_create(&t972, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t972, ((void *)0), P3, ((void *)0))=3, t969={3:0}, t970={7:0}, t971={11:0}, t972={15:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 b$w_buff1 = b$w_buff0 [L755] 1 b$w_buff0 = 1 [L756] 1 b$w_buff1_used = b$w_buff0_used [L757] 1 b$w_buff0_used = (_Bool)1 [L758] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L758] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L759] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L760] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L761] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L762] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L763] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L764] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L767] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L784] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L804] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L824] 4 z = 1 [L827] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L830] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 b$flush_delayed = weak$$choice2 [L836] 4 b$mem_tmp = b [L837] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L838] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L839] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L840] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L841] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L843] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = b [L845] 4 b = b$flush_delayed ? b$mem_tmp : b [L846] 4 b$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L790] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L791] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L792] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L793] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L794] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L849] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L850] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L851] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L852] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L853] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L770] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L771] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L772] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L773] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L774] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L810] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L811] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L812] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L813] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L814] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L819] 3 return 0; [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t969={3:0}, t970={7:0}, t971={11:0}, t972={15:0}, weak$$choice2=0, x=2, y=1, z=1] [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L885] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L886] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L887] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L888] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t969={3:0}, t970={7:0}, t971={11:0}, t972={15:0}, weak$$choice2=0, x=2, y=1, z=1] [L891] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, 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: -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: 869]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 872]: 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: 878]: 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: 876]: 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: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 184 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 20.6s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 7.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 763 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 664 mSDsluCounter, 171 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 143 mSDsCounter, 101 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2047 IncrementalHoareTripleChecker+Invalid, 2148 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 101 mSolverCounterUnsat, 28 mSDtfsCounter, 2047 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 246 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=220occurred in iteration=6, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 268 NumberOfCodeBlocks, 268 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 228 ConstructedInterpolants, 15 QuantifiedInterpolants, 2208 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1950 ConjunctsInSsa, 98 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:26:39,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample