./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix020.oepc.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --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/mix020.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 035ec41aa2053cde8ee24830f9eb7cf444ea0c142ead33ef0c1fe95c3a7de39e --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 02:47:56,298 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 02:47:56,301 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 02:47:56,342 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 02:47:56,345 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 02:47:56,348 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 02:47:56,350 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 02:47:56,353 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 02:47:56,355 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 02:47:56,359 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 02:47:56,360 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 02:47:56,363 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 02:47:56,363 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 02:47:56,365 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 02:47:56,366 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 02:47:56,371 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 02:47:56,372 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 02:47:56,374 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 02:47:56,375 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 02:47:56,380 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 02:47:56,381 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 02:47:56,382 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 02:47:56,383 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 02:47:56,384 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 02:47:56,390 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 02:47:56,391 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 02:47:56,391 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 02:47:56,393 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 02:47:56,394 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 02:47:56,395 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 02:47:56,395 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 02:47:56,401 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 02:47:56,403 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 02:47:56,403 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 02:47:56,404 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 02:47:56,404 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 02:47:56,405 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 02:47:56,405 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 02:47:56,405 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 02:47:56,406 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 02:47:56,407 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 02:47:56,408 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-30 02:47:56,444 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 02:47:56,445 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 02:47:56,446 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 02:47:56,446 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 02:47:56,447 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 02:47:56,447 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 02:47:56,447 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 02:47:56,448 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 02:47:56,448 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 02:47:56,448 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 02:47:56,449 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 02:47:56,449 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 02:47:56,449 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 02:47:56,449 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 02:47:56,450 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 02:47:56,450 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 02:47:56,450 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 02:47:56,450 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 02:47:56,450 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 02:47:56,451 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 02:47:56,451 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 02:47:56,451 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 02:47:56,451 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 02:47:56,451 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 02:47:56,451 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 02:47:56,452 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:47:56,452 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 02:47:56,452 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 02:47:56,452 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 02:47:56,453 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 02:47:56,453 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 02:47:56,453 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 02:47:56,453 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 02:47:56,453 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 02:47:56,454 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 -> 035ec41aa2053cde8ee24830f9eb7cf444ea0c142ead33ef0c1fe95c3a7de39e 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 -> TOGETHER [2023-08-30 02:47:56,742 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 02:47:56,767 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 02:47:56,770 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 02:47:56,771 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 02:47:56,771 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 02:47:56,772 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix020.oepc.i [2023-08-30 02:47:57,886 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 02:47:58,160 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 02:47:58,161 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix020.oepc.i [2023-08-30 02:47:58,171 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a94ce5041/f2265bb32c194549892686c0c3a8f0c1/FLAG57a1dca6c [2023-08-30 02:47:58,185 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a94ce5041/f2265bb32c194549892686c0c3a8f0c1 [2023-08-30 02:47:58,187 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 02:47:58,189 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 02:47:58,191 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 02:47:58,191 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 02:47:58,202 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 02:47:58,203 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:47:58" (1/1) ... [2023-08-30 02:47:58,204 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54463f33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:47:58, skipping insertion in model container [2023-08-30 02:47:58,205 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:47:58" (1/1) ... [2023-08-30 02:47:58,211 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 02:47:58,272 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 02:47:58,448 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/mix020.oepc.i[945,958] [2023-08-30 02:47:58,699 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:47:58,712 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 02:47:58,724 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/mix020.oepc.i[945,958] [2023-08-30 02:47:58,797 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:47:58,832 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:47:58,832 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:47:58,838 INFO L208 MainTranslator]: Completed translation [2023-08-30 02:47:58,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:47:58 WrapperNode [2023-08-30 02:47:58,839 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 02:47:58,840 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 02:47:58,840 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 02:47:58,841 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 02:47:58,847 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:47:58" (1/1) ... [2023-08-30 02:47:58,882 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:47:58" (1/1) ... [2023-08-30 02:47:58,919 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2023-08-30 02:47:58,920 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 02:47:58,921 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 02:47:58,921 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 02:47:58,921 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 02:47:58,929 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:47:58" (1/1) ... [2023-08-30 02:47:58,930 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:47:58" (1/1) ... [2023-08-30 02:47:58,945 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:47:58" (1/1) ... [2023-08-30 02:47:58,945 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:47:58" (1/1) ... [2023-08-30 02:47:58,955 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:47:58" (1/1) ... [2023-08-30 02:47:58,965 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:47:58" (1/1) ... [2023-08-30 02:47:58,968 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:47:58" (1/1) ... [2023-08-30 02:47:58,974 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:47:58" (1/1) ... [2023-08-30 02:47:58,977 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 02:47:58,983 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 02:47:58,983 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 02:47:58,983 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 02:47:58,984 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:47:58" (1/1) ... [2023-08-30 02:47:58,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:47:59,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:47:59,018 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-30 02:47:59,025 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-30 02:47:59,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 02:47:59,058 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 02:47:59,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 02:47:59,059 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 02:47:59,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 02:47:59,059 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 02:47:59,059 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 02:47:59,059 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 02:47:59,059 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 02:47:59,059 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 02:47:59,060 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 02:47:59,060 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-30 02:47:59,060 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-30 02:47:59,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 02:47:59,060 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 02:47:59,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 02:47:59,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 02:47:59,062 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 02:47:59,242 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 02:47:59,243 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 02:47:59,685 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 02:47:59,801 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 02:47:59,801 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 02:47:59,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:47:59 BoogieIcfgContainer [2023-08-30 02:47:59,803 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 02:47:59,805 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 02:47:59,806 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 02:47:59,808 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 02:47:59,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 02:47:58" (1/3) ... [2023-08-30 02:47:59,809 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1021841e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:47:59, skipping insertion in model container [2023-08-30 02:47:59,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:47:58" (2/3) ... [2023-08-30 02:47:59,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1021841e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:47:59, skipping insertion in model container [2023-08-30 02:47:59,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:47:59" (3/3) ... [2023-08-30 02:47:59,811 INFO L112 eAbstractionObserver]: Analyzing ICFG mix020.oepc.i [2023-08-30 02:47:59,825 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 02:47:59,826 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-30 02:47:59,826 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 02:47:59,884 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 02:47:59,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 143 transitions, 306 flow [2023-08-30 02:47:59,988 INFO L130 PetriNetUnfolder]: 2/139 cut-off events. [2023-08-30 02:47:59,988 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:48:00,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 139 events. 2/139 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 104 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2023-08-30 02:48:00,007 INFO L82 GeneralOperation]: Start removeDead. Operand has 154 places, 143 transitions, 306 flow [2023-08-30 02:48:00,014 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 150 places, 139 transitions, 290 flow [2023-08-30 02:48:00,019 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 02:48:00,033 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 150 places, 139 transitions, 290 flow [2023-08-30 02:48:00,036 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 150 places, 139 transitions, 290 flow [2023-08-30 02:48:00,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 139 transitions, 290 flow [2023-08-30 02:48:00,068 INFO L130 PetriNetUnfolder]: 2/139 cut-off events. [2023-08-30 02:48:00,068 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:48:00,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 139 events. 2/139 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 104 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2023-08-30 02:48:00,076 INFO L119 LiptonReduction]: Number of co-enabled transitions 3524 [2023-08-30 02:48:04,413 INFO L134 LiptonReduction]: Checked pairs total: 10501 [2023-08-30 02:48:04,413 INFO L136 LiptonReduction]: Total number of compositions: 132 [2023-08-30 02:48:04,426 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 02:48:04,432 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;@73c46fd7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 02:48:04,432 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-30 02:48:04,434 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-30 02:48:04,434 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:48:04,434 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:48:04,435 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 02:48:04,435 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-30 02:48:04,439 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:48:04,440 INFO L85 PathProgramCache]: Analyzing trace with hash 605, now seen corresponding path program 1 times [2023-08-30 02:48:04,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:48:04,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503337125] [2023-08-30 02:48:04,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:48:04,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:48:04,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:48:04,591 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-30 02:48:04,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:48:04,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503337125] [2023-08-30 02:48:04,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503337125] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:48:04,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:48:04,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 02:48:04,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006263203] [2023-08-30 02:48:04,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:48:04,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 02:48:04,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:48:04,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 02:48:04,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 02:48:04,632 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 275 [2023-08-30 02:48:04,637 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 94 flow. Second operand has 2 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:04,638 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:48:04,638 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 275 [2023-08-30 02:48:04,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:48:06,127 INFO L130 PetriNetUnfolder]: 8719/11814 cut-off events. [2023-08-30 02:48:06,128 INFO L131 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2023-08-30 02:48:06,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23762 conditions, 11814 events. 8719/11814 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 61267 event pairs, 8719 based on Foata normal form. 0/10310 useless extension candidates. Maximal degree in co-relation 23750. Up to 11731 conditions per place. [2023-08-30 02:48:06,218 INFO L137 encePairwiseOnDemand]: 266/275 looper letters, 28 selfloop transitions, 0 changer transitions 0/32 dead transitions. [2023-08-30 02:48:06,219 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 32 transitions, 132 flow [2023-08-30 02:48:06,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 02:48:06,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 02:48:06,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 293 transitions. [2023-08-30 02:48:06,237 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5327272727272727 [2023-08-30 02:48:06,238 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 293 transitions. [2023-08-30 02:48:06,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 293 transitions. [2023-08-30 02:48:06,241 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:48:06,243 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 293 transitions. [2023-08-30 02:48:06,247 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 146.5) internal successors, (293), 2 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:06,251 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 275.0) internal successors, (825), 3 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:06,252 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 275.0) internal successors, (825), 3 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:06,253 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 94 flow. Second operand 2 states and 293 transitions. [2023-08-30 02:48:06,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 32 transitions, 132 flow [2023-08-30 02:48:06,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 32 transitions, 128 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 02:48:06,261 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 72 flow [2023-08-30 02:48:06,262 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=72, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2023-08-30 02:48:06,266 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -11 predicate places. [2023-08-30 02:48:06,266 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 72 flow [2023-08-30 02:48:06,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:06,267 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:48:06,267 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 02:48:06,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 02:48:06,268 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-30 02:48:06,268 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:48:06,268 INFO L85 PathProgramCache]: Analyzing trace with hash 594507, now seen corresponding path program 1 times [2023-08-30 02:48:06,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:48:06,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155127014] [2023-08-30 02:48:06,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:48:06,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:48:06,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:48:06,513 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-30 02:48:06,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:48:06,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155127014] [2023-08-30 02:48:06,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155127014] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:48:06,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:48:06,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:48:06,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404816234] [2023-08-30 02:48:06,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:48:06,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:48:06,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:48:06,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:48:06,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:48:06,520 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 275 [2023-08-30 02:48:06,521 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:06,521 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:48:06,521 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 275 [2023-08-30 02:48:06,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:48:07,614 INFO L130 PetriNetUnfolder]: 6855/9883 cut-off events. [2023-08-30 02:48:07,614 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:48:07,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19320 conditions, 9883 events. 6855/9883 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 60307 event pairs, 1263 based on Foata normal form. 0/9223 useless extension candidates. Maximal degree in co-relation 19317. Up to 7399 conditions per place. [2023-08-30 02:48:07,676 INFO L137 encePairwiseOnDemand]: 272/275 looper letters, 45 selfloop transitions, 2 changer transitions 2/53 dead transitions. [2023-08-30 02:48:07,676 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 53 transitions, 218 flow [2023-08-30 02:48:07,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:48:07,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:48:07,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 431 transitions. [2023-08-30 02:48:07,678 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5224242424242425 [2023-08-30 02:48:07,679 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 431 transitions. [2023-08-30 02:48:07,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 431 transitions. [2023-08-30 02:48:07,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:48:07,679 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 431 transitions. [2023-08-30 02:48:07,681 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:07,683 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:07,684 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:07,684 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 72 flow. Second operand 3 states and 431 transitions. [2023-08-30 02:48:07,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 53 transitions, 218 flow [2023-08-30 02:48:07,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 53 transitions, 218 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 02:48:07,686 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 72 flow [2023-08-30 02:48:07,686 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2023-08-30 02:48:07,687 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -10 predicate places. [2023-08-30 02:48:07,687 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 72 flow [2023-08-30 02:48:07,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:07,688 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:48:07,688 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:48:07,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 02:48:07,689 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-30 02:48:07,689 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:48:07,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1457007696, now seen corresponding path program 1 times [2023-08-30 02:48:07,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:48:07,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368641102] [2023-08-30 02:48:07,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:48:07,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:48:07,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:48:08,069 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-30 02:48:08,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:48:08,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368641102] [2023-08-30 02:48:08,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368641102] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:48:08,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:48:08,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:48:08,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431593386] [2023-08-30 02:48:08,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:48:08,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:48:08,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:48:08,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:48:08,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:48:08,097 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 275 [2023-08-30 02:48:08,099 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:08,100 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:48:08,100 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 275 [2023-08-30 02:48:08,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:48:10,843 INFO L130 PetriNetUnfolder]: 23679/31838 cut-off events. [2023-08-30 02:48:10,844 INFO L131 PetriNetUnfolder]: For 1591/1591 co-relation queries the response was YES. [2023-08-30 02:48:10,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65741 conditions, 31838 events. 23679/31838 cut-off events. For 1591/1591 co-relation queries the response was YES. Maximal size of possible extension queue 997. Compared 171982 event pairs, 8531 based on Foata normal form. 0/31108 useless extension candidates. Maximal degree in co-relation 65737. Up to 20163 conditions per place. [2023-08-30 02:48:11,060 INFO L137 encePairwiseOnDemand]: 266/275 looper letters, 49 selfloop transitions, 8 changer transitions 0/57 dead transitions. [2023-08-30 02:48:11,060 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 57 transitions, 248 flow [2023-08-30 02:48:11,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:48:11,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:48:11,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 412 transitions. [2023-08-30 02:48:11,062 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4993939393939394 [2023-08-30 02:48:11,062 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 412 transitions. [2023-08-30 02:48:11,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 412 transitions. [2023-08-30 02:48:11,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:48:11,063 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 412 transitions. [2023-08-30 02:48:11,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:11,066 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:11,067 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:11,067 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 72 flow. Second operand 3 states and 412 transitions. [2023-08-30 02:48:11,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 57 transitions, 248 flow [2023-08-30 02:48:11,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 57 transitions, 242 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:48:11,070 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 130 flow [2023-08-30 02:48:11,071 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=44, PETRI_TRANSITIONS=37} [2023-08-30 02:48:11,072 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -9 predicate places. [2023-08-30 02:48:11,075 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 130 flow [2023-08-30 02:48:11,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:11,076 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:48:11,076 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:48:11,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 02:48:11,077 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-30 02:48:11,078 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:48:11,078 INFO L85 PathProgramCache]: Analyzing trace with hash 2077400438, now seen corresponding path program 1 times [2023-08-30 02:48:11,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:48:11,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727930257] [2023-08-30 02:48:11,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:48:11,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:48:11,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:48:11,347 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-30 02:48:11,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:48:11,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727930257] [2023-08-30 02:48:11,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727930257] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:48:11,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:48:11,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:48:11,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621020235] [2023-08-30 02:48:11,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:48:11,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:48:11,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:48:11,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:48:11,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:48:11,371 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 275 [2023-08-30 02:48:11,372 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 130 flow. Second operand has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:11,372 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:48:11,373 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 275 [2023-08-30 02:48:11,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:48:13,673 INFO L130 PetriNetUnfolder]: 22597/30388 cut-off events. [2023-08-30 02:48:13,673 INFO L131 PetriNetUnfolder]: For 11656/11656 co-relation queries the response was YES. [2023-08-30 02:48:13,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75752 conditions, 30388 events. 22597/30388 cut-off events. For 11656/11656 co-relation queries the response was YES. Maximal size of possible extension queue 940. Compared 159148 event pairs, 6072 based on Foata normal form. 230/30618 useless extension candidates. Maximal degree in co-relation 75747. Up to 13783 conditions per place. [2023-08-30 02:48:13,857 INFO L137 encePairwiseOnDemand]: 266/275 looper letters, 62 selfloop transitions, 9 changer transitions 0/71 dead transitions. [2023-08-30 02:48:13,857 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 71 transitions, 370 flow [2023-08-30 02:48:13,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:48:13,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:48:13,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 538 transitions. [2023-08-30 02:48:13,863 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4890909090909091 [2023-08-30 02:48:13,864 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 538 transitions. [2023-08-30 02:48:13,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 538 transitions. [2023-08-30 02:48:13,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:48:13,865 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 538 transitions. [2023-08-30 02:48:13,866 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.5) internal successors, (538), 4 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:13,868 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 275.0) internal successors, (1375), 5 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:13,869 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 275.0) internal successors, (1375), 5 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:13,870 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 130 flow. Second operand 4 states and 538 transitions. [2023-08-30 02:48:13,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 71 transitions, 370 flow [2023-08-30 02:48:13,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 71 transitions, 344 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:48:13,977 INFO L231 Difference]: Finished difference. Result has 48 places, 42 transitions, 182 flow [2023-08-30 02:48:13,978 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=182, PETRI_PLACES=48, PETRI_TRANSITIONS=42} [2023-08-30 02:48:13,979 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -5 predicate places. [2023-08-30 02:48:13,979 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 42 transitions, 182 flow [2023-08-30 02:48:13,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:13,980 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:48:13,980 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:48:13,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 02:48:13,981 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-30 02:48:13,981 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:48:13,981 INFO L85 PathProgramCache]: Analyzing trace with hash 2077402629, now seen corresponding path program 1 times [2023-08-30 02:48:13,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:48:13,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798246253] [2023-08-30 02:48:13,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:48:13,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:48:14,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:48:14,539 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-30 02:48:14,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:48:14,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798246253] [2023-08-30 02:48:14,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798246253] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:48:14,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:48:14,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:48:14,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671651812] [2023-08-30 02:48:14,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:48:14,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:48:14,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:48:14,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:48:14,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:48:14,767 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 275 [2023-08-30 02:48:14,768 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 42 transitions, 182 flow. Second operand has 7 states, 7 states have (on average 112.71428571428571) internal successors, (789), 7 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:14,768 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:48:14,768 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 275 [2023-08-30 02:48:14,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:48:17,161 INFO L130 PetriNetUnfolder]: 18003/25381 cut-off events. [2023-08-30 02:48:17,162 INFO L131 PetriNetUnfolder]: For 14274/14721 co-relation queries the response was YES. [2023-08-30 02:48:17,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63771 conditions, 25381 events. 18003/25381 cut-off events. For 14274/14721 co-relation queries the response was YES. Maximal size of possible extension queue 1009. Compared 150643 event pairs, 2584 based on Foata normal form. 1149/26252 useless extension candidates. Maximal degree in co-relation 63764. Up to 16615 conditions per place. [2023-08-30 02:48:17,349 INFO L137 encePairwiseOnDemand]: 268/275 looper letters, 56 selfloop transitions, 6 changer transitions 20/91 dead transitions. [2023-08-30 02:48:17,349 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 91 transitions, 486 flow [2023-08-30 02:48:17,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:48:17,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:48:17,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 849 transitions. [2023-08-30 02:48:17,358 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44103896103896106 [2023-08-30 02:48:17,358 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 849 transitions. [2023-08-30 02:48:17,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 849 transitions. [2023-08-30 02:48:17,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:48:17,360 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 849 transitions. [2023-08-30 02:48:17,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.28571428571429) internal successors, (849), 7 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-30 02:48:17,368 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 275.0) internal successors, (2200), 8 states have internal predecessors, (2200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:17,369 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 275.0) internal successors, (2200), 8 states have internal predecessors, (2200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:17,369 INFO L175 Difference]: Start difference. First operand has 48 places, 42 transitions, 182 flow. Second operand 7 states and 849 transitions. [2023-08-30 02:48:17,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 91 transitions, 486 flow [2023-08-30 02:48:17,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 91 transitions, 481 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:48:17,429 INFO L231 Difference]: Finished difference. Result has 55 places, 41 transitions, 192 flow [2023-08-30 02:48:17,430 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=192, PETRI_PLACES=55, PETRI_TRANSITIONS=41} [2023-08-30 02:48:17,432 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 2 predicate places. [2023-08-30 02:48:17,432 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 41 transitions, 192 flow [2023-08-30 02:48:17,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 112.71428571428571) internal successors, (789), 7 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:17,433 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:48:17,433 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:48:17,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 02:48:17,433 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:48:17,433 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:48:17,433 INFO L85 PathProgramCache]: Analyzing trace with hash -92582585, now seen corresponding path program 1 times [2023-08-30 02:48:17,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:48:17,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860640578] [2023-08-30 02:48:17,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:48:17,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:48:17,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:48:17,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-30 02:48:17,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:48:17,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860640578] [2023-08-30 02:48:17,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860640578] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:48:17,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:48:17,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:48:17,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306471938] [2023-08-30 02:48:17,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:48:17,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:48:17,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:48:17,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:48:17,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:48:17,671 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 275 [2023-08-30 02:48:17,672 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 41 transitions, 192 flow. Second operand has 4 states, 4 states have (on average 121.25) internal successors, (485), 4 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:17,672 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:48:17,673 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 275 [2023-08-30 02:48:17,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:48:19,377 INFO L130 PetriNetUnfolder]: 19100/25811 cut-off events. [2023-08-30 02:48:19,378 INFO L131 PetriNetUnfolder]: For 19073/19073 co-relation queries the response was YES. [2023-08-30 02:48:19,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70695 conditions, 25811 events. 19100/25811 cut-off events. For 19073/19073 co-relation queries the response was YES. Maximal size of possible extension queue 783. Compared 136234 event pairs, 2894 based on Foata normal form. 40/25851 useless extension candidates. Maximal degree in co-relation 70685. Up to 15757 conditions per place. [2023-08-30 02:48:19,600 INFO L137 encePairwiseOnDemand]: 266/275 looper letters, 69 selfloop transitions, 18 changer transitions 0/87 dead transitions. [2023-08-30 02:48:19,601 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 87 transitions, 546 flow [2023-08-30 02:48:19,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:48:19,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:48:19,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 548 transitions. [2023-08-30 02:48:19,603 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49818181818181817 [2023-08-30 02:48:19,603 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 548 transitions. [2023-08-30 02:48:19,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 548 transitions. [2023-08-30 02:48:19,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:48:19,603 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 548 transitions. [2023-08-30 02:48:19,604 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:19,607 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 275.0) internal successors, (1375), 5 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:19,608 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 275.0) internal successors, (1375), 5 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:19,608 INFO L175 Difference]: Start difference. First operand has 55 places, 41 transitions, 192 flow. Second operand 4 states and 548 transitions. [2023-08-30 02:48:19,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 87 transitions, 546 flow [2023-08-30 02:48:19,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 87 transitions, 516 flow, removed 3 selfloop flow, removed 6 redundant places. [2023-08-30 02:48:19,741 INFO L231 Difference]: Finished difference. Result has 54 places, 52 transitions, 340 flow [2023-08-30 02:48:19,741 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=340, PETRI_PLACES=54, PETRI_TRANSITIONS=52} [2023-08-30 02:48:19,742 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 1 predicate places. [2023-08-30 02:48:19,742 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 52 transitions, 340 flow [2023-08-30 02:48:19,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.25) internal successors, (485), 4 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:19,743 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:48:19,743 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:48:19,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 02:48:19,744 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-30 02:48:19,744 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:48:19,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1424970089, now seen corresponding path program 1 times [2023-08-30 02:48:19,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:48:19,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694659229] [2023-08-30 02:48:19,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:48:19,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:48:19,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:48:19,959 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-30 02:48:19,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:48:19,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694659229] [2023-08-30 02:48:19,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694659229] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:48:19,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:48:19,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:48:19,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510054396] [2023-08-30 02:48:19,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:48:19,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:48:19,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:48:19,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:48:19,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:48:19,973 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 275 [2023-08-30 02:48:19,974 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 52 transitions, 340 flow. Second operand has 4 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:19,974 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:48:19,974 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 275 [2023-08-30 02:48:19,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:48:21,727 INFO L130 PetriNetUnfolder]: 10810/15944 cut-off events. [2023-08-30 02:48:21,727 INFO L131 PetriNetUnfolder]: For 19061/19763 co-relation queries the response was YES. [2023-08-30 02:48:21,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42583 conditions, 15944 events. 10810/15944 cut-off events. For 19061/19763 co-relation queries the response was YES. Maximal size of possible extension queue 698. Compared 99069 event pairs, 2052 based on Foata normal form. 1227/16904 useless extension candidates. Maximal degree in co-relation 42572. Up to 11053 conditions per place. [2023-08-30 02:48:21,872 INFO L137 encePairwiseOnDemand]: 268/275 looper letters, 82 selfloop transitions, 10 changer transitions 2/111 dead transitions. [2023-08-30 02:48:21,872 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 111 transitions, 781 flow [2023-08-30 02:48:21,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:48:21,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:48:21,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 669 transitions. [2023-08-30 02:48:21,876 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48654545454545456 [2023-08-30 02:48:21,876 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 669 transitions. [2023-08-30 02:48:21,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 669 transitions. [2023-08-30 02:48:21,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:48:21,877 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 669 transitions. [2023-08-30 02:48:21,878 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.8) internal successors, (669), 5 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:21,880 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 275.0) internal successors, (1650), 6 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:21,881 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 275.0) internal successors, (1650), 6 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:21,881 INFO L175 Difference]: Start difference. First operand has 54 places, 52 transitions, 340 flow. Second operand 5 states and 669 transitions. [2023-08-30 02:48:21,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 111 transitions, 781 flow [2023-08-30 02:48:21,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 111 transitions, 781 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 02:48:21,915 INFO L231 Difference]: Finished difference. Result has 61 places, 61 transitions, 415 flow [2023-08-30 02:48:21,915 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=415, PETRI_PLACES=61, PETRI_TRANSITIONS=61} [2023-08-30 02:48:21,916 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 8 predicate places. [2023-08-30 02:48:21,916 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 61 transitions, 415 flow [2023-08-30 02:48:21,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:21,917 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:48:21,917 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-30 02:48:21,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 02:48:21,918 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-30 02:48:21,918 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:48:21,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1462570174, now seen corresponding path program 1 times [2023-08-30 02:48:21,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:48:21,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432364800] [2023-08-30 02:48:21,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:48:21,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:48:21,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:48:22,356 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-30 02:48:22,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:48:22,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432364800] [2023-08-30 02:48:22,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432364800] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:48:22,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:48:22,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:48:22,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574176320] [2023-08-30 02:48:22,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:48:22,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:48:22,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:48:22,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:48:22,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:48:22,377 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 275 [2023-08-30 02:48:22,378 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 61 transitions, 415 flow. Second operand has 6 states, 6 states have (on average 122.83333333333333) internal successors, (737), 6 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:22,378 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:48:22,378 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 275 [2023-08-30 02:48:22,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:48:24,768 INFO L130 PetriNetUnfolder]: 17205/25389 cut-off events. [2023-08-30 02:48:24,768 INFO L131 PetriNetUnfolder]: For 46478/47230 co-relation queries the response was YES. [2023-08-30 02:48:24,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85711 conditions, 25389 events. 17205/25389 cut-off events. For 46478/47230 co-relation queries the response was YES. Maximal size of possible extension queue 1076. Compared 165926 event pairs, 2418 based on Foata normal form. 561/25874 useless extension candidates. Maximal degree in co-relation 85696. Up to 12362 conditions per place. [2023-08-30 02:48:24,970 INFO L137 encePairwiseOnDemand]: 266/275 looper letters, 122 selfloop transitions, 39 changer transitions 11/186 dead transitions. [2023-08-30 02:48:24,970 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 186 transitions, 1412 flow [2023-08-30 02:48:24,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-30 02:48:24,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-30 02:48:24,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1311 transitions. [2023-08-30 02:48:24,974 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4767272727272727 [2023-08-30 02:48:24,975 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1311 transitions. [2023-08-30 02:48:24,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1311 transitions. [2023-08-30 02:48:24,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:48:24,976 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1311 transitions. [2023-08-30 02:48:24,979 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 131.1) internal successors, (1311), 10 states have internal predecessors, (1311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:24,983 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 275.0) internal successors, (3025), 11 states have internal predecessors, (3025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:24,984 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 275.0) internal successors, (3025), 11 states have internal predecessors, (3025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:24,984 INFO L175 Difference]: Start difference. First operand has 61 places, 61 transitions, 415 flow. Second operand 10 states and 1311 transitions. [2023-08-30 02:48:24,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 186 transitions, 1412 flow [2023-08-30 02:48:25,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 186 transitions, 1400 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:48:25,090 INFO L231 Difference]: Finished difference. Result has 77 places, 99 transitions, 775 flow [2023-08-30 02:48:25,091 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=775, PETRI_PLACES=77, PETRI_TRANSITIONS=99} [2023-08-30 02:48:25,091 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 24 predicate places. [2023-08-30 02:48:25,091 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 99 transitions, 775 flow [2023-08-30 02:48:25,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.83333333333333) internal successors, (737), 6 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:25,092 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:48:25,092 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:48:25,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 02:48:25,092 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-30 02:48:25,093 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:48:25,093 INFO L85 PathProgramCache]: Analyzing trace with hash -55102022, now seen corresponding path program 1 times [2023-08-30 02:48:25,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:48:25,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464184930] [2023-08-30 02:48:25,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:48:25,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:48:25,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:48:25,270 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-30 02:48:25,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:48:25,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464184930] [2023-08-30 02:48:25,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464184930] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:48:25,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:48:25,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:48:25,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534281918] [2023-08-30 02:48:25,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:48:25,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:48:25,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:48:25,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:48:25,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:48:25,276 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 275 [2023-08-30 02:48:25,276 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 99 transitions, 775 flow. Second operand has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:25,276 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:48:25,276 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 275 [2023-08-30 02:48:25,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:48:27,973 INFO L130 PetriNetUnfolder]: 21362/31540 cut-off events. [2023-08-30 02:48:27,973 INFO L131 PetriNetUnfolder]: For 88622/89859 co-relation queries the response was YES. [2023-08-30 02:48:28,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124322 conditions, 31540 events. 21362/31540 cut-off events. For 88622/89859 co-relation queries the response was YES. Maximal size of possible extension queue 1285. Compared 211228 event pairs, 6240 based on Foata normal form. 560/31769 useless extension candidates. Maximal degree in co-relation 124299. Up to 15713 conditions per place. [2023-08-30 02:48:28,369 INFO L137 encePairwiseOnDemand]: 272/275 looper letters, 126 selfloop transitions, 9 changer transitions 0/154 dead transitions. [2023-08-30 02:48:28,369 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 154 transitions, 1362 flow [2023-08-30 02:48:28,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:48:28,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:48:28,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 423 transitions. [2023-08-30 02:48:28,371 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5127272727272727 [2023-08-30 02:48:28,371 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 423 transitions. [2023-08-30 02:48:28,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 423 transitions. [2023-08-30 02:48:28,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:48:28,372 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 423 transitions. [2023-08-30 02:48:28,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:28,374 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:28,375 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:28,375 INFO L175 Difference]: Start difference. First operand has 77 places, 99 transitions, 775 flow. Second operand 3 states and 423 transitions. [2023-08-30 02:48:28,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 154 transitions, 1362 flow [2023-08-30 02:48:28,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 154 transitions, 1358 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-30 02:48:28,868 INFO L231 Difference]: Finished difference. Result has 78 places, 99 transitions, 802 flow [2023-08-30 02:48:28,868 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=773, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=802, PETRI_PLACES=78, PETRI_TRANSITIONS=99} [2023-08-30 02:48:28,869 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 25 predicate places. [2023-08-30 02:48:28,869 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 99 transitions, 802 flow [2023-08-30 02:48:28,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:28,869 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:48:28,870 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-30 02:48:28,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 02:48:28,870 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-30 02:48:28,870 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:48:28,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1402330358, now seen corresponding path program 1 times [2023-08-30 02:48:28,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:48:28,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142588119] [2023-08-30 02:48:28,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:48:28,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:48:28,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:48:29,088 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-30 02:48:29,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:48:29,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142588119] [2023-08-30 02:48:29,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142588119] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:48:29,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:48:29,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:48:29,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468765037] [2023-08-30 02:48:29,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:48:29,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:48:29,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:48:29,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:48:29,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:48:29,102 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 275 [2023-08-30 02:48:29,103 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 99 transitions, 802 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-30 02:48:29,103 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:48:29,103 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 275 [2023-08-30 02:48:29,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:48:31,061 INFO L130 PetriNetUnfolder]: 11786/18325 cut-off events. [2023-08-30 02:48:31,062 INFO L131 PetriNetUnfolder]: For 45771/46988 co-relation queries the response was YES. [2023-08-30 02:48:31,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69988 conditions, 18325 events. 11786/18325 cut-off events. For 45771/46988 co-relation queries the response was YES. Maximal size of possible extension queue 814. Compared 128209 event pairs, 1011 based on Foata normal form. 1652/19749 useless extension candidates. Maximal degree in co-relation 69964. Up to 7020 conditions per place. [2023-08-30 02:48:31,257 INFO L137 encePairwiseOnDemand]: 268/275 looper letters, 205 selfloop transitions, 15 changer transitions 0/244 dead transitions. [2023-08-30 02:48:31,257 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 244 transitions, 2221 flow [2023-08-30 02:48:31,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:48:31,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:48:31,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 934 transitions. [2023-08-30 02:48:31,260 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4851948051948052 [2023-08-30 02:48:31,260 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 934 transitions. [2023-08-30 02:48:31,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 934 transitions. [2023-08-30 02:48:31,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:48:31,261 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 934 transitions. [2023-08-30 02:48:31,263 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 133.42857142857142) internal successors, (934), 7 states have internal predecessors, (934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:31,265 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 275.0) internal successors, (2200), 8 states have internal predecessors, (2200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:31,266 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 275.0) internal successors, (2200), 8 states have internal predecessors, (2200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:31,266 INFO L175 Difference]: Start difference. First operand has 78 places, 99 transitions, 802 flow. Second operand 7 states and 934 transitions. [2023-08-30 02:48:31,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 244 transitions, 2221 flow [2023-08-30 02:48:31,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 244 transitions, 2185 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-30 02:48:31,350 INFO L231 Difference]: Finished difference. Result has 86 places, 106 transitions, 893 flow [2023-08-30 02:48:31,351 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=771, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=893, PETRI_PLACES=86, PETRI_TRANSITIONS=106} [2023-08-30 02:48:31,351 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 33 predicate places. [2023-08-30 02:48:31,351 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 106 transitions, 893 flow [2023-08-30 02:48:31,352 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-30 02:48:31,352 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:48:31,352 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-30 02:48:31,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 02:48:31,352 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-30 02:48:31,353 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:48:31,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1373905164, now seen corresponding path program 1 times [2023-08-30 02:48:31,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:48:31,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345859216] [2023-08-30 02:48:31,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:48:31,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:48:31,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:48:31,664 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-30 02:48:31,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:48:31,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345859216] [2023-08-30 02:48:31,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345859216] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:48:31,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:48:31,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:48:31,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949406445] [2023-08-30 02:48:31,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:48:31,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:48:31,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:48:31,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:48:31,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:48:31,680 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 275 [2023-08-30 02:48:31,681 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 106 transitions, 893 flow. Second operand has 6 states, 6 states have (on average 122.0) internal successors, (732), 6 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:31,681 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:48:31,681 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 275 [2023-08-30 02:48:31,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:48:33,628 INFO L130 PetriNetUnfolder]: 9481/14718 cut-off events. [2023-08-30 02:48:33,628 INFO L131 PetriNetUnfolder]: For 45106/46031 co-relation queries the response was YES. [2023-08-30 02:48:33,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64037 conditions, 14718 events. 9481/14718 cut-off events. For 45106/46031 co-relation queries the response was YES. Maximal size of possible extension queue 805. Compared 101193 event pairs, 490 based on Foata normal form. 742/15252 useless extension candidates. Maximal degree in co-relation 64010. Up to 5337 conditions per place. [2023-08-30 02:48:33,778 INFO L137 encePairwiseOnDemand]: 268/275 looper letters, 218 selfloop transitions, 24 changer transitions 17/283 dead transitions. [2023-08-30 02:48:33,779 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 283 transitions, 2622 flow [2023-08-30 02:48:33,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 02:48:33,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 02:48:33,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1201 transitions. [2023-08-30 02:48:33,783 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48525252525252527 [2023-08-30 02:48:33,783 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1201 transitions. [2023-08-30 02:48:33,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1201 transitions. [2023-08-30 02:48:33,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:48:33,784 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1201 transitions. [2023-08-30 02:48:33,787 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 133.44444444444446) internal successors, (1201), 9 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:33,790 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 275.0) internal successors, (2750), 10 states have internal predecessors, (2750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:33,791 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 275.0) internal successors, (2750), 10 states have internal predecessors, (2750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:33,791 INFO L175 Difference]: Start difference. First operand has 86 places, 106 transitions, 893 flow. Second operand 9 states and 1201 transitions. [2023-08-30 02:48:33,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 283 transitions, 2622 flow [2023-08-30 02:48:34,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 283 transitions, 2515 flow, removed 18 selfloop flow, removed 3 redundant places. [2023-08-30 02:48:34,960 INFO L231 Difference]: Finished difference. Result has 94 places, 113 transitions, 970 flow [2023-08-30 02:48:34,960 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=800, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=970, PETRI_PLACES=94, PETRI_TRANSITIONS=113} [2023-08-30 02:48:34,961 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 41 predicate places. [2023-08-30 02:48:34,961 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 113 transitions, 970 flow [2023-08-30 02:48:34,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.0) internal successors, (732), 6 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:34,961 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:48:34,961 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-30 02:48:34,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 02:48:34,961 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-30 02:48:34,962 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:48:34,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1144739909, now seen corresponding path program 1 times [2023-08-30 02:48:34,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:48:34,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539190143] [2023-08-30 02:48:34,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:48:34,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:48:35,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:48:35,853 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-30 02:48:35,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:48:35,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539190143] [2023-08-30 02:48:35,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539190143] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:48:35,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:48:35,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:48:35,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068324002] [2023-08-30 02:48:35,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:48:35,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:48:35,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:48:35,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:48:35,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:48:35,889 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 275 [2023-08-30 02:48:35,890 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 113 transitions, 970 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-30 02:48:35,891 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:48:35,891 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 275 [2023-08-30 02:48:35,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:48:38,272 INFO L130 PetriNetUnfolder]: 13582/21405 cut-off events. [2023-08-30 02:48:38,272 INFO L131 PetriNetUnfolder]: For 74208/75532 co-relation queries the response was YES. [2023-08-30 02:48:38,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94445 conditions, 21405 events. 13582/21405 cut-off events. For 74208/75532 co-relation queries the response was YES. Maximal size of possible extension queue 1120. Compared 155504 event pairs, 2194 based on Foata normal form. 574/21542 useless extension candidates. Maximal degree in co-relation 94415. Up to 13446 conditions per place. [2023-08-30 02:48:38,516 INFO L137 encePairwiseOnDemand]: 267/275 looper letters, 197 selfloop transitions, 35 changer transitions 12/268 dead transitions. [2023-08-30 02:48:38,516 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 268 transitions, 2664 flow [2023-08-30 02:48:38,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:48:38,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:48:38,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 958 transitions. [2023-08-30 02:48:38,518 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49766233766233764 [2023-08-30 02:48:38,518 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 958 transitions. [2023-08-30 02:48:38,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 958 transitions. [2023-08-30 02:48:38,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:48:38,519 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 958 transitions. [2023-08-30 02:48:38,521 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 136.85714285714286) internal successors, (958), 7 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:38,523 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 275.0) internal successors, (2200), 8 states have internal predecessors, (2200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:38,524 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 275.0) internal successors, (2200), 8 states have internal predecessors, (2200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:38,524 INFO L175 Difference]: Start difference. First operand has 94 places, 113 transitions, 970 flow. Second operand 7 states and 958 transitions. [2023-08-30 02:48:38,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 268 transitions, 2664 flow [2023-08-30 02:48:41,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 268 transitions, 2339 flow, removed 122 selfloop flow, removed 3 redundant places. [2023-08-30 02:48:41,014 INFO L231 Difference]: Finished difference. Result has 101 places, 130 transitions, 1123 flow [2023-08-30 02:48:41,014 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1123, PETRI_PLACES=101, PETRI_TRANSITIONS=130} [2023-08-30 02:48:41,014 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 48 predicate places. [2023-08-30 02:48:41,014 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 130 transitions, 1123 flow [2023-08-30 02:48:41,015 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-30 02:48:41,015 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:48:41,015 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-30 02:48:41,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 02:48:41,015 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-30 02:48:41,016 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:48:41,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1485186679, now seen corresponding path program 2 times [2023-08-30 02:48:41,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:48:41,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968007840] [2023-08-30 02:48:41,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:48:41,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:48:41,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:48:41,376 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-30 02:48:41,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:48:41,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968007840] [2023-08-30 02:48:41,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968007840] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:48:41,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:48:41,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 02:48:41,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196387881] [2023-08-30 02:48:41,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:48:41,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:48:41,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:48:41,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:48:41,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:48:41,392 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 275 [2023-08-30 02:48:41,393 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 130 transitions, 1123 flow. Second operand has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:41,393 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:48:41,393 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 275 [2023-08-30 02:48:41,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:48:43,697 INFO L130 PetriNetUnfolder]: 13179/20398 cut-off events. [2023-08-30 02:48:43,697 INFO L131 PetriNetUnfolder]: For 65639/66861 co-relation queries the response was YES. [2023-08-30 02:48:43,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87623 conditions, 20398 events. 13179/20398 cut-off events. For 65639/66861 co-relation queries the response was YES. Maximal size of possible extension queue 1140. Compared 148367 event pairs, 653 based on Foata normal form. 512/20583 useless extension candidates. Maximal degree in co-relation 87588. Up to 3889 conditions per place. [2023-08-30 02:48:43,915 INFO L137 encePairwiseOnDemand]: 268/275 looper letters, 283 selfloop transitions, 29 changer transitions 32/367 dead transitions. [2023-08-30 02:48:43,915 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 367 transitions, 3711 flow [2023-08-30 02:48:43,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 02:48:43,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 02:48:43,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1440 transitions. [2023-08-30 02:48:43,918 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47603305785123967 [2023-08-30 02:48:43,918 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1440 transitions. [2023-08-30 02:48:43,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1440 transitions. [2023-08-30 02:48:43,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:48:43,919 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1440 transitions. [2023-08-30 02:48:43,922 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 130.9090909090909) internal successors, (1440), 11 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:43,926 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 275.0) internal successors, (3300), 12 states have internal predecessors, (3300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:43,926 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 275.0) internal successors, (3300), 12 states have internal predecessors, (3300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:43,927 INFO L175 Difference]: Start difference. First operand has 101 places, 130 transitions, 1123 flow. Second operand 11 states and 1440 transitions. [2023-08-30 02:48:43,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 367 transitions, 3711 flow [2023-08-30 02:48:45,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 367 transitions, 3625 flow, removed 18 selfloop flow, removed 4 redundant places. [2023-08-30 02:48:45,585 INFO L231 Difference]: Finished difference. Result has 110 places, 126 transitions, 1122 flow [2023-08-30 02:48:45,586 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=1036, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1122, PETRI_PLACES=110, PETRI_TRANSITIONS=126} [2023-08-30 02:48:45,586 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 57 predicate places. [2023-08-30 02:48:45,586 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 126 transitions, 1122 flow [2023-08-30 02:48:45,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:45,587 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:48:45,587 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-30 02:48:45,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 02:48:45,588 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-30 02:48:45,588 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:48:45,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1908061766, now seen corresponding path program 1 times [2023-08-30 02:48:45,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:48:45,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013681685] [2023-08-30 02:48:45,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:48:45,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:48:45,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:48:46,655 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-30 02:48:46,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:48:46,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013681685] [2023-08-30 02:48:46,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013681685] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:48:46,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:48:46,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 02:48:46,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137023840] [2023-08-30 02:48:46,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:48:46,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 02:48:46,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:48:46,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 02:48:46,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-30 02:48:46,741 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 275 [2023-08-30 02:48:46,742 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 126 transitions, 1122 flow. Second operand has 8 states, 8 states have (on average 126.0) internal successors, (1008), 8 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:46,742 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:48:46,742 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 275 [2023-08-30 02:48:46,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:48:49,653 INFO L130 PetriNetUnfolder]: 17837/28607 cut-off events. [2023-08-30 02:48:49,653 INFO L131 PetriNetUnfolder]: For 100878/102424 co-relation queries the response was YES. [2023-08-30 02:48:49,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129568 conditions, 28607 events. 17837/28607 cut-off events. For 100878/102424 co-relation queries the response was YES. Maximal size of possible extension queue 1566. Compared 226173 event pairs, 3207 based on Foata normal form. 732/28997 useless extension candidates. Maximal degree in co-relation 129532. Up to 7743 conditions per place. [2023-08-30 02:48:50,040 INFO L137 encePairwiseOnDemand]: 268/275 looper letters, 239 selfloop transitions, 29 changer transitions 9/300 dead transitions. [2023-08-30 02:48:50,040 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 300 transitions, 3075 flow [2023-08-30 02:48:50,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:48:50,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:48:50,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 951 transitions. [2023-08-30 02:48:50,042 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49402597402597404 [2023-08-30 02:48:50,043 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 951 transitions. [2023-08-30 02:48:50,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 951 transitions. [2023-08-30 02:48:50,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:48:50,043 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 951 transitions. [2023-08-30 02:48:50,045 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 135.85714285714286) internal successors, (951), 7 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:50,047 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 275.0) internal successors, (2200), 8 states have internal predecessors, (2200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:50,048 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 275.0) internal successors, (2200), 8 states have internal predecessors, (2200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:50,048 INFO L175 Difference]: Start difference. First operand has 110 places, 126 transitions, 1122 flow. Second operand 7 states and 951 transitions. [2023-08-30 02:48:50,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 300 transitions, 3075 flow [2023-08-30 02:48:52,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 300 transitions, 2693 flow, removed 81 selfloop flow, removed 9 redundant places. [2023-08-30 02:48:52,817 INFO L231 Difference]: Finished difference. Result has 109 places, 136 transitions, 1233 flow [2023-08-30 02:48:52,817 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=1020, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1233, PETRI_PLACES=109, PETRI_TRANSITIONS=136} [2023-08-30 02:48:52,817 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 56 predicate places. [2023-08-30 02:48:52,818 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 136 transitions, 1233 flow [2023-08-30 02:48:52,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 126.0) internal successors, (1008), 8 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:52,818 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:48:52,818 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-30 02:48:52,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 02:48:52,819 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-30 02:48:52,819 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:48:52,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1921523122, now seen corresponding path program 2 times [2023-08-30 02:48:52,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:48:52,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039096670] [2023-08-30 02:48:52,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:48:52,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:48:52,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:48:53,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:48:53,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:48:53,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039096670] [2023-08-30 02:48:53,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039096670] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:48:53,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:48:53,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:48:53,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232369883] [2023-08-30 02:48:53,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:48:53,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:48:53,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:48:53,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:48:53,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:48:53,091 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 275 [2023-08-30 02:48:53,092 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 136 transitions, 1233 flow. Second operand has 4 states, 4 states have (on average 130.25) internal successors, (521), 4 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:53,092 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:48:53,092 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 275 [2023-08-30 02:48:53,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:48:58,824 INFO L130 PetriNetUnfolder]: 29581/47493 cut-off events. [2023-08-30 02:48:58,824 INFO L131 PetriNetUnfolder]: For 174801/176585 co-relation queries the response was YES. [2023-08-30 02:48:59,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 214305 conditions, 47493 events. 29581/47493 cut-off events. For 174801/176585 co-relation queries the response was YES. Maximal size of possible extension queue 2604. Compared 399845 event pairs, 8483 based on Foata normal form. 673/47663 useless extension candidates. Maximal degree in co-relation 214269. Up to 22343 conditions per place. [2023-08-30 02:48:59,303 INFO L137 encePairwiseOnDemand]: 272/275 looper letters, 258 selfloop transitions, 5 changer transitions 4/286 dead transitions. [2023-08-30 02:48:59,303 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 286 transitions, 3012 flow [2023-08-30 02:48:59,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:48:59,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:48:59,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 559 transitions. [2023-08-30 02:48:59,305 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5081818181818182 [2023-08-30 02:48:59,305 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 559 transitions. [2023-08-30 02:48:59,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 559 transitions. [2023-08-30 02:48:59,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:48:59,305 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 559 transitions. [2023-08-30 02:48:59,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.75) internal successors, (559), 4 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:59,308 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 275.0) internal successors, (1375), 5 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:59,308 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 275.0) internal successors, (1375), 5 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:48:59,308 INFO L175 Difference]: Start difference. First operand has 109 places, 136 transitions, 1233 flow. Second operand 4 states and 559 transitions. [2023-08-30 02:48:59,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 286 transitions, 3012 flow [2023-08-30 02:49:05,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 286 transitions, 2987 flow, removed 8 selfloop flow, removed 1 redundant places. [2023-08-30 02:49:05,059 INFO L231 Difference]: Finished difference. Result has 113 places, 138 transitions, 1257 flow [2023-08-30 02:49:05,060 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=1220, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1257, PETRI_PLACES=113, PETRI_TRANSITIONS=138} [2023-08-30 02:49:05,060 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 60 predicate places. [2023-08-30 02:49:05,060 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 138 transitions, 1257 flow [2023-08-30 02:49:05,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.25) internal successors, (521), 4 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:49:05,061 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:49:05,061 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-30 02:49:05,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-30 02:49:05,062 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-30 02:49:05,062 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:49:05,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1917907936, now seen corresponding path program 3 times [2023-08-30 02:49:05,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:49:05,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824998430] [2023-08-30 02:49:05,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:49:05,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:49:05,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:49:06,058 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-30 02:49:06,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:49:06,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824998430] [2023-08-30 02:49:06,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824998430] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:49:06,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:49:06,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 02:49:06,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481503164] [2023-08-30 02:49:06,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:49:06,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 02:49:06,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:49:06,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 02:49:06,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-08-30 02:49:06,115 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 275 [2023-08-30 02:49:06,129 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 138 transitions, 1257 flow. Second operand has 8 states, 8 states have (on average 126.0) internal successors, (1008), 8 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:49:06,129 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:49:06,129 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 275 [2023-08-30 02:49:06,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:49:13,259 INFO L130 PetriNetUnfolder]: 34750/57444 cut-off events. [2023-08-30 02:49:13,259 INFO L131 PetriNetUnfolder]: For 196798/200036 co-relation queries the response was YES. [2023-08-30 02:49:13,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 255961 conditions, 57444 events. 34750/57444 cut-off events. For 196798/200036 co-relation queries the response was YES. Maximal size of possible extension queue 3409. Compared 523148 event pairs, 4172 based on Foata normal form. 1658/58470 useless extension candidates. Maximal degree in co-relation 255922. Up to 15822 conditions per place. [2023-08-30 02:49:13,870 INFO L137 encePairwiseOnDemand]: 267/275 looper letters, 294 selfloop transitions, 58 changer transitions 15/392 dead transitions. [2023-08-30 02:49:13,871 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 392 transitions, 3768 flow [2023-08-30 02:49:13,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 02:49:13,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 02:49:13,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1099 transitions. [2023-08-30 02:49:13,873 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49954545454545457 [2023-08-30 02:49:13,874 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1099 transitions. [2023-08-30 02:49:13,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1099 transitions. [2023-08-30 02:49:13,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:49:13,874 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1099 transitions. [2023-08-30 02:49:13,877 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 137.375) internal successors, (1099), 8 states have internal predecessors, (1099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:49:13,879 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 275.0) internal successors, (2475), 9 states have internal predecessors, (2475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:49:13,880 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 275.0) internal successors, (2475), 9 states have internal predecessors, (2475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:49:13,880 INFO L175 Difference]: Start difference. First operand has 113 places, 138 transitions, 1257 flow. Second operand 8 states and 1099 transitions. [2023-08-30 02:49:13,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 392 transitions, 3768 flow [2023-08-30 02:49:25,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 392 transitions, 3763 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:49:25,486 INFO L231 Difference]: Finished difference. Result has 124 places, 165 transitions, 1807 flow [2023-08-30 02:49:25,486 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=1256, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1807, PETRI_PLACES=124, PETRI_TRANSITIONS=165} [2023-08-30 02:49:25,487 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 71 predicate places. [2023-08-30 02:49:25,487 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 165 transitions, 1807 flow [2023-08-30 02:49:25,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 126.0) internal successors, (1008), 8 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:49:25,487 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:49:25,487 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-30 02:49:25,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-30 02:49:25,488 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-30 02:49:25,488 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:49:25,488 INFO L85 PathProgramCache]: Analyzing trace with hash 48006762, now seen corresponding path program 4 times [2023-08-30 02:49:25,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:49:25,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571272303] [2023-08-30 02:49:25,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:49:25,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:49:25,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:49:25,528 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 02:49:25,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:49:25,612 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 02:49:25,612 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 02:49:25,613 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-30 02:49:25,615 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-30 02:49:25,616 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-30 02:49:25,617 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-30 02:49:25,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-30 02:49:25,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-30 02:49:25,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-30 02:49:25,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-30 02:49:25,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-30 02:49:25,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-30 02:49:25,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-30 02:49:25,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-30 02:49:25,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-30 02:49:25,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-30 02:49:25,621 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-30 02:49:25,621 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-30 02:49:25,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-30 02:49:25,621 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:49:25,626 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 02:49:25,627 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 02:49:25,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 02:49:25 BasicIcfg [2023-08-30 02:49:25,726 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 02:49:25,726 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 02:49:25,726 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 02:49:25,727 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 02:49:25,727 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:47:59" (3/4) ... [2023-08-30 02:49:25,729 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-30 02:49:25,729 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 02:49:25,730 INFO L158 Benchmark]: Toolchain (without parser) took 87540.86ms. Allocated memory was 90.2MB in the beginning and 9.8GB in the end (delta: 9.7GB). Free memory was 63.4MB in the beginning and 7.9GB in the end (delta: -7.9GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. [2023-08-30 02:49:25,730 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 60.8MB. Free memory is still 38.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:49:25,730 INFO L158 Benchmark]: CACSL2BoogieTranslator took 648.17ms. Allocated memory is still 90.2MB. Free memory was 63.1MB in the beginning and 61.1MB in the end (delta: 2.1MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. [2023-08-30 02:49:25,730 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.69ms. Allocated memory is still 90.2MB. Free memory was 61.1MB in the beginning and 58.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:49:25,731 INFO L158 Benchmark]: Boogie Preprocessor took 61.12ms. Allocated memory is still 90.2MB. Free memory was 58.5MB in the beginning and 56.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:49:25,731 INFO L158 Benchmark]: RCFGBuilder took 821.05ms. Allocated memory is still 90.2MB. Free memory was 56.3MB in the beginning and 52.1MB in the end (delta: 4.3MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. [2023-08-30 02:49:25,731 INFO L158 Benchmark]: TraceAbstraction took 85920.46ms. Allocated memory was 90.2MB in the beginning and 9.8GB in the end (delta: 9.7GB). Free memory was 51.5MB in the beginning and 7.9GB in the end (delta: -7.9GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. [2023-08-30 02:49:25,731 INFO L158 Benchmark]: Witness Printer took 2.92ms. Allocated memory is still 9.8GB. Free memory is still 7.9GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:49:25,733 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.26ms. Allocated memory is still 60.8MB. Free memory is still 38.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 648.17ms. Allocated memory is still 90.2MB. Free memory was 63.1MB in the beginning and 61.1MB in the end (delta: 2.1MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.69ms. Allocated memory is still 90.2MB. Free memory was 61.1MB in the beginning and 58.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.12ms. Allocated memory is still 90.2MB. Free memory was 58.5MB in the beginning and 56.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 821.05ms. Allocated memory is still 90.2MB. Free memory was 56.3MB in the beginning and 52.1MB in the end (delta: 4.3MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. * TraceAbstraction took 85920.46ms. Allocated memory was 90.2MB in the beginning and 9.8GB in the end (delta: 9.7GB). Free memory was 51.5MB in the beginning and 7.9GB in the end (delta: -7.9GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. * Witness Printer took 2.92ms. Allocated memory is still 9.8GB. Free memory is still 7.9GB. 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.4s, 150 PlacesBefore, 53 PlacesAfterwards, 139 TransitionsBefore, 41 TransitionsAfterwards, 3524 CoEnabledTransitionPairs, 7 FixpointIterations, 50 TrivialSequentialCompositions, 73 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 132 TotalNumberOfCompositions, 10501 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4870, independent: 4621, independent conditional: 0, independent unconditional: 4621, dependent: 249, dependent conditional: 0, dependent unconditional: 249, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1881, independent: 1830, independent conditional: 0, independent unconditional: 1830, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4870, independent: 2791, independent conditional: 0, independent unconditional: 2791, dependent: 198, dependent conditional: 0, dependent unconditional: 198, unknown: 1881, unknown conditional: 0, unknown unconditional: 1881] , Statistics on independence cache: Total cache size (in pairs): 217, Positive cache size: 196, Positive conditional cache size: 0, Positive unconditional cache size: 196, 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_p0_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; [L721] 0 _Bool a$flush_delayed; [L722] 0 int a$mem_tmp; [L723] 0 _Bool a$r_buff0_thd0; [L724] 0 _Bool a$r_buff0_thd1; [L725] 0 _Bool a$r_buff0_thd2; [L726] 0 _Bool a$r_buff0_thd3; [L727] 0 _Bool a$r_buff0_thd4; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$r_buff1_thd4; [L733] 0 _Bool a$read_delayed; [L734] 0 int *a$read_delayed_var; [L735] 0 int a$w_buff0; [L736] 0 _Bool a$w_buff0_used; [L737] 0 int a$w_buff1; [L738] 0 _Bool a$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L866] 0 pthread_t t521; [L867] FCALL, FORK 0 pthread_create(&t521, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t521, ((void *)0), P0, ((void *)0))=-4, t521={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L868] 0 pthread_t t522; [L869] FCALL, FORK 0 pthread_create(&t522, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t522, ((void *)0), P1, ((void *)0))=-3, t521={5:0}, t522={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L870] 0 pthread_t t523; [L871] FCALL, FORK 0 pthread_create(&t523, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t523, ((void *)0), P2, ((void *)0))=-2, t521={5:0}, t522={6:0}, t523={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L872] 0 pthread_t t524; [L873] FCALL, FORK 0 pthread_create(&t524, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t524, ((void *)0), P3, ((void *)0))=-1, t521={5:0}, t522={6:0}, t523={7:0}, t524={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 a$w_buff1 = a$w_buff0 [L753] 1 a$w_buff0 = 1 [L754] 1 a$w_buff1_used = a$w_buff0_used [L755] 1 a$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L757] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L758] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L759] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L760] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L761] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L782] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L785] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L802] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L805] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L788] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L789] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L790] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L791] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L792] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L808] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L809] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L810] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L811] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L812] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L822] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L825] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L828] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L829] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L830] 4 a$flush_delayed = weak$$choice2 [L831] 4 a$mem_tmp = a [L832] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L833] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L834] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L835] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L836] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L838] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 __unbuffered_p3_EBX = a [L840] 4 a = a$flush_delayed ? a$mem_tmp : a [L841] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=2, z=1] [L768] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L770] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L771] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L772] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=2, z=1] [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L844] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L845] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L846] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L847] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L848] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=2, z=1] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L851] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L853] 4 return 0; [L875] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L877] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L877] RET 0 assume_abort_if_not(main$tmp_guard0) [L879] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L880] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L881] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L882] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L883] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t521={5:0}, t522={6:0}, t523={7:0}, t524={3:0}, weak$$choice2=1, x=1, y=2, z=1] [L886] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L888] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y=2, 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: 864]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 867]: 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: 873]: 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: 869]: 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: 871]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 180 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 85.7s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 74.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1117 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 937 mSDsluCounter, 415 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 357 mSDsCounter, 160 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3279 IncrementalHoareTripleChecker+Invalid, 3439 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 160 mSolverCounterUnsat, 58 mSDtfsCounter, 3279 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1807occurred in iteration=16, InterpolantAutomatonStates: 94, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 300 NumberOfCodeBlocks, 300 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 256 ConstructedInterpolants, 0 QuantifiedInterpolants, 2337 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-30 02:49:25,760 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/mix020.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 035ec41aa2053cde8ee24830f9eb7cf444ea0c142ead33ef0c1fe95c3a7de39e --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 02:49:28,347 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 02:49:28,349 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 02:49:28,392 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 02:49:28,394 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 02:49:28,397 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 02:49:28,399 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 02:49:28,401 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 02:49:28,403 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 02:49:28,407 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 02:49:28,408 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 02:49:28,410 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 02:49:28,411 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 02:49:28,412 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 02:49:28,413 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 02:49:28,418 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 02:49:28,419 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 02:49:28,420 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 02:49:28,422 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 02:49:28,426 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 02:49:28,437 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 02:49:28,438 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 02:49:28,439 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 02:49:28,442 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 02:49:28,448 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 02:49:28,449 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 02:49:28,449 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 02:49:28,451 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 02:49:28,451 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 02:49:28,452 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 02:49:28,452 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 02:49:28,457 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 02:49:28,459 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 02:49:28,460 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 02:49:28,461 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 02:49:28,461 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 02:49:28,462 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 02:49:28,462 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 02:49:28,463 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 02:49:28,463 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 02:49:28,464 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 02:49:28,465 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-30 02:49:28,497 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 02:49:28,498 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 02:49:28,499 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 02:49:28,499 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 02:49:28,500 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 02:49:28,500 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 02:49:28,501 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 02:49:28,501 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 02:49:28,501 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 02:49:28,501 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 02:49:28,502 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 02:49:28,502 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 02:49:28,503 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 02:49:28,503 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 02:49:28,503 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 02:49:28,503 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 02:49:28,504 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 02:49:28,504 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 02:49:28,504 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 02:49:28,504 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 02:49:28,504 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-30 02:49:28,505 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-30 02:49:28,505 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 02:49:28,505 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 02:49:28,505 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 02:49:28,506 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 02:49:28,506 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 02:49:28,506 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:49:28,506 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 02:49:28,507 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 02:49:28,507 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-30 02:49:28,507 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-30 02:49:28,507 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 02:49:28,508 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 02:49:28,508 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 02:49:28,508 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-30 02:49:28,508 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 02:49:28,509 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 -> 035ec41aa2053cde8ee24830f9eb7cf444ea0c142ead33ef0c1fe95c3a7de39e 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 -> TOGETHER [2023-08-30 02:49:28,855 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 02:49:28,882 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 02:49:28,884 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 02:49:28,885 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 02:49:28,889 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 02:49:28,890 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix020.oepc.i [2023-08-30 02:49:29,937 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 02:49:30,174 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 02:49:30,175 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix020.oepc.i [2023-08-30 02:49:30,205 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84dad6c9c/ad3ea85c7ae54dcbbad68e7cc695e0c0/FLAG7dff2f44e [2023-08-30 02:49:30,220 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84dad6c9c/ad3ea85c7ae54dcbbad68e7cc695e0c0 [2023-08-30 02:49:30,222 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 02:49:30,223 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 02:49:30,224 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 02:49:30,224 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 02:49:30,227 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 02:49:30,227 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:49:30" (1/1) ... [2023-08-30 02:49:30,228 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64a2749e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:49:30, skipping insertion in model container [2023-08-30 02:49:30,228 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:49:30" (1/1) ... [2023-08-30 02:49:30,234 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 02:49:30,272 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 02:49:30,400 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/mix020.oepc.i[945,958] [2023-08-30 02:49:30,580 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:49:30,600 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 02:49:30,615 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/mix020.oepc.i[945,958] [2023-08-30 02:49:30,694 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:49:30,735 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:49:30,735 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:49:30,741 INFO L208 MainTranslator]: Completed translation [2023-08-30 02:49:30,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:49:30 WrapperNode [2023-08-30 02:49:30,741 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 02:49:30,742 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 02:49:30,743 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 02:49:30,743 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 02:49:30,748 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:49:30" (1/1) ... [2023-08-30 02:49:30,769 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:49:30" (1/1) ... [2023-08-30 02:49:30,789 INFO L138 Inliner]: procedures = 180, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2023-08-30 02:49:30,790 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 02:49:30,791 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 02:49:30,791 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 02:49:30,791 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 02:49:30,798 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:49:30" (1/1) ... [2023-08-30 02:49:30,799 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:49:30" (1/1) ... [2023-08-30 02:49:30,812 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:49:30" (1/1) ... [2023-08-30 02:49:30,815 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:49:30" (1/1) ... [2023-08-30 02:49:30,825 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:49:30" (1/1) ... [2023-08-30 02:49:30,839 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:49:30" (1/1) ... [2023-08-30 02:49:30,842 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:49:30" (1/1) ... [2023-08-30 02:49:30,850 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:49:30" (1/1) ... [2023-08-30 02:49:30,853 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 02:49:30,858 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 02:49:30,859 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 02:49:30,859 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 02:49:30,860 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:49:30" (1/1) ... [2023-08-30 02:49:30,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:49:30,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:49:30,894 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-30 02:49:30,910 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-30 02:49:30,933 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 02:49:30,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 02:49:30,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 02:49:30,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 02:49:30,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-30 02:49:30,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-30 02:49:30,934 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 02:49:30,934 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 02:49:30,934 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 02:49:30,934 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 02:49:30,934 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 02:49:30,934 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 02:49:30,934 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-30 02:49:30,935 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-30 02:49:30,935 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 02:49:30,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 02:49:30,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 02:49:30,936 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 02:49:31,138 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 02:49:31,139 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 02:49:31,536 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 02:49:31,641 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 02:49:31,641 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 02:49:31,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:49:31 BoogieIcfgContainer [2023-08-30 02:49:31,644 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 02:49:31,646 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 02:49:31,646 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 02:49:31,649 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 02:49:31,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 02:49:30" (1/3) ... [2023-08-30 02:49:31,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f88cb7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:49:31, skipping insertion in model container [2023-08-30 02:49:31,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:49:30" (2/3) ... [2023-08-30 02:49:31,650 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f88cb7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:49:31, skipping insertion in model container [2023-08-30 02:49:31,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:49:31" (3/3) ... [2023-08-30 02:49:31,651 INFO L112 eAbstractionObserver]: Analyzing ICFG mix020.oepc.i [2023-08-30 02:49:31,669 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 02:49:31,670 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-30 02:49:31,670 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 02:49:31,740 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 02:49:31,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 144 transitions, 308 flow [2023-08-30 02:49:31,829 INFO L130 PetriNetUnfolder]: 2/140 cut-off events. [2023-08-30 02:49:31,830 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:49:31,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 140 events. 2/140 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 103 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2023-08-30 02:49:31,836 INFO L82 GeneralOperation]: Start removeDead. Operand has 155 places, 144 transitions, 308 flow [2023-08-30 02:49:31,840 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 151 places, 140 transitions, 292 flow [2023-08-30 02:49:31,843 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 02:49:31,852 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 140 transitions, 292 flow [2023-08-30 02:49:31,854 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 151 places, 140 transitions, 292 flow [2023-08-30 02:49:31,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 140 transitions, 292 flow [2023-08-30 02:49:31,890 INFO L130 PetriNetUnfolder]: 2/140 cut-off events. [2023-08-30 02:49:31,890 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:49:31,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 140 events. 2/140 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 104 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2023-08-30 02:49:31,893 INFO L119 LiptonReduction]: Number of co-enabled transitions 3524 [2023-08-30 02:49:38,240 INFO L134 LiptonReduction]: Checked pairs total: 10243 [2023-08-30 02:49:38,241 INFO L136 LiptonReduction]: Total number of compositions: 133 [2023-08-30 02:49:38,253 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 02:49:38,259 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;@6124ccb0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 02:49:38,259 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-30 02:49:38,262 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-30 02:49:38,262 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:49:38,262 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:49:38,263 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 02:49:38,263 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-30 02:49:38,268 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:49:38,268 INFO L85 PathProgramCache]: Analyzing trace with hash 608, now seen corresponding path program 1 times [2023-08-30 02:49:38,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:49:38,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [586189279] [2023-08-30 02:49:38,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:49:38,282 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-30 02:49:38,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:49:38,285 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-30 02:49:38,301 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-30 02:49:38,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:49:38,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-30 02:49:38,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:49:38,364 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-30 02:49:38,365 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:49:38,365 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:49:38,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [586189279] [2023-08-30 02:49:38,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [586189279] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:49:38,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:49:38,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 02:49:38,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106865660] [2023-08-30 02:49:38,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:49:38,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 02:49:38,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:49:38,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 02:49:38,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 02:49:38,399 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 277 [2023-08-30 02:49:38,402 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 90 flow. Second operand has 2 states, 2 states have (on average 129.5) internal successors, (259), 2 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:49:38,402 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:49:38,402 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 277 [2023-08-30 02:49:38,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:49:39,746 INFO L130 PetriNetUnfolder]: 7479/10174 cut-off events. [2023-08-30 02:49:39,746 INFO L131 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2023-08-30 02:49:39,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20482 conditions, 10174 events. 7479/10174 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 478. Compared 52337 event pairs, 7479 based on Foata normal form. 0/8750 useless extension candidates. Maximal degree in co-relation 20470. Up to 10091 conditions per place. [2023-08-30 02:49:39,824 INFO L137 encePairwiseOnDemand]: 269/277 looper letters, 27 selfloop transitions, 0 changer transitions 0/31 dead transitions. [2023-08-30 02:49:39,824 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 31 transitions, 128 flow [2023-08-30 02:49:39,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 02:49:39,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 02:49:39,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 293 transitions. [2023-08-30 02:49:39,837 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5288808664259927 [2023-08-30 02:49:39,837 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 293 transitions. [2023-08-30 02:49:39,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 293 transitions. [2023-08-30 02:49:39,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:49:39,841 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 293 transitions. [2023-08-30 02:49:39,844 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 146.5) internal successors, (293), 2 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:49:39,848 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 277.0) internal successors, (831), 3 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:49:39,848 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 277.0) internal successors, (831), 3 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:49:39,850 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 90 flow. Second operand 2 states and 293 transitions. [2023-08-30 02:49:39,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 31 transitions, 128 flow [2023-08-30 02:49:39,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 31 transitions, 124 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 02:49:39,857 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 70 flow [2023-08-30 02:49:39,859 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=70, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2023-08-30 02:49:39,862 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -11 predicate places. [2023-08-30 02:49:39,863 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 70 flow [2023-08-30 02:49:39,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 129.5) internal successors, (259), 2 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:49:39,863 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:49:39,863 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 02:49:39,872 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-30 02:49:40,072 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-30 02:49:40,073 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-30 02:49:40,073 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:49:40,074 INFO L85 PathProgramCache]: Analyzing trace with hash 596493, now seen corresponding path program 1 times [2023-08-30 02:49:40,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:49:40,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1251759703] [2023-08-30 02:49:40,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:49:40,075 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-30 02:49:40,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:49:40,076 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-30 02:49:40,079 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-30 02:49:40,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:49:40,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 02:49:40,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:49:40,183 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-30 02:49:40,184 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:49:40,184 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:49:40,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1251759703] [2023-08-30 02:49:40,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1251759703] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:49:40,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:49:40,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:49:40,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520082381] [2023-08-30 02:49:40,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:49:40,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:49:40,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:49:40,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:49:40,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:49:40,193 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 277 [2023-08-30 02:49:40,194 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:49:40,195 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:49:40,195 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 277 [2023-08-30 02:49:40,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:49:41,176 INFO L130 PetriNetUnfolder]: 5879/8047 cut-off events. [2023-08-30 02:49:41,177 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:49:41,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16188 conditions, 8047 events. 5879/8047 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 39764 event pairs, 3031 based on Foata normal form. 0/7387 useless extension candidates. Maximal degree in co-relation 16185. Up to 6367 conditions per place. [2023-08-30 02:49:41,223 INFO L137 encePairwiseOnDemand]: 274/277 looper letters, 43 selfloop transitions, 2 changer transitions 2/51 dead transitions. [2023-08-30 02:49:41,223 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 51 transitions, 210 flow [2023-08-30 02:49:41,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:49:41,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:49:41,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 432 transitions. [2023-08-30 02:49:41,230 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.51985559566787 [2023-08-30 02:49:41,230 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 432 transitions. [2023-08-30 02:49:41,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 432 transitions. [2023-08-30 02:49:41,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:49:41,231 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 432 transitions. [2023-08-30 02:49:41,233 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:49:41,236 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 277.0) internal successors, (1108), 4 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:49:41,237 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 277.0) internal successors, (1108), 4 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:49:41,237 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 70 flow. Second operand 3 states and 432 transitions. [2023-08-30 02:49:41,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 51 transitions, 210 flow [2023-08-30 02:49:41,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 51 transitions, 210 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 02:49:41,239 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 70 flow [2023-08-30 02:49:41,240 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2023-08-30 02:49:41,240 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -10 predicate places. [2023-08-30 02:49:41,240 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 70 flow [2023-08-30 02:49:41,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:49:41,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:49:41,241 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:49:41,258 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-30 02:49:41,450 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-30 02:49:41,451 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-30 02:49:41,451 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:49:41,451 INFO L85 PathProgramCache]: Analyzing trace with hash -999685268, now seen corresponding path program 1 times [2023-08-30 02:49:41,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:49:41,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [48380356] [2023-08-30 02:49:41,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:49:41,452 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-30 02:49:41,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:49:41,454 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-30 02:49:41,457 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-30 02:49:41,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:49:41,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 02:49:41,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:49:41,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:49:41,590 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:49:41,590 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:49:41,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [48380356] [2023-08-30 02:49:41,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [48380356] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:49:41,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:49:41,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:49:41,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998951019] [2023-08-30 02:49:41,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:49:41,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:49:41,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:49:41,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:49:41,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:49:41,618 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 277 [2023-08-30 02:49:41,619 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:49:41,619 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:49:41,619 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 277 [2023-08-30 02:49:41,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:49:42,381 INFO L130 PetriNetUnfolder]: 3939/5639 cut-off events. [2023-08-30 02:49:42,382 INFO L131 PetriNetUnfolder]: For 377/377 co-relation queries the response was YES. [2023-08-30 02:49:42,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11788 conditions, 5639 events. 3939/5639 cut-off events. For 377/377 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 30385 event pairs, 655 based on Foata normal form. 320/5699 useless extension candidates. Maximal degree in co-relation 11784. Up to 3025 conditions per place. [2023-08-30 02:49:42,420 INFO L137 encePairwiseOnDemand]: 270/277 looper letters, 51 selfloop transitions, 6 changer transitions 1/62 dead transitions. [2023-08-30 02:49:42,421 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 62 transitions, 262 flow [2023-08-30 02:49:42,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:49:42,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:49:42,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 548 transitions. [2023-08-30 02:49:42,423 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49458483754512633 [2023-08-30 02:49:42,424 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 548 transitions. [2023-08-30 02:49:42,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 548 transitions. [2023-08-30 02:49:42,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:49:42,424 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 548 transitions. [2023-08-30 02:49:42,426 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:49:42,428 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 277.0) internal successors, (1385), 5 states have internal predecessors, (1385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:49:42,429 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 277.0) internal successors, (1385), 5 states have internal predecessors, (1385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:49:42,429 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 70 flow. Second operand 4 states and 548 transitions. [2023-08-30 02:49:42,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 62 transitions, 262 flow [2023-08-30 02:49:42,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 62 transitions, 254 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:49:42,432 INFO L231 Difference]: Finished difference. Result has 44 places, 33 transitions, 108 flow [2023-08-30 02:49:42,432 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, 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-30 02:49:42,433 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -8 predicate places. [2023-08-30 02:49:42,433 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 108 flow [2023-08-30 02:49:42,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:49:42,434 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:49:42,434 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:49:42,446 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-30 02:49:42,642 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-30 02:49:42,643 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-30 02:49:42,643 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:49:42,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1689360075, now seen corresponding path program 1 times [2023-08-30 02:49:42,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:49:42,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [896908398] [2023-08-30 02:49:42,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:49:42,644 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-30 02:49:42,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:49:42,645 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-30 02:49:42,648 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-30 02:49:42,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:49:42,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 02:49:42,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:49:42,794 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-30 02:49:42,795 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:49:42,795 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:49:42,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [896908398] [2023-08-30 02:49:42,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [896908398] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:49:42,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:49:42,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:49:42,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819676754] [2023-08-30 02:49:42,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:49:42,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:49:42,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:49:42,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:49:42,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:49:42,821 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 277 [2023-08-30 02:49:42,822 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 108 flow. Second operand has 5 states, 5 states have (on average 124.8) internal successors, (624), 5 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:49:42,822 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:49:42,822 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 277 [2023-08-30 02:49:42,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:49:43,296 INFO L130 PetriNetUnfolder]: 2022/3074 cut-off events. [2023-08-30 02:49:43,296 INFO L131 PetriNetUnfolder]: For 932/932 co-relation queries the response was YES. [2023-08-30 02:49:43,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7822 conditions, 3074 events. 2022/3074 cut-off events. For 932/932 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 16099 event pairs, 328 based on Foata normal form. 212/3188 useless extension candidates. Maximal degree in co-relation 7816. Up to 1044 conditions per place. [2023-08-30 02:49:43,312 INFO L137 encePairwiseOnDemand]: 270/277 looper letters, 64 selfloop transitions, 10 changer transitions 1/79 dead transitions. [2023-08-30 02:49:43,313 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 79 transitions, 379 flow [2023-08-30 02:49:43,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:49:43,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:49:43,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 687 transitions. [2023-08-30 02:49:43,316 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.496028880866426 [2023-08-30 02:49:43,316 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 687 transitions. [2023-08-30 02:49:43,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 687 transitions. [2023-08-30 02:49:43,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:49:43,317 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 687 transitions. [2023-08-30 02:49:43,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 137.4) internal successors, (687), 5 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:49:43,321 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 277.0) internal successors, (1662), 6 states have internal predecessors, (1662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:49:43,321 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 277.0) internal successors, (1662), 6 states have internal predecessors, (1662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:49:43,322 INFO L175 Difference]: Start difference. First operand has 44 places, 33 transitions, 108 flow. Second operand 5 states and 687 transitions. [2023-08-30 02:49:43,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 79 transitions, 379 flow [2023-08-30 02:49:43,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 79 transitions, 368 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 02:49:43,326 INFO L231 Difference]: Finished difference. Result has 48 places, 37 transitions, 160 flow [2023-08-30 02:49:43,326 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, 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-30 02:49:43,327 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -4 predicate places. [2023-08-30 02:49:43,327 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 160 flow [2023-08-30 02:49:43,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 124.8) internal successors, (624), 5 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:49:43,328 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:49:43,328 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-30 02:49:43,338 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-30 02:49:43,537 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-30 02:49:43,538 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-30 02:49:43,538 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:49:43,538 INFO L85 PathProgramCache]: Analyzing trace with hash -486863679, now seen corresponding path program 1 times [2023-08-30 02:49:43,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:49:43,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1099416115] [2023-08-30 02:49:43,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:49:43,539 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-30 02:49:43,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:49:43,540 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-30 02:49:43,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-08-30 02:49:43,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:49:43,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-30 02:49:43,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:49:43,704 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-30 02:49:43,706 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:49:43,706 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:49:43,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1099416115] [2023-08-30 02:49:43,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1099416115] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:49:43,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:49:43,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:49:43,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609532649] [2023-08-30 02:49:43,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:49:43,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:49:43,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:49:43,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:49:43,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:49:43,722 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 277 [2023-08-30 02:49:43,724 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 160 flow. Second operand has 6 states, 6 states have (on average 124.83333333333333) internal successors, (749), 6 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:49:43,724 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:49:43,724 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 277 [2023-08-30 02:49:43,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:49:44,141 INFO L130 PetriNetUnfolder]: 1176/1841 cut-off events. [2023-08-30 02:49:44,142 INFO L131 PetriNetUnfolder]: For 1604/1604 co-relation queries the response was YES. [2023-08-30 02:49:44,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5337 conditions, 1841 events. 1176/1841 cut-off events. For 1604/1604 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 9007 event pairs, 326 based on Foata normal form. 77/1883 useless extension candidates. Maximal degree in co-relation 5330. Up to 630 conditions per place. [2023-08-30 02:49:44,154 INFO L137 encePairwiseOnDemand]: 270/277 looper letters, 75 selfloop transitions, 14 changer transitions 1/94 dead transitions. [2023-08-30 02:49:44,154 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 94 transitions, 502 flow [2023-08-30 02:49:44,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:49:44,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:49:44,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 824 transitions. [2023-08-30 02:49:44,157 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49578820697954273 [2023-08-30 02:49:44,157 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 824 transitions. [2023-08-30 02:49:44,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 824 transitions. [2023-08-30 02:49:44,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:49:44,158 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 824 transitions. [2023-08-30 02:49:44,160 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 137.33333333333334) internal successors, (824), 6 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:49:44,163 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 277.0) internal successors, (1939), 7 states have internal predecessors, (1939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:49:44,164 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 277.0) internal successors, (1939), 7 states have internal predecessors, (1939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:49:44,164 INFO L175 Difference]: Start difference. First operand has 48 places, 37 transitions, 160 flow. Second operand 6 states and 824 transitions. [2023-08-30 02:49:44,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 94 transitions, 502 flow [2023-08-30 02:49:44,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 94 transitions, 472 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-08-30 02:49:44,178 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 210 flow [2023-08-30 02:49:44,178 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, 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-30 02:49:44,179 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -1 predicate places. [2023-08-30 02:49:44,179 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 210 flow [2023-08-30 02:49:44,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 124.83333333333333) internal successors, (749), 6 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:49:44,179 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:49:44,180 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-30 02:49:44,195 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-30 02:49:44,389 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-30 02:49:44,390 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-30 02:49:44,390 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:49:44,390 INFO L85 PathProgramCache]: Analyzing trace with hash -646933460, now seen corresponding path program 1 times [2023-08-30 02:49:44,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:49:44,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2036645060] [2023-08-30 02:49:44,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:49:44,391 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:49:44,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:49:44,392 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-30 02:49:44,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-08-30 02:49:44,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:49:44,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-30 02:49:44,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:49:44,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:49:44,571 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:49:44,572 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:49:44,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2036645060] [2023-08-30 02:49:44,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2036645060] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:49:44,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:49:44,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 02:49:44,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205958220] [2023-08-30 02:49:44,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:49:44,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:49:44,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:49:44,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:49:44,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:49:44,591 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 277 [2023-08-30 02:49:44,593 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 210 flow. Second operand has 7 states, 7 states have (on average 124.85714285714286) internal successors, (874), 7 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:49:44,593 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:49:44,593 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 277 [2023-08-30 02:49:44,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:49:44,986 INFO L130 PetriNetUnfolder]: 1011/1561 cut-off events. [2023-08-30 02:49:44,986 INFO L131 PetriNetUnfolder]: For 1473/1473 co-relation queries the response was YES. [2023-08-30 02:49:44,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4602 conditions, 1561 events. 1011/1561 cut-off events. For 1473/1473 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7443 event pairs, 326 based on Foata normal form. 14/1553 useless extension candidates. Maximal degree in co-relation 4594. Up to 630 conditions per place. [2023-08-30 02:49:44,995 INFO L137 encePairwiseOnDemand]: 270/277 looper letters, 58 selfloop transitions, 18 changer transitions 1/81 dead transitions. [2023-08-30 02:49:44,995 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 81 transitions, 460 flow [2023-08-30 02:49:44,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:49:44,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:49:44,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 933 transitions. [2023-08-30 02:49:44,998 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.481175863847344 [2023-08-30 02:49:44,999 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 933 transitions. [2023-08-30 02:49:44,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 933 transitions. [2023-08-30 02:49:44,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:49:44,999 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 933 transitions. [2023-08-30 02:49:45,001 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 133.28571428571428) internal successors, (933), 7 states have internal predecessors, (933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:49:45,004 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 277.0) internal successors, (2216), 8 states have internal predecessors, (2216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:49:45,004 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 277.0) internal successors, (2216), 8 states have internal predecessors, (2216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:49:45,005 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 210 flow. Second operand 7 states and 933 transitions. [2023-08-30 02:49:45,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 81 transitions, 460 flow [2023-08-30 02:49:45,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 81 transitions, 414 flow, removed 9 selfloop flow, removed 5 redundant places. [2023-08-30 02:49:45,015 INFO L231 Difference]: Finished difference. Result has 54 places, 41 transitions, 220 flow [2023-08-30 02:49:45,015 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, 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-30 02:49:45,016 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 2 predicate places. [2023-08-30 02:49:45,016 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 41 transitions, 220 flow [2023-08-30 02:49:45,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 124.85714285714286) internal successors, (874), 7 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:49:45,016 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:49:45,016 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-30 02:49:45,029 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-30 02:49:45,228 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-30 02:49:45,228 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-30 02:49:45,228 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:49:45,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1237386080, now seen corresponding path program 1 times [2023-08-30 02:49:45,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:49:45,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1452882672] [2023-08-30 02:49:45,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:49:45,229 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-30 02:49:45,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:49:45,230 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-30 02:49:45,231 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-30 02:49:45,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:49:45,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-30 02:49:45,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:49:45,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:49:45,992 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:49:45,992 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:49:45,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1452882672] [2023-08-30 02:49:45,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1452882672] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:49:45,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:49:45,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:49:45,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526801337] [2023-08-30 02:49:45,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:49:45,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:49:45,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:49:45,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:49:45,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:49:46,531 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 277 [2023-08-30 02:49:46,532 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 41 transitions, 220 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-30 02:49:46,532 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:49:46,532 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 277 [2023-08-30 02:49:46,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:49:46,933 INFO L130 PetriNetUnfolder]: 999/1551 cut-off events. [2023-08-30 02:49:46,933 INFO L131 PetriNetUnfolder]: For 1643/1643 co-relation queries the response was YES. [2023-08-30 02:49:46,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4492 conditions, 1551 events. 999/1551 cut-off events. For 1643/1643 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7251 event pairs, 179 based on Foata normal form. 0/1551 useless extension candidates. Maximal degree in co-relation 4483. Up to 1251 conditions per place. [2023-08-30 02:49:46,944 INFO L137 encePairwiseOnDemand]: 272/277 looper letters, 58 selfloop transitions, 4 changer transitions 0/66 dead transitions. [2023-08-30 02:49:46,944 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 66 transitions, 478 flow [2023-08-30 02:49:46,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:49:46,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:49:46,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 697 transitions. [2023-08-30 02:49:46,947 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4193742478941035 [2023-08-30 02:49:46,947 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 697 transitions. [2023-08-30 02:49:46,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 697 transitions. [2023-08-30 02:49:46,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:49:46,948 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 697 transitions. [2023-08-30 02:49:46,949 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 116.16666666666667) internal successors, (697), 6 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-30 02:49:46,951 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 277.0) internal successors, (1939), 7 states have internal predecessors, (1939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:49:46,952 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 277.0) internal successors, (1939), 7 states have internal predecessors, (1939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:49:46,952 INFO L175 Difference]: Start difference. First operand has 54 places, 41 transitions, 220 flow. Second operand 6 states and 697 transitions. [2023-08-30 02:49:46,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 66 transitions, 478 flow [2023-08-30 02:49:46,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 66 transitions, 324 flow, removed 17 selfloop flow, removed 11 redundant places. [2023-08-30 02:49:46,960 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 128 flow [2023-08-30 02:49:46,960 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, 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-30 02:49:46,960 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -5 predicate places. [2023-08-30 02:49:46,961 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 128 flow [2023-08-30 02:49:46,961 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-30 02:49:46,961 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:49:46,961 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-30 02:49:46,974 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-30 02:49:47,174 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-30 02:49:47,174 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-30 02:49:47,174 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:49:47,174 INFO L85 PathProgramCache]: Analyzing trace with hash -644900464, now seen corresponding path program 1 times [2023-08-30 02:49:47,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:49:47,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2062986080] [2023-08-30 02:49:47,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:49:47,175 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-30 02:49:47,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:49:47,177 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-30 02:49:47,179 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-30 02:49:47,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:49:47,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 02:49:47,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:49:47,327 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-30 02:49:47,327 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:49:47,327 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:49:47,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2062986080] [2023-08-30 02:49:47,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2062986080] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:49:47,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:49:47,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:49:47,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492081856] [2023-08-30 02:49:47,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:49:47,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:49:47,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:49:47,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:49:47,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:49:47,335 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 277 [2023-08-30 02:49:47,336 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:49:47,336 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:49:47,336 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 277 [2023-08-30 02:49:47,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:49:47,657 INFO L130 PetriNetUnfolder]: 1766/2701 cut-off events. [2023-08-30 02:49:47,657 INFO L131 PetriNetUnfolder]: For 507/507 co-relation queries the response was YES. [2023-08-30 02:49:47,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6404 conditions, 2701 events. 1766/2701 cut-off events. For 507/507 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 14267 event pairs, 765 based on Foata normal form. 1/2669 useless extension candidates. Maximal degree in co-relation 6400. Up to 1521 conditions per place. [2023-08-30 02:49:47,666 INFO L137 encePairwiseOnDemand]: 274/277 looper letters, 54 selfloop transitions, 2 changer transitions 11/70 dead transitions. [2023-08-30 02:49:47,666 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 70 transitions, 361 flow [2023-08-30 02:49:47,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:49:47,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:49:47,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 422 transitions. [2023-08-30 02:49:47,669 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5078219013237064 [2023-08-30 02:49:47,669 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 422 transitions. [2023-08-30 02:49:47,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 422 transitions. [2023-08-30 02:49:47,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:49:47,670 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 422 transitions. [2023-08-30 02:49:47,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:49:47,672 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 277.0) internal successors, (1108), 4 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:49:47,673 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 277.0) internal successors, (1108), 4 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:49:47,673 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 128 flow. Second operand 3 states and 422 transitions. [2023-08-30 02:49:47,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 70 transitions, 361 flow [2023-08-30 02:49:47,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 70 transitions, 351 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 02:49:47,675 INFO L231 Difference]: Finished difference. Result has 46 places, 40 transitions, 129 flow [2023-08-30 02:49:47,675 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=129, PETRI_PLACES=46, PETRI_TRANSITIONS=40} [2023-08-30 02:49:47,675 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -6 predicate places. [2023-08-30 02:49:47,676 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 40 transitions, 129 flow [2023-08-30 02:49:47,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:49:47,676 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:49:47,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-30 02:49:47,687 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-30 02:49:47,886 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-30 02:49:47,887 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-30 02:49:47,887 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:49:47,887 INFO L85 PathProgramCache]: Analyzing trace with hash 993927542, now seen corresponding path program 2 times [2023-08-30 02:49:47,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:49:47,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [366019631] [2023-08-30 02:49:47,888 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 02:49:47,888 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-30 02:49:47,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:49:47,889 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-30 02:49:47,892 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-30 02:49:48,007 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 02:49:48,007 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:49:48,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-30 02:49:48,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:49:48,437 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-30 02:49:48,437 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:49:48,438 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:49:48,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [366019631] [2023-08-30 02:49:48,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [366019631] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:49:48,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:49:48,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 02:49:48,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923416930] [2023-08-30 02:49:48,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:49:48,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 02:49:48,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:49:48,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 02:49:48,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-08-30 02:49:48,500 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 277 [2023-08-30 02:49:48,501 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 40 transitions, 129 flow. Second operand has 8 states, 8 states have (on average 126.0) internal successors, (1008), 8 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:49:48,501 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:49:48,501 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 277 [2023-08-30 02:49:48,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:49:48,841 INFO L130 PetriNetUnfolder]: 901/1423 cut-off events. [2023-08-30 02:49:48,841 INFO L131 PetriNetUnfolder]: For 266/268 co-relation queries the response was YES. [2023-08-30 02:49:48,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3635 conditions, 1423 events. 901/1423 cut-off events. For 266/268 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6506 event pairs, 152 based on Foata normal form. 2/1420 useless extension candidates. Maximal degree in co-relation 3630. Up to 617 conditions per place. [2023-08-30 02:49:48,847 INFO L137 encePairwiseOnDemand]: 271/277 looper letters, 68 selfloop transitions, 4 changer transitions 31/107 dead transitions. [2023-08-30 02:49:48,847 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 107 transitions, 558 flow [2023-08-30 02:49:48,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:49:48,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:49:48,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 929 transitions. [2023-08-30 02:49:48,850 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4791129448169159 [2023-08-30 02:49:48,850 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 929 transitions. [2023-08-30 02:49:48,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 929 transitions. [2023-08-30 02:49:48,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:49:48,850 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 929 transitions. [2023-08-30 02:49:48,852 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 132.71428571428572) internal successors, (929), 7 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:49:48,855 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 277.0) internal successors, (2216), 8 states have internal predecessors, (2216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:49:48,855 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 277.0) internal successors, (2216), 8 states have internal predecessors, (2216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:49:48,855 INFO L175 Difference]: Start difference. First operand has 46 places, 40 transitions, 129 flow. Second operand 7 states and 929 transitions. [2023-08-30 02:49:48,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 107 transitions, 558 flow [2023-08-30 02:49:48,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 107 transitions, 546 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 02:49:48,858 INFO L231 Difference]: Finished difference. Result has 52 places, 40 transitions, 137 flow [2023-08-30 02:49:48,858 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=44, 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=7, PETRI_FLOW=137, PETRI_PLACES=52, PETRI_TRANSITIONS=40} [2023-08-30 02:49:48,859 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places. [2023-08-30 02:49:48,859 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 137 flow [2023-08-30 02:49:48,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 126.0) internal successors, (1008), 8 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:49:48,859 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:49:48,859 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-30 02:49:48,872 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-30 02:49:49,069 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-30 02:49:49,069 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-30 02:49:49,069 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:49:49,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1213030058, now seen corresponding path program 3 times [2023-08-30 02:49:49,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:49:49,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1246808852] [2023-08-30 02:49:49,070 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 02:49:49,070 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-30 02:49:49,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:49:49,071 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-30 02:49:49,074 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-30 02:49:49,184 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-30 02:49:49,184 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:49:49,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 02:49:49,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:49:49,233 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-30 02:49:49,233 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:49:49,234 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:49:49,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1246808852] [2023-08-30 02:49:49,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1246808852] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:49:49,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:49:49,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:49:49,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904889188] [2023-08-30 02:49:49,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:49:49,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:49:49,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:49:49,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:49:49,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:49:49,246 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 277 [2023-08-30 02:49:49,247 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 137 flow. Second operand has 4 states, 4 states have (on average 131.25) internal successors, (525), 4 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:49:49,247 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:49:49,247 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 277 [2023-08-30 02:49:49,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:49:49,588 INFO L130 PetriNetUnfolder]: 1463/2388 cut-off events. [2023-08-30 02:49:49,588 INFO L131 PetriNetUnfolder]: For 1004/1004 co-relation queries the response was YES. [2023-08-30 02:49:49,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6005 conditions, 2388 events. 1463/2388 cut-off events. For 1004/1004 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 12710 event pairs, 212 based on Foata normal form. 1/2389 useless extension candidates. Maximal degree in co-relation 5999. Up to 1299 conditions per place. [2023-08-30 02:49:49,594 INFO L137 encePairwiseOnDemand]: 274/277 looper letters, 48 selfloop transitions, 1 changer transitions 31/83 dead transitions. [2023-08-30 02:49:49,594 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 83 transitions, 447 flow [2023-08-30 02:49:49,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:49:49,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:49:49,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 555 transitions. [2023-08-30 02:49:49,597 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5009025270758123 [2023-08-30 02:49:49,597 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 555 transitions. [2023-08-30 02:49:49,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 555 transitions. [2023-08-30 02:49:49,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:49:49,597 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 555 transitions. [2023-08-30 02:49:49,599 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-30 02:49:49,600 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 277.0) internal successors, (1385), 5 states have internal predecessors, (1385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:49:49,601 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 277.0) internal successors, (1385), 5 states have internal predecessors, (1385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:49:49,601 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 137 flow. Second operand 4 states and 555 transitions. [2023-08-30 02:49:49,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 83 transitions, 447 flow [2023-08-30 02:49:49,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 83 transitions, 429 flow, removed 1 selfloop flow, removed 5 redundant places. [2023-08-30 02:49:49,607 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 134 flow [2023-08-30 02:49:49,607 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=134, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2023-08-30 02:49:49,608 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -2 predicate places. [2023-08-30 02:49:49,608 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 134 flow [2023-08-30 02:49:49,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.25) internal successors, (525), 4 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:49:49,608 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:49:49,609 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-30 02:49:49,621 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-30 02:49:49,819 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-30 02:49:49,819 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-30 02:49:49,819 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:49:49,819 INFO L85 PathProgramCache]: Analyzing trace with hash 2066616336, now seen corresponding path program 4 times [2023-08-30 02:49:49,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:49:49,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [960937311] [2023-08-30 02:49:49,820 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 02:49:49,820 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-30 02:49:49,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:49:49,822 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-30 02:49:49,825 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-30 02:49:49,951 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 02:49:49,952 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:49:49,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 02:49:49,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:49:49,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:49:49,997 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:49:49,997 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:49:49,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [960937311] [2023-08-30 02:49:49,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [960937311] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:49:49,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:49:49,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:49:49,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305342814] [2023-08-30 02:49:49,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:49:49,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:49:49,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:49:49,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:49:49,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:49:50,012 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 277 [2023-08-30 02:49:50,014 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 134 flow. Second operand has 4 states, 4 states have (on average 131.25) internal successors, (525), 4 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:49:50,014 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:49:50,014 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 277 [2023-08-30 02:49:50,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:49:50,298 INFO L130 PetriNetUnfolder]: 1376/2249 cut-off events. [2023-08-30 02:49:50,298 INFO L131 PetriNetUnfolder]: For 772/777 co-relation queries the response was YES. [2023-08-30 02:49:50,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5447 conditions, 2249 events. 1376/2249 cut-off events. For 772/777 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 11289 event pairs, 481 based on Foata normal form. 1/2234 useless extension candidates. Maximal degree in co-relation 5440. Up to 879 conditions per place. [2023-08-30 02:49:50,305 INFO L137 encePairwiseOnDemand]: 274/277 looper letters, 42 selfloop transitions, 1 changer transitions 34/80 dead transitions. [2023-08-30 02:49:50,305 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 80 transitions, 427 flow [2023-08-30 02:49:50,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:49:50,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:49:50,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 548 transitions. [2023-08-30 02:49:50,307 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49458483754512633 [2023-08-30 02:49:50,307 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 548 transitions. [2023-08-30 02:49:50,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 548 transitions. [2023-08-30 02:49:50,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:49:50,307 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 548 transitions. [2023-08-30 02:49:50,308 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:49:50,310 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 277.0) internal successors, (1385), 5 states have internal predecessors, (1385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:49:50,310 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 277.0) internal successors, (1385), 5 states have internal predecessors, (1385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:49:50,311 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 134 flow. Second operand 4 states and 548 transitions. [2023-08-30 02:49:50,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 80 transitions, 427 flow [2023-08-30 02:49:50,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 80 transitions, 423 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 02:49:50,313 INFO L231 Difference]: Finished difference. Result has 52 places, 40 transitions, 138 flow [2023-08-30 02:49:50,313 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=138, PETRI_PLACES=52, PETRI_TRANSITIONS=40} [2023-08-30 02:49:50,314 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places. [2023-08-30 02:49:50,314 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 138 flow [2023-08-30 02:49:50,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.25) internal successors, (525), 4 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:49:50,315 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:49:50,315 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-30 02:49:50,327 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-30 02:49:50,524 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-30 02:49:50,524 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-30 02:49:50,525 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:49:50,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1301650228, now seen corresponding path program 5 times [2023-08-30 02:49:50,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:49:50,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [659353416] [2023-08-30 02:49:50,525 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-30 02:49:50,525 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-30 02:49:50,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:49:50,527 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-30 02:49:50,528 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-30 02:49:50,667 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 02:49:50,667 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-30 02:49:50,667 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 02:49:50,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:49:50,827 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-30 02:49:50,827 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 02:49:50,828 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-30 02:49:50,830 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-30 02:49:50,830 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-30 02:49:50,830 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-30 02:49:50,831 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-30 02:49:50,831 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-30 02:49:50,831 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-30 02:49:50,831 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-30 02:49:50,831 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-30 02:49:50,831 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-30 02:49:50,832 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-30 02:49:50,832 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-30 02:49:50,832 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-30 02:49:50,832 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-30 02:49:50,832 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-30 02:49:50,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-30 02:49:50,847 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-30 02:49:51,044 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-30 02:49:51,044 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:49:51,049 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 02:49:51,049 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 02:49:51,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 02:49:51 BasicIcfg [2023-08-30 02:49:51,137 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 02:49:51,138 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 02:49:51,138 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 02:49:51,138 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 02:49:51,139 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:49:31" (3/4) ... [2023-08-30 02:49:51,141 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-30 02:49:51,141 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 02:49:51,142 INFO L158 Benchmark]: Toolchain (without parser) took 20918.70ms. Allocated memory was 79.7MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 56.3MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 378.2MB. Max. memory is 16.1GB. [2023-08-30 02:49:51,142 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 58.7MB. Free memory is still 36.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:49:51,142 INFO L158 Benchmark]: CACSL2BoogieTranslator took 517.62ms. Allocated memory is still 79.7MB. Free memory was 56.0MB in the beginning and 51.1MB in the end (delta: 4.9MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. [2023-08-30 02:49:51,143 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.67ms. Allocated memory is still 79.7MB. Free memory was 51.1MB in the beginning and 48.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:49:51,143 INFO L158 Benchmark]: Boogie Preprocessor took 67.18ms. Allocated memory is still 79.7MB. Free memory was 48.5MB in the beginning and 46.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:49:51,143 INFO L158 Benchmark]: RCFGBuilder took 785.38ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 46.5MB in the beginning and 68.2MB in the end (delta: -21.7MB). Peak memory consumption was 22.9MB. Max. memory is 16.1GB. [2023-08-30 02:49:51,143 INFO L158 Benchmark]: TraceAbstraction took 19491.75ms. Allocated memory was 96.5MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 67.6MB in the beginning and 1.1GB in the end (delta: -994.3MB). Peak memory consumption was 370.8MB. Max. memory is 16.1GB. [2023-08-30 02:49:51,144 INFO L158 Benchmark]: Witness Printer took 3.26ms. Allocated memory is still 1.5GB. Free memory is still 1.1GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:49:51,145 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.17ms. Allocated memory is still 58.7MB. Free memory is still 36.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 517.62ms. Allocated memory is still 79.7MB. Free memory was 56.0MB in the beginning and 51.1MB in the end (delta: 4.9MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.67ms. Allocated memory is still 79.7MB. Free memory was 51.1MB in the beginning and 48.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.18ms. Allocated memory is still 79.7MB. Free memory was 48.5MB in the beginning and 46.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 785.38ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 46.5MB in the beginning and 68.2MB in the end (delta: -21.7MB). Peak memory consumption was 22.9MB. Max. memory is 16.1GB. * TraceAbstraction took 19491.75ms. Allocated memory was 96.5MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 67.6MB in the beginning and 1.1GB in the end (delta: -994.3MB). Peak memory consumption was 370.8MB. Max. memory is 16.1GB. * Witness Printer took 3.26ms. Allocated memory is still 1.5GB. Free memory is still 1.1GB. 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.4s, 151 PlacesBefore, 52 PlacesAfterwards, 140 TransitionsBefore, 39 TransitionsAfterwards, 3524 CoEnabledTransitionPairs, 7 FixpointIterations, 53 TrivialSequentialCompositions, 69 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 133 TotalNumberOfCompositions, 10243 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4785, independent: 4541, independent conditional: 0, independent unconditional: 4541, dependent: 244, dependent conditional: 0, dependent unconditional: 244, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1876, independent: 1823, independent conditional: 0, independent unconditional: 1823, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4785, independent: 2718, independent conditional: 0, independent unconditional: 2718, dependent: 191, dependent conditional: 0, dependent unconditional: 191, unknown: 1876, unknown conditional: 0, unknown unconditional: 1876] , Statistics on independence cache: Total cache size (in pairs): 188, Positive cache size: 167, Positive conditional cache size: 0, Positive unconditional cache size: 167, 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_p0_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; [L721] 0 _Bool a$flush_delayed; [L722] 0 int a$mem_tmp; [L723] 0 _Bool a$r_buff0_thd0; [L724] 0 _Bool a$r_buff0_thd1; [L725] 0 _Bool a$r_buff0_thd2; [L726] 0 _Bool a$r_buff0_thd3; [L727] 0 _Bool a$r_buff0_thd4; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$r_buff1_thd4; [L733] 0 _Bool a$read_delayed; [L734] 0 int *a$read_delayed_var; [L735] 0 int a$w_buff0; [L736] 0 _Bool a$w_buff0_used; [L737] 0 int a$w_buff1; [L738] 0 _Bool a$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L866] 0 pthread_t t521; [L867] FCALL, FORK 0 pthread_create(&t521, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t521, ((void *)0), P0, ((void *)0))=0, t521={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 a$w_buff1 = a$w_buff0 [L753] 1 a$w_buff0 = 1 [L754] 1 a$w_buff1_used = a$w_buff0_used [L755] 1 a$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L757] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L758] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L759] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L760] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L761] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L868] 0 pthread_t t522; [L869] FCALL, FORK 0 pthread_create(&t522, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t522, ((void *)0), P1, ((void *)0))=1, t521={3:0}, t522={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L870] 0 pthread_t t523; [L782] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L785] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L788] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L789] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L790] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L791] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L792] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L871] FCALL, FORK 0 pthread_create(&t523, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t523, ((void *)0), P2, ((void *)0))=2, t521={3:0}, t522={7:0}, t523={11:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L872] 0 pthread_t t524; [L802] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L873] FCALL, FORK 0 pthread_create(&t524, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t524, ((void *)0), P3, ((void *)0))=3, t521={3:0}, t522={7:0}, t523={11:0}, t524={15:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L805] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L808] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L809] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L810] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L811] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L812] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L822] 4 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L825] 4 __unbuffered_p3_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L828] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L829] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L830] 4 a$flush_delayed = weak$$choice2 [L831] 4 a$mem_tmp = a [L832] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L833] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L834] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L835] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L836] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L838] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 __unbuffered_p3_EBX = a [L840] 4 a = a$flush_delayed ? a$mem_tmp : a [L841] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z=1] [L768] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L770] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L771] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L772] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z=1] [L844] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L845] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L846] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L847] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L848] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z=1] [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L851] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L853] 4 return 0; [L875] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t521={3:0}, t522={7:0}, t523={11:0}, t524={15:0}, weak$$choice2=0, x=1, y=2, z=1] [L877] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L877] RET 0 assume_abort_if_not(main$tmp_guard0) [L879] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L880] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L881] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L882] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L883] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t521={3:0}, t522={7:0}, t523={11:0}, t524={15:0}, weak$$choice2=0, x=1, y=2, z=1] [L886] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L888] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, 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: 864]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 867]: 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: 873]: 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: 869]: 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: 871]: 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, 181 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: 19.3s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 7.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 722 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 582 mSDsluCounter, 206 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 127 mSDsCounter, 82 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1889 IncrementalHoareTripleChecker+Invalid, 1971 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 82 mSolverCounterUnsat, 79 mSDtfsCounter, 1889 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 217 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=220occurred in iteration=6, InterpolantAutomatonStates: 51, 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.6s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 240 NumberOfCodeBlocks, 240 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 201 ConstructedInterpolants, 12 QuantifiedInterpolants, 1861 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1714 ConjunctsInSsa, 84 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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-30 02:49:51,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample