./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix036_pso.opt_tso.opt.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/mix036_pso.opt_tso.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eb5b5f76ea992c17ebcf5a0e506a820a4d574c4d0723905971e2f5f6725ae203 --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:53:22,384 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 02:53:22,387 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 02:53:22,428 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 02:53:22,431 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 02:53:22,435 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 02:53:22,437 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 02:53:22,439 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 02:53:22,440 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 02:53:22,445 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 02:53:22,446 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 02:53:22,446 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 02:53:22,447 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 02:53:22,448 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 02:53:22,449 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 02:53:22,450 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 02:53:22,452 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 02:53:22,453 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 02:53:22,454 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 02:53:22,456 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 02:53:22,459 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 02:53:22,474 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 02:53:22,476 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 02:53:22,476 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 02:53:22,479 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 02:53:22,481 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 02:53:22,481 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 02:53:22,482 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 02:53:22,483 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 02:53:22,483 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 02:53:22,484 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 02:53:22,484 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 02:53:22,485 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 02:53:22,486 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 02:53:22,487 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 02:53:22,488 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 02:53:22,489 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 02:53:22,489 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 02:53:22,489 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 02:53:22,490 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 02:53:22,490 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 02:53:22,493 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:53:22,519 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 02:53:22,519 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 02:53:22,521 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 02:53:22,521 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 02:53:22,522 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 02:53:22,522 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 02:53:22,522 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 02:53:22,522 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 02:53:22,523 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 02:53:22,523 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 02:53:22,524 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 02:53:22,524 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 02:53:22,524 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 02:53:22,524 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 02:53:22,524 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 02:53:22,524 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 02:53:22,525 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 02:53:22,525 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 02:53:22,525 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 02:53:22,525 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 02:53:22,525 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 02:53:22,525 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 02:53:22,526 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 02:53:22,526 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 02:53:22,526 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 02:53:22,526 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:53:22,526 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 02:53:22,526 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 02:53:22,527 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 02:53:22,527 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 02:53:22,527 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 02:53:22,527 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 02:53:22,527 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 02:53:22,528 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 02:53:22,528 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 -> eb5b5f76ea992c17ebcf5a0e506a820a4d574c4d0723905971e2f5f6725ae203 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:53:22,826 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 02:53:22,844 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 02:53:22,847 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 02:53:22,848 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 02:53:22,848 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 02:53:22,849 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix036_pso.opt_tso.opt.i [2023-08-30 02:53:24,154 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 02:53:24,386 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 02:53:24,387 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix036_pso.opt_tso.opt.i [2023-08-30 02:53:24,396 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e47ef4a54/57631cd6e2a1462a96cbfc843202ba82/FLAG15b9fc6f3 [2023-08-30 02:53:24,407 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e47ef4a54/57631cd6e2a1462a96cbfc843202ba82 [2023-08-30 02:53:24,408 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 02:53:24,409 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 02:53:24,410 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 02:53:24,410 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 02:53:24,420 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 02:53:24,421 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:53:24" (1/1) ... [2023-08-30 02:53:24,422 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@124c75df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:24, skipping insertion in model container [2023-08-30 02:53:24,423 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:53:24" (1/1) ... [2023-08-30 02:53:24,428 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 02:53:24,483 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 02:53:24,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/mix036_pso.opt_tso.opt.i[956,969] [2023-08-30 02:53:24,777 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:53:24,785 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 02:53:24,794 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/mix036_pso.opt_tso.opt.i[956,969] [2023-08-30 02:53:24,859 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:53:24,884 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:53:24,884 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:53:24,889 INFO L208 MainTranslator]: Completed translation [2023-08-30 02:53:24,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:24 WrapperNode [2023-08-30 02:53:24,889 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 02:53:24,890 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 02:53:24,890 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 02:53:24,891 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 02:53:24,895 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:53:24" (1/1) ... [2023-08-30 02:53:24,913 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:53:24" (1/1) ... [2023-08-30 02:53:24,956 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 153 [2023-08-30 02:53:24,956 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 02:53:24,957 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 02:53:24,957 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 02:53:24,957 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 02:53:24,963 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:24" (1/1) ... [2023-08-30 02:53:24,963 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:24" (1/1) ... [2023-08-30 02:53:24,966 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:24" (1/1) ... [2023-08-30 02:53:24,966 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:24" (1/1) ... [2023-08-30 02:53:24,971 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:24" (1/1) ... [2023-08-30 02:53:24,975 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:24" (1/1) ... [2023-08-30 02:53:24,977 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:24" (1/1) ... [2023-08-30 02:53:24,993 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:24" (1/1) ... [2023-08-30 02:53:24,996 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 02:53:24,996 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 02:53:24,996 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 02:53:24,997 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 02:53:24,997 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:24" (1/1) ... [2023-08-30 02:53:25,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:53:25,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:53:25,029 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:53:25,037 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:53:25,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 02:53:25,056 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 02:53:25,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 02:53:25,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 02:53:25,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 02:53:25,057 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 02:53:25,057 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 02:53:25,058 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 02:53:25,058 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 02:53:25,058 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 02:53:25,058 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 02:53:25,058 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-30 02:53:25,058 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-30 02:53:25,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 02:53:25,058 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 02:53:25,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 02:53:25,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 02:53:25,060 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:53:25,217 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 02:53:25,226 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 02:53:25,459 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 02:53:25,558 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 02:53:25,559 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 02:53:25,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:53:25 BoogieIcfgContainer [2023-08-30 02:53:25,560 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 02:53:25,563 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 02:53:25,563 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 02:53:25,565 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 02:53:25,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 02:53:24" (1/3) ... [2023-08-30 02:53:25,566 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e243178 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:53:25, skipping insertion in model container [2023-08-30 02:53:25,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:24" (2/3) ... [2023-08-30 02:53:25,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e243178 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:53:25, skipping insertion in model container [2023-08-30 02:53:25,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:53:25" (3/3) ... [2023-08-30 02:53:25,568 INFO L112 eAbstractionObserver]: Analyzing ICFG mix036_pso.opt_tso.opt.i [2023-08-30 02:53:25,579 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 02:53:25,579 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-30 02:53:25,580 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 02:53:25,618 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 02:53:25,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 143 transitions, 306 flow [2023-08-30 02:53:25,703 INFO L130 PetriNetUnfolder]: 2/139 cut-off events. [2023-08-30 02:53:25,704 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:53:25,708 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 98 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 95. Up to 2 conditions per place. [2023-08-30 02:53:25,708 INFO L82 GeneralOperation]: Start removeDead. Operand has 154 places, 143 transitions, 306 flow [2023-08-30 02:53:25,715 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 150 places, 139 transitions, 290 flow [2023-08-30 02:53:25,718 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 02:53:25,732 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 150 places, 139 transitions, 290 flow [2023-08-30 02:53:25,738 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 150 places, 139 transitions, 290 flow [2023-08-30 02:53:25,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 139 transitions, 290 flow [2023-08-30 02:53:25,774 INFO L130 PetriNetUnfolder]: 2/139 cut-off events. [2023-08-30 02:53:25,774 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:53:25,775 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 98 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 95. Up to 2 conditions per place. [2023-08-30 02:53:25,778 INFO L119 LiptonReduction]: Number of co-enabled transitions 3128 [2023-08-30 02:53:29,573 INFO L134 LiptonReduction]: Checked pairs total: 7350 [2023-08-30 02:53:29,574 INFO L136 LiptonReduction]: Total number of compositions: 129 [2023-08-30 02:53:29,583 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 02:53:29,594 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;@1ebbd614, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 02:53:29,594 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-30 02:53:29,595 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-30 02:53:29,595 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:53:29,596 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:53:29,596 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 02:53:29,601 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:53:29,620 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:53:29,620 INFO L85 PathProgramCache]: Analyzing trace with hash 573, now seen corresponding path program 1 times [2023-08-30 02:53:29,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:53:29,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034882062] [2023-08-30 02:53:29,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:53:29,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:53:29,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:53:29,765 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:53:29,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:53:29,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034882062] [2023-08-30 02:53:29,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034882062] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:53:29,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:53:29,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 02:53:29,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563660107] [2023-08-30 02:53:29,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:53:29,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 02:53:29,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:53:29,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 02:53:29,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 02:53:29,795 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 272 [2023-08-30 02:53:29,797 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 88 flow. Second operand has 2 states, 2 states have (on average 131.5) internal successors, (263), 2 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:53:29,797 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:53:29,797 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 272 [2023-08-30 02:53:29,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:53:30,298 INFO L130 PetriNetUnfolder]: 4373/6097 cut-off events. [2023-08-30 02:53:30,299 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2023-08-30 02:53:30,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12183 conditions, 6097 events. 4373/6097 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 30942 event pairs, 4373 based on Foata normal form. 0/5373 useless extension candidates. Maximal degree in co-relation 12171. Up to 5983 conditions per place. [2023-08-30 02:53:30,328 INFO L137 encePairwiseOnDemand]: 263/272 looper letters, 26 selfloop transitions, 0 changer transitions 0/29 dead transitions. [2023-08-30 02:53:30,328 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 29 transitions, 122 flow [2023-08-30 02:53:30,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 02:53:30,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 02:53:30,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 297 transitions. [2023-08-30 02:53:30,343 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5459558823529411 [2023-08-30 02:53:30,344 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 297 transitions. [2023-08-30 02:53:30,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 297 transitions. [2023-08-30 02:53:30,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:53:30,348 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 297 transitions. [2023-08-30 02:53:30,350 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 148.5) internal successors, (297), 2 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:53:30,354 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 272.0) internal successors, (816), 3 states have internal predecessors, (816), 0 states have call successors, (0), 0 states 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:53:30,354 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 272.0) internal successors, (816), 3 states have internal predecessors, (816), 0 states have call successors, (0), 0 states 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:53:30,356 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 88 flow. Second operand 2 states and 297 transitions. [2023-08-30 02:53:30,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 29 transitions, 122 flow [2023-08-30 02:53:30,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 29 transitions, 118 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 02:53:30,360 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 66 flow [2023-08-30 02:53:30,362 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=66, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2023-08-30 02:53:30,364 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -11 predicate places. [2023-08-30 02:53:30,364 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 66 flow [2023-08-30 02:53:30,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 131.5) internal successors, (263), 2 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:53:30,365 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:53:30,365 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:53:30,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 02:53:30,365 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:53:30,366 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:53:30,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1315010726, now seen corresponding path program 1 times [2023-08-30 02:53:30,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:53:30,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032227762] [2023-08-30 02:53:30,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:53:30,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:53:30,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:53:30,683 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:53:30,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:53:30,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032227762] [2023-08-30 02:53:30,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032227762] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:53:30,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:53:30,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:53:30,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509863272] [2023-08-30 02:53:30,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:53:30,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:53:30,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:53:30,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:53:30,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:53:30,688 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 272 [2023-08-30 02:53:30,689 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:53:30,689 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:53:30,689 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 272 [2023-08-30 02:53:30,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:53:31,360 INFO L130 PetriNetUnfolder]: 3632/5248 cut-off events. [2023-08-30 02:53:31,360 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:53:31,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10338 conditions, 5248 events. 3632/5248 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 28109 event pairs, 668 based on Foata normal form. 0/4884 useless extension candidates. Maximal degree in co-relation 10335. Up to 3973 conditions per place. [2023-08-30 02:53:31,376 INFO L137 encePairwiseOnDemand]: 269/272 looper letters, 34 selfloop transitions, 2 changer transitions 2/41 dead transitions. [2023-08-30 02:53:31,376 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 41 transitions, 166 flow [2023-08-30 02:53:31,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:53:31,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:53:31,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 429 transitions. [2023-08-30 02:53:31,379 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5257352941176471 [2023-08-30 02:53:31,379 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 429 transitions. [2023-08-30 02:53:31,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 429 transitions. [2023-08-30 02:53:31,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:53:31,379 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 429 transitions. [2023-08-30 02:53:31,381 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 0 states 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:53:31,384 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 272.0) internal successors, (1088), 4 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states 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:53:31,385 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 272.0) internal successors, (1088), 4 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states 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:53:31,385 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 66 flow. Second operand 3 states and 429 transitions. [2023-08-30 02:53:31,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 41 transitions, 166 flow [2023-08-30 02:53:31,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 41 transitions, 166 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 02:53:31,386 INFO L231 Difference]: Finished difference. Result has 40 places, 27 transitions, 66 flow [2023-08-30 02:53:31,387 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2023-08-30 02:53:31,387 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -10 predicate places. [2023-08-30 02:53:31,387 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 66 flow [2023-08-30 02:53:31,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:53:31,388 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:53:31,388 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:53:31,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 02:53:31,389 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:53:31,391 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:53:31,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1085690766, now seen corresponding path program 1 times [2023-08-30 02:53:31,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:53:31,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208679529] [2023-08-30 02:53:31,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:53:31,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:53:31,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:53:32,003 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:53:32,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:53:32,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208679529] [2023-08-30 02:53:32,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208679529] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:53:32,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:53:32,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:53:32,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088090700] [2023-08-30 02:53:32,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:53:32,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:53:32,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:53:32,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:53:32,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:53:32,223 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 272 [2023-08-30 02:53:32,224 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 66 flow. Second operand has 7 states, 7 states have (on average 114.71428571428571) internal successors, (803), 7 states have internal predecessors, (803), 0 states have call successors, (0), 0 states 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:53:32,224 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:53:32,224 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 272 [2023-08-30 02:53:32,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:53:32,595 INFO L130 PetriNetUnfolder]: 2594/3775 cut-off events. [2023-08-30 02:53:32,600 INFO L131 PetriNetUnfolder]: For 144/144 co-relation queries the response was YES. [2023-08-30 02:53:32,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7649 conditions, 3775 events. 2594/3775 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 19241 event pairs, 156 based on Foata normal form. 0/3775 useless extension candidates. Maximal degree in co-relation 7645. Up to 2097 conditions per place. [2023-08-30 02:53:32,632 INFO L137 encePairwiseOnDemand]: 266/272 looper letters, 42 selfloop transitions, 5 changer transitions 0/50 dead transitions. [2023-08-30 02:53:32,648 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 50 transitions, 206 flow [2023-08-30 02:53:32,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:53:32,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:53:32,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 840 transitions. [2023-08-30 02:53:32,651 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4411764705882353 [2023-08-30 02:53:32,651 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 840 transitions. [2023-08-30 02:53:32,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 840 transitions. [2023-08-30 02:53:32,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:53:32,652 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 840 transitions. [2023-08-30 02:53:32,653 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 120.0) internal successors, (840), 7 states have internal predecessors, (840), 0 states have call successors, (0), 0 states 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:53:32,656 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states 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:53:32,657 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states 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:53:32,657 INFO L175 Difference]: Start difference. First operand has 40 places, 27 transitions, 66 flow. Second operand 7 states and 840 transitions. [2023-08-30 02:53:32,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 50 transitions, 206 flow [2023-08-30 02:53:32,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 50 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:53:32,660 INFO L231 Difference]: Finished difference. Result has 42 places, 26 transitions, 70 flow [2023-08-30 02:53:32,660 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=70, PETRI_PLACES=42, PETRI_TRANSITIONS=26} [2023-08-30 02:53:32,661 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -8 predicate places. [2023-08-30 02:53:32,661 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 26 transitions, 70 flow [2023-08-30 02:53:32,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.71428571428571) internal successors, (803), 7 states have internal predecessors, (803), 0 states have call successors, (0), 0 states 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:53:32,661 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:53:32,662 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:53:32,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 02:53:32,662 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:53:32,662 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:53:32,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1085690848, now seen corresponding path program 1 times [2023-08-30 02:53:32,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:53:32,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174646231] [2023-08-30 02:53:32,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:53:32,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:53:32,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:53:32,834 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:53:32,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:53:32,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174646231] [2023-08-30 02:53:32,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174646231] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:53:32,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:53:32,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:53:32,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297888575] [2023-08-30 02:53:32,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:53:32,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:53:32,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:53:32,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:53:32,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:53:32,874 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 272 [2023-08-30 02:53:32,875 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 26 transitions, 70 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:53:32,875 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:53:32,875 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 272 [2023-08-30 02:53:32,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:53:33,518 INFO L130 PetriNetUnfolder]: 6567/9008 cut-off events. [2023-08-30 02:53:33,518 INFO L131 PetriNetUnfolder]: For 429/429 co-relation queries the response was YES. [2023-08-30 02:53:33,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18643 conditions, 9008 events. 6567/9008 cut-off events. For 429/429 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 41347 event pairs, 2759 based on Foata normal form. 384/9392 useless extension candidates. Maximal degree in co-relation 18639. Up to 7617 conditions per place. [2023-08-30 02:53:33,543 INFO L137 encePairwiseOnDemand]: 265/272 looper letters, 37 selfloop transitions, 5 changer transitions 23/65 dead transitions. [2023-08-30 02:53:33,543 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 65 transitions, 296 flow [2023-08-30 02:53:33,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:53:33,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:53:33,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 657 transitions. [2023-08-30 02:53:33,545 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48308823529411765 [2023-08-30 02:53:33,545 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 657 transitions. [2023-08-30 02:53:33,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 657 transitions. [2023-08-30 02:53:33,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:53:33,545 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 657 transitions. [2023-08-30 02:53:33,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 131.4) internal successors, (657), 5 states have internal predecessors, (657), 0 states have call successors, (0), 0 states 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:53:33,548 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 272.0) internal successors, (1632), 6 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states 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:53:33,549 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 272.0) internal successors, (1632), 6 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states 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:53:33,549 INFO L175 Difference]: Start difference. First operand has 42 places, 26 transitions, 70 flow. Second operand 5 states and 657 transitions. [2023-08-30 02:53:33,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 65 transitions, 296 flow [2023-08-30 02:53:33,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 65 transitions, 278 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-30 02:53:33,551 INFO L231 Difference]: Finished difference. Result has 44 places, 30 transitions, 107 flow [2023-08-30 02:53:33,551 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=107, PETRI_PLACES=44, PETRI_TRANSITIONS=30} [2023-08-30 02:53:33,552 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -6 predicate places. [2023-08-30 02:53:33,552 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 30 transitions, 107 flow [2023-08-30 02:53:33,552 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:53:33,552 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:53:33,552 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:53:33,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 02:53:33,553 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:53:33,553 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:53:33,553 INFO L85 PathProgramCache]: Analyzing trace with hash -558867073, now seen corresponding path program 1 times [2023-08-30 02:53:33,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:53:33,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563949796] [2023-08-30 02:53:33,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:53:33,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:53:33,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:53:33,663 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:53:33,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:53:33,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563949796] [2023-08-30 02:53:33,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563949796] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:53:33,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:53:33,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:53:33,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547017552] [2023-08-30 02:53:33,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:53:33,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:53:33,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:53:33,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:53:33,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:53:33,672 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 272 [2023-08-30 02:53:33,673 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 30 transitions, 107 flow. Second operand has 4 states, 4 states have (on average 128.25) internal successors, (513), 4 states have internal predecessors, (513), 0 states have call successors, (0), 0 states 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:53:33,673 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:53:33,673 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 272 [2023-08-30 02:53:33,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:53:34,074 INFO L130 PetriNetUnfolder]: 4025/5911 cut-off events. [2023-08-30 02:53:34,074 INFO L131 PetriNetUnfolder]: For 2543/2665 co-relation queries the response was YES. [2023-08-30 02:53:34,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14449 conditions, 5911 events. 4025/5911 cut-off events. For 2543/2665 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 30998 event pairs, 1263 based on Foata normal form. 280/6059 useless extension candidates. Maximal degree in co-relation 14442. Up to 3211 conditions per place. [2023-08-30 02:53:34,111 INFO L137 encePairwiseOnDemand]: 268/272 looper letters, 31 selfloop transitions, 3 changer transitions 19/58 dead transitions. [2023-08-30 02:53:34,116 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 58 transitions, 288 flow [2023-08-30 02:53:34,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:53:34,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:53:34,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 678 transitions. [2023-08-30 02:53:34,117 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4985294117647059 [2023-08-30 02:53:34,117 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 678 transitions. [2023-08-30 02:53:34,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 678 transitions. [2023-08-30 02:53:34,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:53:34,118 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 678 transitions. [2023-08-30 02:53:34,120 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.6) internal successors, (678), 5 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:53:34,134 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 272.0) internal successors, (1632), 6 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states 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:53:34,135 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 272.0) internal successors, (1632), 6 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states 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:53:34,135 INFO L175 Difference]: Start difference. First operand has 44 places, 30 transitions, 107 flow. Second operand 5 states and 678 transitions. [2023-08-30 02:53:34,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 58 transitions, 288 flow [2023-08-30 02:53:34,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 58 transitions, 281 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 02:53:34,166 INFO L231 Difference]: Finished difference. Result has 47 places, 30 transitions, 115 flow [2023-08-30 02:53:34,166 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=115, PETRI_PLACES=47, PETRI_TRANSITIONS=30} [2023-08-30 02:53:34,167 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -3 predicate places. [2023-08-30 02:53:34,167 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 30 transitions, 115 flow [2023-08-30 02:53:34,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 128.25) internal successors, (513), 4 states have internal predecessors, (513), 0 states have call successors, (0), 0 states 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:53:34,167 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:53:34,168 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:53:34,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 02:53:34,168 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:53:34,168 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:53:34,168 INFO L85 PathProgramCache]: Analyzing trace with hash 264753207, now seen corresponding path program 1 times [2023-08-30 02:53:34,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:53:34,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594112174] [2023-08-30 02:53:34,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:53:34,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:53:34,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:53:34,358 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:53:34,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:53:34,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594112174] [2023-08-30 02:53:34,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594112174] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:53:34,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:53:34,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:53:34,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805449610] [2023-08-30 02:53:34,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:53:34,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:53:34,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:53:34,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:53:34,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:53:34,368 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 272 [2023-08-30 02:53:34,368 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 30 transitions, 115 flow. Second operand has 4 states, 4 states have (on average 128.5) internal successors, (514), 4 states have internal predecessors, (514), 0 states have call successors, (0), 0 states 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:53:34,368 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:53:34,368 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 272 [2023-08-30 02:53:34,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:53:34,798 INFO L130 PetriNetUnfolder]: 2995/4441 cut-off events. [2023-08-30 02:53:34,799 INFO L131 PetriNetUnfolder]: For 3053/3183 co-relation queries the response was YES. [2023-08-30 02:53:34,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11612 conditions, 4441 events. 2995/4441 cut-off events. For 3053/3183 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 23159 event pairs, 614 based on Foata normal form. 296/4630 useless extension candidates. Maximal degree in co-relation 11603. Up to 3038 conditions per place. [2023-08-30 02:53:34,830 INFO L137 encePairwiseOnDemand]: 265/272 looper letters, 56 selfloop transitions, 9 changer transitions 2/72 dead transitions. [2023-08-30 02:53:34,830 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 72 transitions, 383 flow [2023-08-30 02:53:34,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:53:34,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:53:34,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 690 transitions. [2023-08-30 02:53:34,832 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5073529411764706 [2023-08-30 02:53:34,832 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 690 transitions. [2023-08-30 02:53:34,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 690 transitions. [2023-08-30 02:53:34,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:53:34,833 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 690 transitions. [2023-08-30 02:53:34,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.0) internal successors, (690), 5 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:53:34,836 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 272.0) internal successors, (1632), 6 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states 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:53:34,836 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 272.0) internal successors, (1632), 6 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states 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:53:34,836 INFO L175 Difference]: Start difference. First operand has 47 places, 30 transitions, 115 flow. Second operand 5 states and 690 transitions. [2023-08-30 02:53:34,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 72 transitions, 383 flow [2023-08-30 02:53:34,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 72 transitions, 365 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-30 02:53:34,844 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 174 flow [2023-08-30 02:53:34,844 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=174, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2023-08-30 02:53:34,847 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -2 predicate places. [2023-08-30 02:53:34,848 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 174 flow [2023-08-30 02:53:34,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 128.5) internal successors, (514), 4 states have internal predecessors, (514), 0 states have call successors, (0), 0 states 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:53:34,849 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:53:34,849 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:53:34,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 02:53:34,849 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:53:34,850 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:53:34,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1220523580, now seen corresponding path program 1 times [2023-08-30 02:53:34,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:53:34,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695820879] [2023-08-30 02:53:34,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:53:34,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:53:34,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:53:35,053 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:53:35,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:53:35,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695820879] [2023-08-30 02:53:35,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695820879] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:53:35,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:53:35,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:53:35,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056868333] [2023-08-30 02:53:35,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:53:35,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:53:35,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:53:35,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:53:35,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:53:35,066 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 272 [2023-08-30 02:53:35,067 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 174 flow. Second operand has 5 states, 5 states have (on average 128.2) internal successors, (641), 5 states have internal predecessors, (641), 0 states have call successors, (0), 0 states 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:53:35,067 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:53:35,067 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 272 [2023-08-30 02:53:35,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:53:35,487 INFO L130 PetriNetUnfolder]: 2121/3316 cut-off events. [2023-08-30 02:53:35,487 INFO L131 PetriNetUnfolder]: For 2989/3108 co-relation queries the response was YES. [2023-08-30 02:53:35,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10859 conditions, 3316 events. 2121/3316 cut-off events. For 2989/3108 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 17743 event pairs, 256 based on Foata normal form. 221/3455 useless extension candidates. Maximal degree in co-relation 10849. Up to 1218 conditions per place. [2023-08-30 02:53:35,501 INFO L137 encePairwiseOnDemand]: 265/272 looper letters, 74 selfloop transitions, 17 changer transitions 2/98 dead transitions. [2023-08-30 02:53:35,502 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 98 transitions, 596 flow [2023-08-30 02:53:35,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:53:35,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:53:35,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 966 transitions. [2023-08-30 02:53:35,504 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5073529411764706 [2023-08-30 02:53:35,504 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 966 transitions. [2023-08-30 02:53:35,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 966 transitions. [2023-08-30 02:53:35,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:53:35,505 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 966 transitions. [2023-08-30 02:53:35,506 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 138.0) internal successors, (966), 7 states have internal predecessors, (966), 0 states have call successors, (0), 0 states 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:53:35,508 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states 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:53:35,510 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states 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:53:35,510 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 174 flow. Second operand 7 states and 966 transitions. [2023-08-30 02:53:35,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 98 transitions, 596 flow [2023-08-30 02:53:35,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 98 transitions, 591 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:53:35,516 INFO L231 Difference]: Finished difference. Result has 56 places, 46 transitions, 290 flow [2023-08-30 02:53:35,516 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=290, PETRI_PLACES=56, PETRI_TRANSITIONS=46} [2023-08-30 02:53:35,517 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 6 predicate places. [2023-08-30 02:53:35,517 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 46 transitions, 290 flow [2023-08-30 02:53:35,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 128.2) internal successors, (641), 5 states have internal predecessors, (641), 0 states have call successors, (0), 0 states 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:53:35,517 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:53:35,517 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:53:35,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 02:53:35,518 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:53:35,518 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:53:35,518 INFO L85 PathProgramCache]: Analyzing trace with hash -2070491185, now seen corresponding path program 1 times [2023-08-30 02:53:35,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:53:35,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29285800] [2023-08-30 02:53:35,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:53:35,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:53:35,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:53:35,698 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:53:35,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:53:35,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29285800] [2023-08-30 02:53:35,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29285800] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:53:35,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:53:35,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:53:35,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769232173] [2023-08-30 02:53:35,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:53:35,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:53:35,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:53:35,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:53:35,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:53:35,720 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 272 [2023-08-30 02:53:35,721 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 46 transitions, 290 flow. Second operand has 6 states, 6 states have (on average 119.33333333333333) internal successors, (716), 6 states have internal predecessors, (716), 0 states have call successors, (0), 0 states 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:53:35,721 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:53:35,723 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 272 [2023-08-30 02:53:35,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:53:36,242 INFO L130 PetriNetUnfolder]: 3904/5896 cut-off events. [2023-08-30 02:53:36,242 INFO L131 PetriNetUnfolder]: For 13554/13554 co-relation queries the response was YES. [2023-08-30 02:53:36,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22945 conditions, 5896 events. 3904/5896 cut-off events. For 13554/13554 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 31288 event pairs, 502 based on Foata normal form. 39/5935 useless extension candidates. Maximal degree in co-relation 22932. Up to 3265 conditions per place. [2023-08-30 02:53:36,271 INFO L137 encePairwiseOnDemand]: 264/272 looper letters, 82 selfloop transitions, 10 changer transitions 51/143 dead transitions. [2023-08-30 02:53:36,271 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 143 transitions, 1151 flow [2023-08-30 02:53:36,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:53:36,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:53:36,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 912 transitions. [2023-08-30 02:53:36,273 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4789915966386555 [2023-08-30 02:53:36,273 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 912 transitions. [2023-08-30 02:53:36,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 912 transitions. [2023-08-30 02:53:36,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:53:36,274 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 912 transitions. [2023-08-30 02:53:36,276 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 130.28571428571428) internal successors, (912), 7 states have internal predecessors, (912), 0 states have call successors, (0), 0 states 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:53:36,278 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states 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:53:36,278 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states 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:53:36,278 INFO L175 Difference]: Start difference. First operand has 56 places, 46 transitions, 290 flow. Second operand 7 states and 912 transitions. [2023-08-30 02:53:36,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 143 transitions, 1151 flow [2023-08-30 02:53:36,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 143 transitions, 1027 flow, removed 41 selfloop flow, removed 3 redundant places. [2023-08-30 02:53:36,337 INFO L231 Difference]: Finished difference. Result has 62 places, 42 transitions, 241 flow [2023-08-30 02:53:36,337 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=241, PETRI_PLACES=62, PETRI_TRANSITIONS=42} [2023-08-30 02:53:36,339 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 12 predicate places. [2023-08-30 02:53:36,339 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 42 transitions, 241 flow [2023-08-30 02:53:36,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.33333333333333) internal successors, (716), 6 states have internal predecessors, (716), 0 states have call successors, (0), 0 states 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:53:36,339 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:53:36,339 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:53:36,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 02:53:36,340 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:53:36,346 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:53:36,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1287139509, now seen corresponding path program 2 times [2023-08-30 02:53:36,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:53:36,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216819354] [2023-08-30 02:53:36,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:53:36,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:53:36,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:53:36,499 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:53:36,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:53:36,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216819354] [2023-08-30 02:53:36,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216819354] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:53:36,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:53:36,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:53:36,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932382947] [2023-08-30 02:53:36,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:53:36,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:53:36,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:53:36,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:53:36,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:53:36,515 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 272 [2023-08-30 02:53:36,516 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 42 transitions, 241 flow. Second operand has 6 states, 6 states have (on average 128.0) internal successors, (768), 6 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:53:36,516 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:53:36,516 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 272 [2023-08-30 02:53:36,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:53:36,775 INFO L130 PetriNetUnfolder]: 1251/2045 cut-off events. [2023-08-30 02:53:36,775 INFO L131 PetriNetUnfolder]: For 3997/4173 co-relation queries the response was YES. [2023-08-30 02:53:36,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7379 conditions, 2045 events. 1251/2045 cut-off events. For 3997/4173 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 10674 event pairs, 195 based on Foata normal form. 188/2172 useless extension candidates. Maximal degree in co-relation 7363. Up to 646 conditions per place. [2023-08-30 02:53:36,785 INFO L137 encePairwiseOnDemand]: 265/272 looper letters, 66 selfloop transitions, 15 changer transitions 15/102 dead transitions. [2023-08-30 02:53:36,785 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 102 transitions, 730 flow [2023-08-30 02:53:36,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:53:36,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:53:36,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 968 transitions. [2023-08-30 02:53:36,787 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5084033613445378 [2023-08-30 02:53:36,787 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 968 transitions. [2023-08-30 02:53:36,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 968 transitions. [2023-08-30 02:53:36,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:53:36,788 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 968 transitions. [2023-08-30 02:53:36,789 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 138.28571428571428) internal successors, (968), 7 states have internal predecessors, (968), 0 states have call successors, (0), 0 states 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:53:36,791 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states 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:53:36,793 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states 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:53:36,793 INFO L175 Difference]: Start difference. First operand has 62 places, 42 transitions, 241 flow. Second operand 7 states and 968 transitions. [2023-08-30 02:53:36,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 102 transitions, 730 flow [2023-08-30 02:53:36,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 102 transitions, 683 flow, removed 20 selfloop flow, removed 5 redundant places. [2023-08-30 02:53:36,800 INFO L231 Difference]: Finished difference. Result has 61 places, 48 transitions, 326 flow [2023-08-30 02:53:36,800 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=326, PETRI_PLACES=61, PETRI_TRANSITIONS=48} [2023-08-30 02:53:36,801 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 11 predicate places. [2023-08-30 02:53:36,801 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 48 transitions, 326 flow [2023-08-30 02:53:36,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 128.0) internal successors, (768), 6 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:53:36,802 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:53:36,802 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:53:36,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 02:53:36,802 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:53:36,802 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:53:36,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1928409831, now seen corresponding path program 1 times [2023-08-30 02:53:36,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:53:36,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93484984] [2023-08-30 02:53:36,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:53:36,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:53:36,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:53:36,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:53:36,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:53:36,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93484984] [2023-08-30 02:53:36,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93484984] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:53:36,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:53:36,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:53:36,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288206248] [2023-08-30 02:53:36,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:53:36,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:53:36,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:53:36,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:53:36,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:53:36,984 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 272 [2023-08-30 02:53:36,984 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 48 transitions, 326 flow. Second operand has 5 states, 5 states have (on average 120.6) internal successors, (603), 5 states have internal predecessors, (603), 0 states have call successors, (0), 0 states 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:53:36,984 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:53:36,985 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 272 [2023-08-30 02:53:36,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:53:37,327 INFO L130 PetriNetUnfolder]: 2278/3653 cut-off events. [2023-08-30 02:53:37,327 INFO L131 PetriNetUnfolder]: For 9061/9061 co-relation queries the response was YES. [2023-08-30 02:53:37,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14766 conditions, 3653 events. 2278/3653 cut-off events. For 9061/9061 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 19344 event pairs, 160 based on Foata normal form. 16/3669 useless extension candidates. Maximal degree in co-relation 14750. Up to 2169 conditions per place. [2023-08-30 02:53:37,347 INFO L137 encePairwiseOnDemand]: 263/272 looper letters, 91 selfloop transitions, 16 changer transitions 25/132 dead transitions. [2023-08-30 02:53:37,348 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 132 transitions, 1165 flow [2023-08-30 02:53:37,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:53:37,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:53:37,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 902 transitions. [2023-08-30 02:53:37,350 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4737394957983193 [2023-08-30 02:53:37,351 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 902 transitions. [2023-08-30 02:53:37,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 902 transitions. [2023-08-30 02:53:37,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:53:37,351 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 902 transitions. [2023-08-30 02:53:37,353 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 128.85714285714286) internal successors, (902), 7 states have internal predecessors, (902), 0 states have call successors, (0), 0 states 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:53:37,356 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states 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:53:37,356 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states 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:53:37,356 INFO L175 Difference]: Start difference. First operand has 61 places, 48 transitions, 326 flow. Second operand 7 states and 902 transitions. [2023-08-30 02:53:37,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 132 transitions, 1165 flow [2023-08-30 02:53:37,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 132 transitions, 1035 flow, removed 48 selfloop flow, removed 2 redundant places. [2023-08-30 02:53:37,395 INFO L231 Difference]: Finished difference. Result has 70 places, 55 transitions, 399 flow [2023-08-30 02:53:37,395 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=399, PETRI_PLACES=70, PETRI_TRANSITIONS=55} [2023-08-30 02:53:37,396 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 20 predicate places. [2023-08-30 02:53:37,396 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 55 transitions, 399 flow [2023-08-30 02:53:37,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 120.6) internal successors, (603), 5 states have internal predecessors, (603), 0 states have call successors, (0), 0 states 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:53:37,396 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:53:37,397 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:53:37,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 02:53:37,397 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:53:37,397 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:53:37,397 INFO L85 PathProgramCache]: Analyzing trace with hash 388900549, now seen corresponding path program 2 times [2023-08-30 02:53:37,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:53:37,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234286701] [2023-08-30 02:53:37,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:53:37,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:53:37,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:53:37,607 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:53:37,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:53:37,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234286701] [2023-08-30 02:53:37,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234286701] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:53:37,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:53:37,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 02:53:37,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670351198] [2023-08-30 02:53:37,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:53:37,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:53:37,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:53:37,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:53:37,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:53:37,631 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 272 [2023-08-30 02:53:37,632 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 55 transitions, 399 flow. Second operand has 7 states, 7 states have (on average 128.0) internal successors, (896), 7 states have internal predecessors, (896), 0 states have call successors, (0), 0 states 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:53:37,632 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:53:37,632 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 272 [2023-08-30 02:53:37,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:53:37,934 INFO L130 PetriNetUnfolder]: 1405/2291 cut-off events. [2023-08-30 02:53:37,935 INFO L131 PetriNetUnfolder]: For 6042/6516 co-relation queries the response was YES. [2023-08-30 02:53:37,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9111 conditions, 2291 events. 1405/2291 cut-off events. For 6042/6516 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 12519 event pairs, 191 based on Foata normal form. 197/2411 useless extension candidates. Maximal degree in co-relation 9089. Up to 810 conditions per place. [2023-08-30 02:53:37,945 INFO L137 encePairwiseOnDemand]: 265/272 looper letters, 61 selfloop transitions, 18 changer transitions 22/108 dead transitions. [2023-08-30 02:53:37,946 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 108 transitions, 917 flow [2023-08-30 02:53:37,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 02:53:37,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 02:53:37,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1082 transitions. [2023-08-30 02:53:37,948 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49724264705882354 [2023-08-30 02:53:37,948 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1082 transitions. [2023-08-30 02:53:37,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1082 transitions. [2023-08-30 02:53:37,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:53:37,949 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1082 transitions. [2023-08-30 02:53:37,950 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 135.25) internal successors, (1082), 8 states have internal predecessors, (1082), 0 states have call successors, (0), 0 states 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:53:37,953 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 272.0) internal successors, (2448), 9 states have internal predecessors, (2448), 0 states have call successors, (0), 0 states 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:53:37,953 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 272.0) internal successors, (2448), 9 states have internal predecessors, (2448), 0 states have call successors, (0), 0 states 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:53:37,954 INFO L175 Difference]: Start difference. First operand has 70 places, 55 transitions, 399 flow. Second operand 8 states and 1082 transitions. [2023-08-30 02:53:37,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 108 transitions, 917 flow [2023-08-30 02:53:37,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 108 transitions, 840 flow, removed 31 selfloop flow, removed 4 redundant places. [2023-08-30 02:53:37,980 INFO L231 Difference]: Finished difference. Result has 72 places, 49 transitions, 354 flow [2023-08-30 02:53:37,980 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=354, PETRI_PLACES=72, PETRI_TRANSITIONS=49} [2023-08-30 02:53:37,980 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 22 predicate places. [2023-08-30 02:53:37,980 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 49 transitions, 354 flow [2023-08-30 02:53:37,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 128.0) internal successors, (896), 7 states have internal predecessors, (896), 0 states have call successors, (0), 0 states 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:53:37,981 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:53:37,981 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] [2023-08-30 02:53:37,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 02:53:37,981 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:53:37,982 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:53:37,982 INFO L85 PathProgramCache]: Analyzing trace with hash -2023308035, now seen corresponding path program 1 times [2023-08-30 02:53:37,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:53:37,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202479941] [2023-08-30 02:53:37,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:53:37,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:53:38,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:53:38,324 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:53:38,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:53:38,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202479941] [2023-08-30 02:53:38,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202479941] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:53:38,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:53:38,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 02:53:38,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128762463] [2023-08-30 02:53:38,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:53:38,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 02:53:38,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:53:38,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 02:53:38,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-30 02:53:38,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 272 [2023-08-30 02:53:38,367 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 49 transitions, 354 flow. Second operand has 8 states, 8 states have (on average 124.0) internal successors, (992), 8 states have internal predecessors, (992), 0 states have call successors, (0), 0 states 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:53:38,368 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:53:38,368 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 272 [2023-08-30 02:53:38,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:53:38,723 INFO L130 PetriNetUnfolder]: 1487/2479 cut-off events. [2023-08-30 02:53:38,723 INFO L131 PetriNetUnfolder]: For 8304/8385 co-relation queries the response was YES. [2023-08-30 02:53:38,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10650 conditions, 2479 events. 1487/2479 cut-off events. For 8304/8385 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 13662 event pairs, 186 based on Foata normal form. 10/2466 useless extension candidates. Maximal degree in co-relation 10628. Up to 727 conditions per place. [2023-08-30 02:53:38,734 INFO L137 encePairwiseOnDemand]: 265/272 looper letters, 40 selfloop transitions, 3 changer transitions 119/165 dead transitions. [2023-08-30 02:53:38,734 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 165 transitions, 1549 flow [2023-08-30 02:53:38,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 02:53:38,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 02:53:38,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1172 transitions. [2023-08-30 02:53:38,738 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47875816993464054 [2023-08-30 02:53:38,738 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1172 transitions. [2023-08-30 02:53:38,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1172 transitions. [2023-08-30 02:53:38,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:53:38,738 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1172 transitions. [2023-08-30 02:53:38,741 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 130.22222222222223) internal successors, (1172), 9 states have internal predecessors, (1172), 0 states have call successors, (0), 0 states 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:53:38,743 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 272.0) internal successors, (2720), 10 states have internal predecessors, (2720), 0 states have call successors, (0), 0 states 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:53:38,744 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 272.0) internal successors, (2720), 10 states have internal predecessors, (2720), 0 states have call successors, (0), 0 states 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:53:38,744 INFO L175 Difference]: Start difference. First operand has 72 places, 49 transitions, 354 flow. Second operand 9 states and 1172 transitions. [2023-08-30 02:53:38,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 165 transitions, 1549 flow [2023-08-30 02:53:38,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 165 transitions, 1262 flow, removed 69 selfloop flow, removed 11 redundant places. [2023-08-30 02:53:38,771 INFO L231 Difference]: Finished difference. Result has 71 places, 42 transitions, 233 flow [2023-08-30 02:53:38,771 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=233, PETRI_PLACES=71, PETRI_TRANSITIONS=42} [2023-08-30 02:53:38,772 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 21 predicate places. [2023-08-30 02:53:38,772 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 42 transitions, 233 flow [2023-08-30 02:53:38,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 124.0) internal successors, (992), 8 states have internal predecessors, (992), 0 states have call successors, (0), 0 states 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:53:38,773 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:53:38,773 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] [2023-08-30 02:53:38,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 02:53:38,773 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:53:38,773 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:53:38,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1987068821, now seen corresponding path program 2 times [2023-08-30 02:53:38,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:53:38,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067436543] [2023-08-30 02:53:38,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:53:38,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:53:38,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:53:38,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:53:38,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:53:38,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067436543] [2023-08-30 02:53:38,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067436543] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:53:38,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:53:38,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:53:38,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208494975] [2023-08-30 02:53:38,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:53:38,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:53:38,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:53:38,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:53:38,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:53:38,937 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 272 [2023-08-30 02:53:38,938 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 42 transitions, 233 flow. Second operand has 5 states, 5 states have (on average 127.8) internal successors, (639), 5 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:53:38,938 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:53:38,938 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 272 [2023-08-30 02:53:38,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:53:39,103 INFO L130 PetriNetUnfolder]: 579/1004 cut-off events. [2023-08-30 02:53:39,103 INFO L131 PetriNetUnfolder]: For 2115/2115 co-relation queries the response was YES. [2023-08-30 02:53:39,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3765 conditions, 1004 events. 579/1004 cut-off events. For 2115/2115 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 4963 event pairs, 163 based on Foata normal form. 1/977 useless extension candidates. Maximal degree in co-relation 3745. Up to 483 conditions per place. [2023-08-30 02:53:39,107 INFO L137 encePairwiseOnDemand]: 268/272 looper letters, 45 selfloop transitions, 1 changer transitions 30/78 dead transitions. [2023-08-30 02:53:39,107 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 78 transitions, 580 flow [2023-08-30 02:53:39,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:53:39,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:53:39,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 661 transitions. [2023-08-30 02:53:39,109 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4860294117647059 [2023-08-30 02:53:39,109 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 661 transitions. [2023-08-30 02:53:39,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 661 transitions. [2023-08-30 02:53:39,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:53:39,109 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 661 transitions. [2023-08-30 02:53:39,110 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.2) internal successors, (661), 5 states have internal predecessors, (661), 0 states have call successors, (0), 0 states 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:53:39,112 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 272.0) internal successors, (1632), 6 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states 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:53:39,112 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 272.0) internal successors, (1632), 6 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states 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:53:39,113 INFO L175 Difference]: Start difference. First operand has 71 places, 42 transitions, 233 flow. Second operand 5 states and 661 transitions. [2023-08-30 02:53:39,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 78 transitions, 580 flow [2023-08-30 02:53:39,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 78 transitions, 556 flow, removed 9 selfloop flow, removed 7 redundant places. [2023-08-30 02:53:39,120 INFO L231 Difference]: Finished difference. Result has 64 places, 38 transitions, 194 flow [2023-08-30 02:53:39,120 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=194, PETRI_PLACES=64, PETRI_TRANSITIONS=38} [2023-08-30 02:53:39,121 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 14 predicate places. [2023-08-30 02:53:39,121 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 38 transitions, 194 flow [2023-08-30 02:53:39,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 127.8) internal successors, (639), 5 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:53:39,121 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:53:39,121 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] [2023-08-30 02:53:39,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 02:53:39,122 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:53:39,122 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:53:39,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1512970711, now seen corresponding path program 3 times [2023-08-30 02:53:39,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:53:39,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502182992] [2023-08-30 02:53:39,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:53:39,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:53:39,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:53:39,763 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:53:39,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:53:39,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502182992] [2023-08-30 02:53:39,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502182992] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:53:39,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:53:39,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 02:53:39,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422828413] [2023-08-30 02:53:39,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:53:39,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 02:53:39,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:53:39,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 02:53:39,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-08-30 02:53:39,826 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 272 [2023-08-30 02:53:39,827 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 38 transitions, 194 flow. Second operand has 8 states, 8 states have (on average 124.875) internal successors, (999), 8 states have internal predecessors, (999), 0 states have call successors, (0), 0 states 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:53:39,827 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:53:39,827 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 272 [2023-08-30 02:53:39,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:53:40,008 INFO L130 PetriNetUnfolder]: 388/691 cut-off events. [2023-08-30 02:53:40,009 INFO L131 PetriNetUnfolder]: For 1503/1505 co-relation queries the response was YES. [2023-08-30 02:53:40,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2484 conditions, 691 events. 388/691 cut-off events. For 1503/1505 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3338 event pairs, 87 based on Foata normal form. 1/651 useless extension candidates. Maximal degree in co-relation 2466. Up to 302 conditions per place. [2023-08-30 02:53:40,011 INFO L137 encePairwiseOnDemand]: 266/272 looper letters, 41 selfloop transitions, 3 changer transitions 25/72 dead transitions. [2023-08-30 02:53:40,012 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 72 transitions, 525 flow [2023-08-30 02:53:40,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:53:40,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:53:40,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 894 transitions. [2023-08-30 02:53:40,014 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4695378151260504 [2023-08-30 02:53:40,014 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 894 transitions. [2023-08-30 02:53:40,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 894 transitions. [2023-08-30 02:53:40,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:53:40,015 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 894 transitions. [2023-08-30 02:53:40,016 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 127.71428571428571) internal successors, (894), 7 states have internal predecessors, (894), 0 states have call successors, (0), 0 states 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:53:40,018 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states 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:53:40,019 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states 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:53:40,019 INFO L175 Difference]: Start difference. First operand has 64 places, 38 transitions, 194 flow. Second operand 7 states and 894 transitions. [2023-08-30 02:53:40,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 72 transitions, 525 flow [2023-08-30 02:53:40,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 72 transitions, 511 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-08-30 02:53:40,024 INFO L231 Difference]: Finished difference. Result has 66 places, 38 transitions, 198 flow [2023-08-30 02:53:40,024 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=198, PETRI_PLACES=66, PETRI_TRANSITIONS=38} [2023-08-30 02:53:40,025 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 16 predicate places. [2023-08-30 02:53:40,025 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 38 transitions, 198 flow [2023-08-30 02:53:40,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 124.875) internal successors, (999), 8 states have internal predecessors, (999), 0 states have call successors, (0), 0 states 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:53:40,026 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:53:40,026 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] [2023-08-30 02:53:40,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 02:53:40,027 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:53:40,027 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:53:40,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1482363257, now seen corresponding path program 4 times [2023-08-30 02:53:40,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:53:40,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472057530] [2023-08-30 02:53:40,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:53:40,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:53:40,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:53:40,063 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 02:53:40,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:53:40,139 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 02:53:40,139 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 02:53:40,140 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-30 02:53:40,142 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-30 02:53:40,142 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-30 02:53:40,142 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-30 02:53:40,142 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-30 02:53:40,142 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-30 02:53:40,142 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-30 02:53:40,143 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-30 02:53:40,143 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-30 02:53:40,143 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-30 02:53:40,143 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-30 02:53:40,143 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-30 02:53:40,143 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-30 02:53:40,143 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-30 02:53:40,144 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-30 02:53:40,144 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-30 02:53:40,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-30 02:53:40,144 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:53:40,149 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 02:53:40,150 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 02:53:40,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 02:53:40 BasicIcfg [2023-08-30 02:53:40,230 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 02:53:40,231 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 02:53:40,231 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 02:53:40,231 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 02:53:40,231 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:53:25" (3/4) ... [2023-08-30 02:53:40,234 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-30 02:53:40,234 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 02:53:40,234 INFO L158 Benchmark]: Toolchain (without parser) took 15824.95ms. Allocated memory was 88.1MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 64.4MB in the beginning and 1.0GB in the end (delta: -936.4MB). Peak memory consumption was 472.8MB. Max. memory is 16.1GB. [2023-08-30 02:53:40,234 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 88.1MB. Free memory is still 66.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:53:40,235 INFO L158 Benchmark]: CACSL2BoogieTranslator took 479.36ms. Allocated memory is still 88.1MB. Free memory was 64.1MB in the beginning and 41.0MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-08-30 02:53:40,235 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.06ms. Allocated memory is still 88.1MB. Free memory was 41.0MB in the beginning and 67.2MB in the end (delta: -26.2MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. [2023-08-30 02:53:40,235 INFO L158 Benchmark]: Boogie Preprocessor took 38.90ms. Allocated memory is still 88.1MB. Free memory was 67.2MB in the beginning and 65.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:53:40,236 INFO L158 Benchmark]: RCFGBuilder took 564.28ms. Allocated memory was 88.1MB in the beginning and 132.1MB in the end (delta: 44.0MB). Free memory was 65.2MB in the beginning and 104.1MB in the end (delta: -38.9MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2023-08-30 02:53:40,236 INFO L158 Benchmark]: TraceAbstraction took 14666.74ms. Allocated memory was 132.1MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 103.8MB in the beginning and 1.0GB in the end (delta: -897.0MB). Peak memory consumption was 466.2MB. Max. memory is 16.1GB. [2023-08-30 02:53:40,236 INFO L158 Benchmark]: Witness Printer took 3.07ms. Allocated memory is still 1.5GB. Free memory is still 1.0GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:53:40,237 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.15ms. Allocated memory is still 88.1MB. Free memory is still 66.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 479.36ms. Allocated memory is still 88.1MB. Free memory was 64.1MB in the beginning and 41.0MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.06ms. Allocated memory is still 88.1MB. Free memory was 41.0MB in the beginning and 67.2MB in the end (delta: -26.2MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.90ms. Allocated memory is still 88.1MB. Free memory was 67.2MB in the beginning and 65.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 564.28ms. Allocated memory was 88.1MB in the beginning and 132.1MB in the end (delta: 44.0MB). Free memory was 65.2MB in the beginning and 104.1MB in the end (delta: -38.9MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 14666.74ms. Allocated memory was 132.1MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 103.8MB in the beginning and 1.0GB in the end (delta: -897.0MB). Peak memory consumption was 466.2MB. Max. memory is 16.1GB. * Witness Printer took 3.07ms. Allocated memory is still 1.5GB. Free memory is still 1.0GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.8s, 150 PlacesBefore, 50 PlacesAfterwards, 139 TransitionsBefore, 38 TransitionsAfterwards, 3128 CoEnabledTransitionPairs, 7 FixpointIterations, 50 TrivialSequentialCompositions, 71 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 129 TotalNumberOfCompositions, 7350 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4280, independent: 4089, independent conditional: 0, independent unconditional: 4089, dependent: 191, dependent conditional: 0, dependent unconditional: 191, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1665, independent: 1637, independent conditional: 0, independent unconditional: 1637, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4280, independent: 2452, independent conditional: 0, independent unconditional: 2452, dependent: 163, dependent conditional: 0, dependent unconditional: 163, unknown: 1665, unknown conditional: 0, unknown unconditional: 1665] , Statistics on independence cache: Total cache size (in pairs): 186, Positive cache size: 173, Positive conditional cache size: 0, Positive unconditional cache size: 173, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L724] 0 int b = 0; [L725] 0 _Bool main$tmp_guard0; [L726] 0 _Bool main$tmp_guard1; [L728] 0 int x = 0; [L730] 0 int y = 0; [L732] 0 int z = 0; [L733] 0 _Bool z$flush_delayed; [L734] 0 int z$mem_tmp; [L735] 0 _Bool z$r_buff0_thd0; [L736] 0 _Bool z$r_buff0_thd1; [L737] 0 _Bool z$r_buff0_thd2; [L738] 0 _Bool z$r_buff0_thd3; [L739] 0 _Bool z$r_buff0_thd4; [L740] 0 _Bool z$r_buff1_thd0; [L741] 0 _Bool z$r_buff1_thd1; [L742] 0 _Bool z$r_buff1_thd2; [L743] 0 _Bool z$r_buff1_thd3; [L744] 0 _Bool z$r_buff1_thd4; [L745] 0 _Bool z$read_delayed; [L746] 0 int *z$read_delayed_var; [L747] 0 int z$w_buff0; [L748] 0 _Bool z$w_buff0_used; [L749] 0 int z$w_buff1; [L750] 0 _Bool z$w_buff1_used; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L858] 0 pthread_t t949; [L859] FCALL, FORK 0 pthread_create(&t949, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t949, ((void *)0), P0, ((void *)0))=-4, t949={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L860] 0 pthread_t t950; [L861] FCALL, FORK 0 pthread_create(&t950, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t950, ((void *)0), P1, ((void *)0))=-3, t949={5:0}, t950={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L862] 0 pthread_t t951; [L863] FCALL, FORK 0 pthread_create(&t951, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t951, ((void *)0), P2, ((void *)0))=-2, t949={5:0}, t950={6:0}, t951={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L864] 0 pthread_t t952; [L865] FCALL, FORK 0 pthread_create(&t952, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t952, ((void *)0), P3, ((void *)0))=-1, t949={5:0}, t950={6:0}, t951={7:0}, t952={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L814] 4 z$w_buff1 = z$w_buff0 [L815] 4 z$w_buff0 = 1 [L816] 4 z$w_buff1_used = z$w_buff0_used [L817] 4 z$w_buff0_used = (_Bool)1 [L818] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L818] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L819] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L820] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L821] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L822] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L823] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L824] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L827] 4 a = 1 [L830] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L833] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L756] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L759] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L771] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L774] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L786] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L789] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L790] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L791] 3 z$flush_delayed = weak$$choice2 [L792] 3 z$mem_tmp = z [L793] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L794] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L795] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L796] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L797] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L799] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L800] 3 __unbuffered_p2_EAX = z [L801] 3 z = z$flush_delayed ? z$mem_tmp : z [L802] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 1 return 0; [L779] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 2 return 0; [L836] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L837] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L838] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L839] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L840] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L807] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L809] 3 return 0; [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L845] 4 return 0; [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L869] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L869] RET 0 assume_abort_if_not(main$tmp_guard0) [L871] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L872] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L873] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L874] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L875] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t949={5:0}, t950={6:0}, t951={7:0}, t952={3:0}, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L878] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L880] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, 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: 856]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 863]: 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: 859]: 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: 861]: 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: 865]: 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, 178 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: 14.5s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 930 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 749 mSDsluCounter, 520 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 470 mSDsCounter, 95 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2639 IncrementalHoareTripleChecker+Invalid, 2734 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 95 mSolverCounterUnsat, 50 mSDtfsCounter, 2639 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=399occurred in iteration=10, InterpolantAutomatonStates: 84, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 269 NumberOfCodeBlocks, 269 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 229 ConstructedInterpolants, 0 QuantifiedInterpolants, 1878 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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:53:40,284 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/mix036_pso.opt_tso.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eb5b5f76ea992c17ebcf5a0e506a820a4d574c4d0723905971e2f5f6725ae203 --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:53:42,250 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 02:53:42,256 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 02:53:42,291 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 02:53:42,292 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 02:53:42,294 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 02:53:42,296 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 02:53:42,297 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 02:53:42,299 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 02:53:42,302 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 02:53:42,303 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 02:53:42,305 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 02:53:42,305 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 02:53:42,306 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 02:53:42,307 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 02:53:42,310 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 02:53:42,310 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 02:53:42,311 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 02:53:42,312 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 02:53:42,316 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 02:53:42,317 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 02:53:42,318 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 02:53:42,318 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 02:53:42,319 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 02:53:42,324 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 02:53:42,324 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 02:53:42,324 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 02:53:42,326 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 02:53:42,326 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 02:53:42,327 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 02:53:42,327 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 02:53:42,328 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 02:53:42,329 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 02:53:42,329 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 02:53:42,330 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 02:53:42,330 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 02:53:42,330 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 02:53:42,331 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 02:53:42,331 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 02:53:42,331 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 02:53:42,332 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 02:53:42,333 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:53:42,357 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 02:53:42,358 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 02:53:42,358 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 02:53:42,358 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 02:53:42,359 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 02:53:42,359 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 02:53:42,360 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 02:53:42,360 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 02:53:42,360 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 02:53:42,360 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 02:53:42,361 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 02:53:42,361 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 02:53:42,361 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 02:53:42,361 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 02:53:42,361 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 02:53:42,361 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 02:53:42,361 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 02:53:42,362 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 02:53:42,362 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 02:53:42,362 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 02:53:42,362 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-30 02:53:42,362 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-30 02:53:42,362 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 02:53:42,362 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 02:53:42,362 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 02:53:42,363 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 02:53:42,363 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 02:53:42,363 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:53:42,363 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 02:53:42,363 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 02:53:42,363 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-30 02:53:42,363 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-30 02:53:42,364 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 02:53:42,364 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 02:53:42,364 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 02:53:42,364 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-30 02:53:42,364 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 02:53:42,364 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 -> eb5b5f76ea992c17ebcf5a0e506a820a4d574c4d0723905971e2f5f6725ae203 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:53:42,636 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 02:53:42,648 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 02:53:42,650 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 02:53:42,651 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 02:53:42,651 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 02:53:42,652 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix036_pso.opt_tso.opt.i [2023-08-30 02:53:43,879 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 02:53:44,132 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 02:53:44,133 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix036_pso.opt_tso.opt.i [2023-08-30 02:53:44,142 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6930f380/70185f719e22471084390fd517b757f5/FLAG7f5ad5f72 [2023-08-30 02:53:44,153 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6930f380/70185f719e22471084390fd517b757f5 [2023-08-30 02:53:44,155 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 02:53:44,156 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 02:53:44,157 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 02:53:44,157 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 02:53:44,159 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 02:53:44,160 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:53:44" (1/1) ... [2023-08-30 02:53:44,160 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21ca5f7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:44, skipping insertion in model container [2023-08-30 02:53:44,160 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:53:44" (1/1) ... [2023-08-30 02:53:44,165 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 02:53:44,192 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 02:53:44,329 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/mix036_pso.opt_tso.opt.i[956,969] [2023-08-30 02:53:44,499 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:53:44,510 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 02:53:44,521 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/mix036_pso.opt_tso.opt.i[956,969] [2023-08-30 02:53:44,571 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:53:44,609 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:53:44,609 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:53:44,613 INFO L208 MainTranslator]: Completed translation [2023-08-30 02:53:44,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:44 WrapperNode [2023-08-30 02:53:44,614 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 02:53:44,614 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 02:53:44,614 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 02:53:44,614 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 02:53:44,619 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:53:44" (1/1) ... [2023-08-30 02:53:44,641 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:53:44" (1/1) ... [2023-08-30 02:53:44,661 INFO L138 Inliner]: procedures = 180, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 154 [2023-08-30 02:53:44,662 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 02:53:44,662 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 02:53:44,662 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 02:53:44,663 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 02:53:44,668 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:44" (1/1) ... [2023-08-30 02:53:44,670 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:44" (1/1) ... [2023-08-30 02:53:44,675 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:44" (1/1) ... [2023-08-30 02:53:44,675 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:44" (1/1) ... [2023-08-30 02:53:44,690 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:44" (1/1) ... [2023-08-30 02:53:44,695 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:44" (1/1) ... [2023-08-30 02:53:44,697 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:44" (1/1) ... [2023-08-30 02:53:44,698 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:44" (1/1) ... [2023-08-30 02:53:44,700 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 02:53:44,700 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 02:53:44,701 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 02:53:44,701 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 02:53:44,701 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:44" (1/1) ... [2023-08-30 02:53:44,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:53:44,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:53:44,723 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:53:44,733 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:53:44,754 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 02:53:44,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 02:53:44,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 02:53:44,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 02:53:44,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-30 02:53:44,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-30 02:53:44,755 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 02:53:44,755 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 02:53:44,755 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 02:53:44,755 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 02:53:44,755 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 02:53:44,755 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 02:53:44,755 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-30 02:53:44,755 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-30 02:53:44,755 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 02:53:44,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 02:53:44,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 02:53:44,756 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:53:44,937 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 02:53:44,938 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 02:53:45,243 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 02:53:45,333 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 02:53:45,334 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 02:53:45,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:53:45 BoogieIcfgContainer [2023-08-30 02:53:45,335 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 02:53:45,337 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 02:53:45,337 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 02:53:45,339 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 02:53:45,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 02:53:44" (1/3) ... [2023-08-30 02:53:45,339 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17a7388a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:53:45, skipping insertion in model container [2023-08-30 02:53:45,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:53:44" (2/3) ... [2023-08-30 02:53:45,340 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17a7388a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:53:45, skipping insertion in model container [2023-08-30 02:53:45,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:53:45" (3/3) ... [2023-08-30 02:53:45,341 INFO L112 eAbstractionObserver]: Analyzing ICFG mix036_pso.opt_tso.opt.i [2023-08-30 02:53:45,352 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 02:53:45,352 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-30 02:53:45,352 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 02:53:45,400 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 02:53:45,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 144 transitions, 308 flow [2023-08-30 02:53:45,486 INFO L130 PetriNetUnfolder]: 2/140 cut-off events. [2023-08-30 02:53:45,486 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:53:45,490 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 98 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 95. Up to 2 conditions per place. [2023-08-30 02:53:45,491 INFO L82 GeneralOperation]: Start removeDead. Operand has 155 places, 144 transitions, 308 flow [2023-08-30 02:53:45,496 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 151 places, 140 transitions, 292 flow [2023-08-30 02:53:45,498 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 02:53:45,507 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 140 transitions, 292 flow [2023-08-30 02:53:45,510 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 151 places, 140 transitions, 292 flow [2023-08-30 02:53:45,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 140 transitions, 292 flow [2023-08-30 02:53:45,545 INFO L130 PetriNetUnfolder]: 2/140 cut-off events. [2023-08-30 02:53:45,545 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:53:45,547 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 98 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 95. Up to 2 conditions per place. [2023-08-30 02:53:45,549 INFO L119 LiptonReduction]: Number of co-enabled transitions 3128 [2023-08-30 02:53:51,254 INFO L134 LiptonReduction]: Checked pairs total: 7423 [2023-08-30 02:53:51,254 INFO L136 LiptonReduction]: Total number of compositions: 136 [2023-08-30 02:53:51,280 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 02:53:51,286 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;@54fbe697, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 02:53:51,286 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-30 02:53:51,288 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-30 02:53:51,288 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:53:51,289 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:53:51,289 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 02:53:51,290 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:53:51,294 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:53:51,295 INFO L85 PathProgramCache]: Analyzing trace with hash 584, now seen corresponding path program 1 times [2023-08-30 02:53:51,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:53:51,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [686559882] [2023-08-30 02:53:51,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:53:51,304 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:53:51,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:53:51,323 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:53:51,324 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:53:51,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:53:51,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-30 02:53:51,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:53:51,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:53:51,416 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:53:51,416 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:53:51,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [686559882] [2023-08-30 02:53:51,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [686559882] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:53:51,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:53:51,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 02:53:51,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617332774] [2023-08-30 02:53:51,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:53:51,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 02:53:51,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:53:51,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 02:53:51,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 02:53:51,440 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 280 [2023-08-30 02:53:51,442 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 88 flow. Second operand has 2 states, 2 states have (on average 132.5) internal successors, (265), 2 states have internal predecessors, (265), 0 states have call successors, (0), 0 states 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:53:51,442 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:53:51,442 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 280 [2023-08-30 02:53:51,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:53:52,003 INFO L130 PetriNetUnfolder]: 4373/6097 cut-off events. [2023-08-30 02:53:52,004 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2023-08-30 02:53:52,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12183 conditions, 6097 events. 4373/6097 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 30881 event pairs, 4373 based on Foata normal form. 0/5373 useless extension candidates. Maximal degree in co-relation 12171. Up to 5983 conditions per place. [2023-08-30 02:53:52,033 INFO L137 encePairwiseOnDemand]: 271/280 looper letters, 26 selfloop transitions, 0 changer transitions 0/29 dead transitions. [2023-08-30 02:53:52,034 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 29 transitions, 122 flow [2023-08-30 02:53:52,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 02:53:52,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 02:53:52,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 299 transitions. [2023-08-30 02:53:52,048 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5339285714285714 [2023-08-30 02:53:52,049 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 299 transitions. [2023-08-30 02:53:52,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 299 transitions. [2023-08-30 02:53:52,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:53:52,053 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 299 transitions. [2023-08-30 02:53:52,059 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 149.5) internal successors, (299), 2 states have internal predecessors, (299), 0 states have call successors, (0), 0 states 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:53:52,062 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 280.0) internal successors, (840), 3 states have internal predecessors, (840), 0 states have call successors, (0), 0 states 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:53:52,063 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 280.0) internal successors, (840), 3 states have internal predecessors, (840), 0 states have call successors, (0), 0 states 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:53:52,064 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 88 flow. Second operand 2 states and 299 transitions. [2023-08-30 02:53:52,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 29 transitions, 122 flow [2023-08-30 02:53:52,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 29 transitions, 118 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 02:53:52,073 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 66 flow [2023-08-30 02:53:52,074 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=66, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2023-08-30 02:53:52,077 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -11 predicate places. [2023-08-30 02:53:52,077 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 66 flow [2023-08-30 02:53:52,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 132.5) internal successors, (265), 2 states have internal predecessors, (265), 0 states have call successors, (0), 0 states 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:53:52,078 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:53:52,078 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:53:52,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-08-30 02:53:52,285 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:53:52,285 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:53:52,289 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:53:52,290 INFO L85 PathProgramCache]: Analyzing trace with hash -964475270, now seen corresponding path program 1 times [2023-08-30 02:53:52,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:53:52,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [320696585] [2023-08-30 02:53:52,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:53:52,293 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:53:52,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:53:52,296 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:53:52,297 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:53:52,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:53:52,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 02:53:52,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:53:52,420 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:53:52,420 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:53:52,420 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:53:52,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [320696585] [2023-08-30 02:53:52,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [320696585] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:53:52,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:53:52,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:53:52,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411433921] [2023-08-30 02:53:52,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:53:52,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:53:52,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:53:52,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:53:52,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:53:52,427 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 280 [2023-08-30 02:53:52,427 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:53:52,427 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:53:52,427 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 280 [2023-08-30 02:53:52,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:53:52,838 INFO L130 PetriNetUnfolder]: 3632/5248 cut-off events. [2023-08-30 02:53:52,838 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:53:52,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10338 conditions, 5248 events. 3632/5248 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 28112 event pairs, 668 based on Foata normal form. 0/4884 useless extension candidates. Maximal degree in co-relation 10335. Up to 3973 conditions per place. [2023-08-30 02:53:52,862 INFO L137 encePairwiseOnDemand]: 277/280 looper letters, 34 selfloop transitions, 2 changer transitions 2/41 dead transitions. [2023-08-30 02:53:52,862 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 41 transitions, 166 flow [2023-08-30 02:53:52,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:53:52,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:53:52,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 432 transitions. [2023-08-30 02:53:52,865 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2023-08-30 02:53:52,865 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 432 transitions. [2023-08-30 02:53:52,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 432 transitions. [2023-08-30 02:53:52,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:53:52,865 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 432 transitions. [2023-08-30 02:53:52,866 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:53:52,868 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 280.0) internal successors, (1120), 4 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states 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:53:52,869 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 280.0) internal successors, (1120), 4 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states 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:53:52,869 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 66 flow. Second operand 3 states and 432 transitions. [2023-08-30 02:53:52,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 41 transitions, 166 flow [2023-08-30 02:53:52,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 41 transitions, 166 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 02:53:52,870 INFO L231 Difference]: Finished difference. Result has 40 places, 27 transitions, 66 flow [2023-08-30 02:53:52,871 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2023-08-30 02:53:52,871 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -10 predicate places. [2023-08-30 02:53:52,871 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 66 flow [2023-08-30 02:53:52,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:53:52,872 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:53:52,872 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:53:52,883 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:53:53,082 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:53:53,083 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:53:53,083 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:53:53,083 INFO L85 PathProgramCache]: Analyzing trace with hash 650912999, now seen corresponding path program 1 times [2023-08-30 02:53:53,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:53:53,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [89784595] [2023-08-30 02:53:53,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:53:53,084 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:53:53,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:53:53,085 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:53:53,087 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:53:53,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:53:53,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 02:53:53,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:53:53,222 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:53:53,222 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:53:53,222 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:53:53,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [89784595] [2023-08-30 02:53:53,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [89784595] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:53:53,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:53:53,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:53:53,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401604767] [2023-08-30 02:53:53,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:53:53,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:53:53,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:53:53,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:53:53,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:53:53,237 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 280 [2023-08-30 02:53:53,237 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:53:53,238 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:53:53,238 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 280 [2023-08-30 02:53:53,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:53:53,600 INFO L130 PetriNetUnfolder]: 2540/3674 cut-off events. [2023-08-30 02:53:53,600 INFO L131 PetriNetUnfolder]: For 180/180 co-relation queries the response was YES. [2023-08-30 02:53:53,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7626 conditions, 3674 events. 2540/3674 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 18141 event pairs, 492 based on Foata normal form. 180/3719 useless extension candidates. Maximal degree in co-relation 7622. Up to 2887 conditions per place. [2023-08-30 02:53:53,616 INFO L137 encePairwiseOnDemand]: 273/280 looper letters, 36 selfloop transitions, 5 changer transitions 23/67 dead transitions. [2023-08-30 02:53:53,616 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 67 transitions, 286 flow [2023-08-30 02:53:53,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:53:53,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:53:53,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 696 transitions. [2023-08-30 02:53:53,618 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49714285714285716 [2023-08-30 02:53:53,619 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 696 transitions. [2023-08-30 02:53:53,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 696 transitions. [2023-08-30 02:53:53,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:53:53,619 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 696 transitions. [2023-08-30 02:53:53,620 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 139.2) internal successors, (696), 5 states have internal predecessors, (696), 0 states have call successors, (0), 0 states 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:53:53,622 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 280.0) internal successors, (1680), 6 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:53:53,623 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 280.0) internal successors, (1680), 6 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:53:53,623 INFO L175 Difference]: Start difference. First operand has 40 places, 27 transitions, 66 flow. Second operand 5 states and 696 transitions. [2023-08-30 02:53:53,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 67 transitions, 286 flow [2023-08-30 02:53:53,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 67 transitions, 276 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:53:53,625 INFO L231 Difference]: Finished difference. Result has 44 places, 31 transitions, 107 flow [2023-08-30 02:53:53,626 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=107, PETRI_PLACES=44, PETRI_TRANSITIONS=31} [2023-08-30 02:53:53,626 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -6 predicate places. [2023-08-30 02:53:53,626 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 107 flow [2023-08-30 02:53:53,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:53:53,627 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:53:53,627 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:53:53,647 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:53:53,835 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:53:53,835 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:53:53,835 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:53:53,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1334862761, now seen corresponding path program 1 times [2023-08-30 02:53:53,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:53:53,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [416070670] [2023-08-30 02:53:53,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:53:53,836 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:53:53,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:53:53,847 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:53:53,850 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:53:53,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:53:53,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 02:53:53,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:53:53,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:53:53,974 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:53:53,974 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:53:53,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [416070670] [2023-08-30 02:53:53,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [416070670] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:53:53,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:53:53,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:53:53,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232252395] [2023-08-30 02:53:53,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:53:53,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:53:53,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:53:53,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:53:53,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:53:53,990 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 280 [2023-08-30 02:53:53,991 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 31 transitions, 107 flow. Second operand has 5 states, 5 states have (on average 128.8) internal successors, (644), 5 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:53:53,991 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:53:53,991 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 280 [2023-08-30 02:53:53,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:53:54,247 INFO L130 PetriNetUnfolder]: 1284/1990 cut-off events. [2023-08-30 02:53:54,247 INFO L131 PetriNetUnfolder]: For 868/868 co-relation queries the response was YES. [2023-08-30 02:53:54,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5495 conditions, 1990 events. 1284/1990 cut-off events. For 868/868 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 9369 event pairs, 186 based on Foata normal form. 132/2063 useless extension candidates. Maximal degree in co-relation 5488. Up to 1027 conditions per place. [2023-08-30 02:53:54,268 INFO L137 encePairwiseOnDemand]: 273/280 looper letters, 47 selfloop transitions, 9 changer transitions 23/82 dead transitions. [2023-08-30 02:53:54,268 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 82 transitions, 427 flow [2023-08-30 02:53:54,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:53:54,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:53:54,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 837 transitions. [2023-08-30 02:53:54,274 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4982142857142857 [2023-08-30 02:53:54,274 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 837 transitions. [2023-08-30 02:53:54,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 837 transitions. [2023-08-30 02:53:54,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:53:54,274 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 837 transitions. [2023-08-30 02:53:54,278 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 139.5) internal successors, (837), 6 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:53:54,281 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 280.0) internal successors, (1960), 7 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states 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:53:54,282 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 280.0) internal successors, (1960), 7 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states 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:53:54,282 INFO L175 Difference]: Start difference. First operand has 44 places, 31 transitions, 107 flow. Second operand 6 states and 837 transitions. [2023-08-30 02:53:54,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 82 transitions, 427 flow [2023-08-30 02:53:54,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 82 transitions, 420 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 02:53:54,294 INFO L231 Difference]: Finished difference. Result has 48 places, 35 transitions, 172 flow [2023-08-30 02:53:54,294 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=172, PETRI_PLACES=48, PETRI_TRANSITIONS=35} [2023-08-30 02:53:54,296 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -2 predicate places. [2023-08-30 02:53:54,296 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 35 transitions, 172 flow [2023-08-30 02:53:54,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 128.8) internal successors, (644), 5 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:53:54,297 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:53:54,297 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:53:54,313 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:53:54,504 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:53:54,505 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:53:54,505 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:53:54,505 INFO L85 PathProgramCache]: Analyzing trace with hash -195492038, now seen corresponding path program 1 times [2023-08-30 02:53:54,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:53:54,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1437677358] [2023-08-30 02:53:54,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:53:54,506 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:53:54,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:53:54,507 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:53:54,510 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:53:54,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:53:54,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-30 02:53:54,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:53:54,633 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:53:54,634 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:53:54,634 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:53:54,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1437677358] [2023-08-30 02:53:54,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1437677358] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:53:54,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:53:54,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:53:54,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264395807] [2023-08-30 02:53:54,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:53:54,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:53:54,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:53:54,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:53:54,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:53:54,660 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 280 [2023-08-30 02:53:54,661 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 35 transitions, 172 flow. Second operand has 6 states, 6 states have (on average 128.66666666666666) internal successors, (772), 6 states have internal predecessors, (772), 0 states have call successors, (0), 0 states 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:53:54,661 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:53:54,661 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 280 [2023-08-30 02:53:54,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:53:54,933 INFO L130 PetriNetUnfolder]: 660/1070 cut-off events. [2023-08-30 02:53:54,933 INFO L131 PetriNetUnfolder]: For 1228/1228 co-relation queries the response was YES. [2023-08-30 02:53:54,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3496 conditions, 1070 events. 660/1070 cut-off events. For 1228/1228 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4505 event pairs, 124 based on Foata normal form. 56/1111 useless extension candidates. Maximal degree in co-relation 3487. Up to 395 conditions per place. [2023-08-30 02:53:54,938 INFO L137 encePairwiseOnDemand]: 273/280 looper letters, 56 selfloop transitions, 13 changer transitions 23/95 dead transitions. [2023-08-30 02:53:54,938 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 95 transitions, 588 flow [2023-08-30 02:53:54,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:53:54,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:53:54,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 976 transitions. [2023-08-30 02:53:54,941 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49795918367346936 [2023-08-30 02:53:54,941 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 976 transitions. [2023-08-30 02:53:54,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 976 transitions. [2023-08-30 02:53:54,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:53:54,942 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 976 transitions. [2023-08-30 02:53:54,943 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 139.42857142857142) internal successors, (976), 7 states have internal predecessors, (976), 0 states have call successors, (0), 0 states 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:53:54,946 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 280.0) internal successors, (2240), 8 states have internal predecessors, (2240), 0 states have call successors, (0), 0 states 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:53:54,946 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 280.0) internal successors, (2240), 8 states have internal predecessors, (2240), 0 states have call successors, (0), 0 states 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:53:54,946 INFO L175 Difference]: Start difference. First operand has 48 places, 35 transitions, 172 flow. Second operand 7 states and 976 transitions. [2023-08-30 02:53:54,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 95 transitions, 588 flow [2023-08-30 02:53:54,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 95 transitions, 526 flow, removed 26 selfloop flow, removed 4 redundant places. [2023-08-30 02:53:54,953 INFO L231 Difference]: Finished difference. Result has 51 places, 39 transitions, 222 flow [2023-08-30 02:53:54,954 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=222, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2023-08-30 02:53:54,954 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 1 predicate places. [2023-08-30 02:53:54,954 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 222 flow [2023-08-30 02:53:54,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 128.66666666666666) internal successors, (772), 6 states have internal predecessors, (772), 0 states have call successors, (0), 0 states 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:53:54,955 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:53:54,955 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:53:54,971 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 (6)] Ended with exit code 0 [2023-08-30 02:53:55,162 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:53:55,163 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:53:55,164 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:53:55,164 INFO L85 PathProgramCache]: Analyzing trace with hash 108107937, now seen corresponding path program 1 times [2023-08-30 02:53:55,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:53:55,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [371280513] [2023-08-30 02:53:55,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:53:55,164 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:53:55,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:53:55,167 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:53:55,167 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:53:55,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:53:55,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-30 02:53:55,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:53:55,319 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:53:55,319 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:53:55,319 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:53:55,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [371280513] [2023-08-30 02:53:55,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [371280513] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:53:55,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:53:55,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 02:53:55,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100747843] [2023-08-30 02:53:55,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:53:55,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:53:55,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:53:55,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:53:55,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:53:55,355 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 280 [2023-08-30 02:53:55,356 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 222 flow. Second operand has 7 states, 7 states have (on average 128.71428571428572) internal successors, (901), 7 states have internal predecessors, (901), 0 states have call successors, (0), 0 states 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:53:55,356 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:53:55,356 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 280 [2023-08-30 02:53:55,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:53:55,703 INFO L130 PetriNetUnfolder]: 528/839 cut-off events. [2023-08-30 02:53:55,703 INFO L131 PetriNetUnfolder]: For 938/938 co-relation queries the response was YES. [2023-08-30 02:53:55,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2639 conditions, 839 events. 528/839 cut-off events. For 938/938 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3359 event pairs, 119 based on Foata normal form. 12/847 useless extension candidates. Maximal degree in co-relation 2629. Up to 340 conditions per place. [2023-08-30 02:53:55,707 INFO L137 encePairwiseOnDemand]: 273/280 looper letters, 52 selfloop transitions, 17 changer transitions 12/84 dead transitions. [2023-08-30 02:53:55,707 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 84 transitions, 532 flow [2023-08-30 02:53:55,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 02:53:55,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 02:53:55,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1091 transitions. [2023-08-30 02:53:55,710 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4870535714285714 [2023-08-30 02:53:55,710 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1091 transitions. [2023-08-30 02:53:55,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1091 transitions. [2023-08-30 02:53:55,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:53:55,710 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1091 transitions. [2023-08-30 02:53:55,712 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 136.375) internal successors, (1091), 8 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states 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:53:55,714 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 280.0) internal successors, (2520), 9 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states 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:53:55,714 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 280.0) internal successors, (2520), 9 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states 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:53:55,714 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 222 flow. Second operand 8 states and 1091 transitions. [2023-08-30 02:53:55,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 84 transitions, 532 flow [2023-08-30 02:53:55,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 84 transitions, 470 flow, removed 22 selfloop flow, removed 5 redundant places. [2023-08-30 02:53:55,720 INFO L231 Difference]: Finished difference. Result has 54 places, 39 transitions, 216 flow [2023-08-30 02:53:55,720 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=216, PETRI_PLACES=54, PETRI_TRANSITIONS=39} [2023-08-30 02:53:55,722 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 4 predicate places. [2023-08-30 02:53:55,722 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 39 transitions, 216 flow [2023-08-30 02:53:55,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 128.71428571428572) internal successors, (901), 7 states have internal predecessors, (901), 0 states have call successors, (0), 0 states 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:53:55,723 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:53:55,723 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] [2023-08-30 02:53:55,739 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:53:55,939 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:53:55,939 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:53:55,940 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:53:55,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1458885807, now seen corresponding path program 1 times [2023-08-30 02:53:55,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:53:55,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [977038183] [2023-08-30 02:53:55,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:53:55,940 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:53:55,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:53:55,941 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:53:55,943 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:53:56,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:53:56,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 02:53:56,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:53:56,083 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:53:56,083 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:53:56,083 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:53:56,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [977038183] [2023-08-30 02:53:56,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [977038183] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:53:56,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:53:56,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:53:56,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475274412] [2023-08-30 02:53:56,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:53:56,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:53:56,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:53:56,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:53:56,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:53:56,096 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 280 [2023-08-30 02:53:56,097 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 39 transitions, 216 flow. Second operand has 5 states, 5 states have (on average 131.8) internal successors, (659), 5 states have internal predecessors, (659), 0 states have call successors, (0), 0 states 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:53:56,097 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:53:56,097 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 280 [2023-08-30 02:53:56,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:53:56,265 INFO L130 PetriNetUnfolder]: 707/1171 cut-off events. [2023-08-30 02:53:56,265 INFO L131 PetriNetUnfolder]: For 1643/1643 co-relation queries the response was YES. [2023-08-30 02:53:56,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3603 conditions, 1171 events. 707/1171 cut-off events. For 1643/1643 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5627 event pairs, 115 based on Foata normal form. 0/1169 useless extension candidates. Maximal degree in co-relation 3592. Up to 653 conditions per place. [2023-08-30 02:53:56,269 INFO L137 encePairwiseOnDemand]: 276/280 looper letters, 80 selfloop transitions, 3 changer transitions 0/85 dead transitions. [2023-08-30 02:53:56,269 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 85 transitions, 657 flow [2023-08-30 02:53:56,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:53:56,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:53:56,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 689 transitions. [2023-08-30 02:53:56,271 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49214285714285716 [2023-08-30 02:53:56,271 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 689 transitions. [2023-08-30 02:53:56,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 689 transitions. [2023-08-30 02:53:56,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:53:56,271 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 689 transitions. [2023-08-30 02:53:56,272 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 137.8) internal successors, (689), 5 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:53:56,273 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 280.0) internal successors, (1680), 6 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:53:56,274 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 280.0) internal successors, (1680), 6 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:53:56,274 INFO L175 Difference]: Start difference. First operand has 54 places, 39 transitions, 216 flow. Second operand 5 states and 689 transitions. [2023-08-30 02:53:56,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 85 transitions, 657 flow [2023-08-30 02:53:56,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 85 transitions, 516 flow, removed 38 selfloop flow, removed 7 redundant places. [2023-08-30 02:53:56,280 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 173 flow [2023-08-30 02:53:56,280 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=173, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2023-08-30 02:53:56,280 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 2 predicate places. [2023-08-30 02:53:56,280 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 173 flow [2023-08-30 02:53:56,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 131.8) internal successors, (659), 5 states have internal predecessors, (659), 0 states have call successors, (0), 0 states 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:53:56,281 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:53:56,281 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] [2023-08-30 02:53:56,290 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:53:56,488 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:53:56,489 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:53:56,489 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:53:56,489 INFO L85 PathProgramCache]: Analyzing trace with hash -415038275, now seen corresponding path program 2 times [2023-08-30 02:53:56,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:53:56,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [5707312] [2023-08-30 02:53:56,489 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 02:53:56,489 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:53:56,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:53:56,491 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:53:56,493 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:53:56,573 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 02:53:56,573 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:53:56,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 02:53:56,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:53:56,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:53:56,609 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:53:56,609 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:53:56,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [5707312] [2023-08-30 02:53:56,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [5707312] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:53:56,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:53:56,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:53:56,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790443969] [2023-08-30 02:53:56,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:53:56,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:53:56,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:53:56,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:53:56,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:53:56,623 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 280 [2023-08-30 02:53:56,623 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 173 flow. Second operand has 5 states, 5 states have (on average 131.8) internal successors, (659), 5 states have internal predecessors, (659), 0 states have call successors, (0), 0 states 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:53:56,623 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:53:56,623 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 280 [2023-08-30 02:53:56,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:53:56,871 INFO L130 PetriNetUnfolder]: 1162/1821 cut-off events. [2023-08-30 02:53:56,872 INFO L131 PetriNetUnfolder]: For 1809/1809 co-relation queries the response was YES. [2023-08-30 02:53:56,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5408 conditions, 1821 events. 1162/1821 cut-off events. For 1809/1809 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 9119 event pairs, 209 based on Foata normal form. 1/1807 useless extension candidates. Maximal degree in co-relation 5397. Up to 975 conditions per place. [2023-08-30 02:53:56,878 INFO L137 encePairwiseOnDemand]: 276/280 looper letters, 79 selfloop transitions, 4 changer transitions 0/86 dead transitions. [2023-08-30 02:53:56,878 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 86 transitions, 545 flow [2023-08-30 02:53:56,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:53:56,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:53:56,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 687 transitions. [2023-08-30 02:53:56,880 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4907142857142857 [2023-08-30 02:53:56,880 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 687 transitions. [2023-08-30 02:53:56,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 687 transitions. [2023-08-30 02:53:56,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:53:56,881 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 687 transitions. [2023-08-30 02:53:56,882 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:53:56,883 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 280.0) internal successors, (1680), 6 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:53:56,884 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 280.0) internal successors, (1680), 6 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:53:56,884 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 173 flow. Second operand 5 states and 687 transitions. [2023-08-30 02:53:56,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 86 transitions, 545 flow [2023-08-30 02:53:56,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 86 transitions, 542 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:53:56,894 INFO L231 Difference]: Finished difference. Result has 58 places, 44 transitions, 207 flow [2023-08-30 02:53:56,894 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=207, PETRI_PLACES=58, PETRI_TRANSITIONS=44} [2023-08-30 02:53:56,895 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 8 predicate places. [2023-08-30 02:53:56,895 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 44 transitions, 207 flow [2023-08-30 02:53:56,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 131.8) internal successors, (659), 5 states have internal predecessors, (659), 0 states have call successors, (0), 0 states 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:53:56,895 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:53:56,896 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] [2023-08-30 02:53:56,909 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:53:57,106 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:53:57,106 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:53:57,106 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:53:57,107 INFO L85 PathProgramCache]: Analyzing trace with hash 825675641, now seen corresponding path program 1 times [2023-08-30 02:53:57,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:53:57,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1516834466] [2023-08-30 02:53:57,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:53:57,107 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:53:57,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:53:57,108 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:53:57,111 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:53:57,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:53:57,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-30 02:53:57,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:53:57,678 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:53:57,678 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:53:57,678 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:53:57,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1516834466] [2023-08-30 02:53:57,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1516834466] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:53:57,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:53:57,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:53:57,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092673446] [2023-08-30 02:53:57,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:53:57,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:53:57,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:53:57,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:53:57,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:53:57,966 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 280 [2023-08-30 02:53:57,967 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 44 transitions, 207 flow. Second operand has 6 states, 6 states have (on average 115.83333333333333) internal successors, (695), 6 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:53:57,967 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:53:57,967 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 280 [2023-08-30 02:53:57,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:53:58,318 INFO L130 PetriNetUnfolder]: 938/1541 cut-off events. [2023-08-30 02:53:58,318 INFO L131 PetriNetUnfolder]: For 1856/1856 co-relation queries the response was YES. [2023-08-30 02:53:58,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4741 conditions, 1541 events. 938/1541 cut-off events. For 1856/1856 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 8096 event pairs, 59 based on Foata normal form. 4/1515 useless extension candidates. Maximal degree in co-relation 4727. Up to 1297 conditions per place. [2023-08-30 02:53:58,323 INFO L137 encePairwiseOnDemand]: 275/280 looper letters, 40 selfloop transitions, 4 changer transitions 17/64 dead transitions. [2023-08-30 02:53:58,323 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 64 transitions, 430 flow [2023-08-30 02:53:58,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:53:58,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:53:58,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 709 transitions. [2023-08-30 02:53:58,324 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4220238095238095 [2023-08-30 02:53:58,324 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 709 transitions. [2023-08-30 02:53:58,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 709 transitions. [2023-08-30 02:53:58,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:53:58,325 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 709 transitions. [2023-08-30 02:53:58,326 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 118.16666666666667) internal successors, (709), 6 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:53:58,328 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 280.0) internal successors, (1960), 7 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states 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:53:58,328 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 280.0) internal successors, (1960), 7 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states 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:53:58,328 INFO L175 Difference]: Start difference. First operand has 58 places, 44 transitions, 207 flow. Second operand 6 states and 709 transitions. [2023-08-30 02:53:58,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 64 transitions, 430 flow [2023-08-30 02:53:58,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 64 transitions, 428 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:53:58,335 INFO L231 Difference]: Finished difference. Result has 61 places, 38 transitions, 174 flow [2023-08-30 02:53:58,335 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=174, PETRI_PLACES=61, PETRI_TRANSITIONS=38} [2023-08-30 02:53:58,335 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 11 predicate places. [2023-08-30 02:53:58,335 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 38 transitions, 174 flow [2023-08-30 02:53:58,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.83333333333333) internal successors, (695), 6 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:53:58,336 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:53:58,336 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] [2023-08-30 02:53:58,345 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:53:58,548 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:53:58,548 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:53:58,549 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:53:58,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1748426189, now seen corresponding path program 3 times [2023-08-30 02:53:58,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:53:58,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1960410171] [2023-08-30 02:53:58,549 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 02:53:58,549 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:53:58,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:53:58,550 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:53:58,585 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:53:58,635 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-30 02:53:58,635 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:53:58,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 02:53:58,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:53:58,673 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:53:58,673 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:53:58,673 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:53:58,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1960410171] [2023-08-30 02:53:58,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1960410171] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:53:58,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:53:58,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:53:58,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942186083] [2023-08-30 02:53:58,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:53:58,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:53:58,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:53:58,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:53:58,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:53:58,687 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 280 [2023-08-30 02:53:58,687 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 38 transitions, 174 flow. Second operand has 5 states, 5 states have (on average 131.8) internal successors, (659), 5 states have internal predecessors, (659), 0 states have call successors, (0), 0 states 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:53:58,688 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:53:58,688 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 280 [2023-08-30 02:53:58,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:53:58,921 INFO L130 PetriNetUnfolder]: 1176/1908 cut-off events. [2023-08-30 02:53:58,921 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2023-08-30 02:53:58,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5794 conditions, 1908 events. 1176/1908 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 9680 event pairs, 221 based on Foata normal form. 1/1886 useless extension candidates. Maximal degree in co-relation 5780. Up to 1011 conditions per place. [2023-08-30 02:53:58,929 INFO L137 encePairwiseOnDemand]: 276/280 looper letters, 40 selfloop transitions, 1 changer transitions 43/86 dead transitions. [2023-08-30 02:53:58,929 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 86 transitions, 564 flow [2023-08-30 02:53:58,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:53:58,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:53:58,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 690 transitions. [2023-08-30 02:53:58,931 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4928571428571429 [2023-08-30 02:53:58,931 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 690 transitions. [2023-08-30 02:53:58,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 690 transitions. [2023-08-30 02:53:58,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:53:58,932 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 690 transitions. [2023-08-30 02:53:58,933 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.0) internal successors, (690), 5 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:53:58,935 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 280.0) internal successors, (1680), 6 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:53:58,935 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 280.0) internal successors, (1680), 6 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:53:58,935 INFO L175 Difference]: Start difference. First operand has 61 places, 38 transitions, 174 flow. Second operand 5 states and 690 transitions. [2023-08-30 02:53:58,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 86 transitions, 564 flow [2023-08-30 02:53:58,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 86 transitions, 539 flow, removed 6 selfloop flow, removed 8 redundant places. [2023-08-30 02:53:58,948 INFO L231 Difference]: Finished difference. Result has 56 places, 38 transitions, 168 flow [2023-08-30 02:53:58,949 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=168, PETRI_PLACES=56, PETRI_TRANSITIONS=38} [2023-08-30 02:53:58,949 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 6 predicate places. [2023-08-30 02:53:58,949 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 38 transitions, 168 flow [2023-08-30 02:53:58,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 131.8) internal successors, (659), 5 states have internal predecessors, (659), 0 states have call successors, (0), 0 states 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:53:58,950 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:53:58,950 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] [2023-08-30 02:53:58,961 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:53:59,162 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:53:59,162 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:53:59,163 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:53:59,163 INFO L85 PathProgramCache]: Analyzing trace with hash 307085631, now seen corresponding path program 4 times [2023-08-30 02:53:59,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:53:59,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [331475920] [2023-08-30 02:53:59,163 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 02:53:59,164 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:53:59,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:53:59,168 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:53:59,171 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:53:59,259 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 02:53:59,259 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:53:59,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 11 conjunts are in the unsatisfiable core [2023-08-30 02:53:59,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:53:59,392 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:53:59,393 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:53:59,393 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:53:59,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [331475920] [2023-08-30 02:53:59,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [331475920] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:53:59,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:53:59,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:53:59,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39463725] [2023-08-30 02:53:59,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:53:59,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:53:59,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:53:59,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:53:59,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:53:59,413 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 280 [2023-08-30 02:53:59,413 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 38 transitions, 168 flow. Second operand has 7 states, 7 states have (on average 128.28571428571428) internal successors, (898), 7 states have internal predecessors, (898), 0 states have call successors, (0), 0 states 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:53:59,414 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:53:59,414 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 280 [2023-08-30 02:53:59,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:53:59,648 INFO L130 PetriNetUnfolder]: 836/1394 cut-off events. [2023-08-30 02:53:59,649 INFO L131 PetriNetUnfolder]: For 1794/1798 co-relation queries the response was YES. [2023-08-30 02:53:59,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4459 conditions, 1394 events. 836/1394 cut-off events. For 1794/1798 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 6644 event pairs, 273 based on Foata normal form. 1/1330 useless extension candidates. Maximal degree in co-relation 4446. Up to 498 conditions per place. [2023-08-30 02:53:59,652 INFO L137 encePairwiseOnDemand]: 273/280 looper letters, 40 selfloop transitions, 4 changer transitions 38/85 dead transitions. [2023-08-30 02:53:59,653 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 85 transitions, 583 flow [2023-08-30 02:53:59,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 02:53:59,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 02:53:59,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1047 transitions. [2023-08-30 02:53:59,655 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4674107142857143 [2023-08-30 02:53:59,655 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1047 transitions. [2023-08-30 02:53:59,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1047 transitions. [2023-08-30 02:53:59,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:53:59,656 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1047 transitions. [2023-08-30 02:53:59,657 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 130.875) internal successors, (1047), 8 states have internal predecessors, (1047), 0 states have call successors, (0), 0 states 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:53:59,659 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 280.0) internal successors, (2520), 9 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states 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:53:59,659 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 280.0) internal successors, (2520), 9 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states 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:53:59,659 INFO L175 Difference]: Start difference. First operand has 56 places, 38 transitions, 168 flow. Second operand 8 states and 1047 transitions. [2023-08-30 02:53:59,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 85 transitions, 583 flow [2023-08-30 02:53:59,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 85 transitions, 573 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-30 02:53:59,666 INFO L231 Difference]: Finished difference. Result has 61 places, 38 transitions, 179 flow [2023-08-30 02:53:59,666 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=179, PETRI_PLACES=61, PETRI_TRANSITIONS=38} [2023-08-30 02:53:59,667 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 11 predicate places. [2023-08-30 02:53:59,667 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 38 transitions, 179 flow [2023-08-30 02:53:59,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 128.28571428571428) internal successors, (898), 7 states have internal predecessors, (898), 0 states have call successors, (0), 0 states 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:53:59,667 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:53:59,667 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] [2023-08-30 02:53:59,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-08-30 02:53:59,875 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:53:59,875 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:53:59,876 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:53:59,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1809797717, now seen corresponding path program 5 times [2023-08-30 02:53:59,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:53:59,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1848832240] [2023-08-30 02:53:59,876 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-30 02:53:59,876 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:53:59,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:53:59,877 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:53:59,880 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:53:59,981 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 02:53:59,981 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-30 02:53:59,981 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 02:54:00,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:54:00,102 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-30 02:54:00,102 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 02:54:00,103 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-30 02:54:00,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-30 02:54:00,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-30 02:54:00,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-30 02:54:00,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-30 02:54:00,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-30 02:54:00,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-30 02:54:00,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-30 02:54:00,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-30 02:54:00,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-30 02:54:00,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-30 02:54:00,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-30 02:54:00,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-30 02:54:00,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-30 02:54:00,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-30 02:54:00,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-30 02:54:00,116 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:54:00,314 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:54:00,315 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:54:00,318 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 02:54:00,318 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 02:54:00,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 02:54:00 BasicIcfg [2023-08-30 02:54:00,394 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 02:54:00,394 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 02:54:00,394 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 02:54:00,394 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 02:54:00,395 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:53:45" (3/4) ... [2023-08-30 02:54:00,396 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-30 02:54:00,396 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 02:54:00,397 INFO L158 Benchmark]: Toolchain (without parser) took 16240.65ms. Allocated memory was 73.4MB in the beginning and 570.4MB in the end (delta: 497.0MB). Free memory was 49.4MB in the beginning and 369.7MB in the end (delta: -320.3MB). Peak memory consumption was 179.3MB. Max. memory is 16.1GB. [2023-08-30 02:54:00,397 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 60.8MB. Free memory is still 37.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:54:00,397 INFO L158 Benchmark]: CACSL2BoogieTranslator took 456.97ms. Allocated memory is still 73.4MB. Free memory was 49.2MB in the beginning and 43.9MB in the end (delta: 5.3MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. [2023-08-30 02:54:00,397 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.64ms. Allocated memory is still 73.4MB. Free memory was 43.9MB in the beginning and 41.2MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-30 02:54:00,398 INFO L158 Benchmark]: Boogie Preprocessor took 37.67ms. Allocated memory is still 73.4MB. Free memory was 41.2MB in the beginning and 39.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:54:00,398 INFO L158 Benchmark]: RCFGBuilder took 634.86ms. Allocated memory is still 73.4MB. Free memory was 38.9MB in the beginning and 41.9MB in the end (delta: -3.1MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. [2023-08-30 02:54:00,398 INFO L158 Benchmark]: TraceAbstraction took 15056.92ms. Allocated memory was 73.4MB in the beginning and 570.4MB in the end (delta: 497.0MB). Free memory was 41.5MB in the beginning and 370.7MB in the end (delta: -329.2MB). Peak memory consumption was 166.1MB. Max. memory is 16.1GB. [2023-08-30 02:54:00,398 INFO L158 Benchmark]: Witness Printer took 2.23ms. Allocated memory is still 570.4MB. Free memory is still 369.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:54:00,399 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.13ms. Allocated memory is still 60.8MB. Free memory is still 37.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 456.97ms. Allocated memory is still 73.4MB. Free memory was 49.2MB in the beginning and 43.9MB in the end (delta: 5.3MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.64ms. Allocated memory is still 73.4MB. Free memory was 43.9MB in the beginning and 41.2MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.67ms. Allocated memory is still 73.4MB. Free memory was 41.2MB in the beginning and 39.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 634.86ms. Allocated memory is still 73.4MB. Free memory was 38.9MB in the beginning and 41.9MB in the end (delta: -3.1MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. * TraceAbstraction took 15056.92ms. Allocated memory was 73.4MB in the beginning and 570.4MB in the end (delta: 497.0MB). Free memory was 41.5MB in the beginning and 370.7MB in the end (delta: -329.2MB). Peak memory consumption was 166.1MB. Max. memory is 16.1GB. * Witness Printer took 2.23ms. Allocated memory is still 570.4MB. Free memory is still 369.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.7s, 151 PlacesBefore, 50 PlacesAfterwards, 140 TransitionsBefore, 38 TransitionsAfterwards, 3128 CoEnabledTransitionPairs, 7 FixpointIterations, 57 TrivialSequentialCompositions, 71 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 136 TotalNumberOfCompositions, 7423 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4376, independent: 4186, independent conditional: 0, independent unconditional: 4186, dependent: 190, dependent conditional: 0, dependent unconditional: 190, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1657, independent: 1633, independent conditional: 0, independent unconditional: 1633, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4376, independent: 2553, independent conditional: 0, independent unconditional: 2553, dependent: 166, dependent conditional: 0, dependent unconditional: 166, unknown: 1657, unknown conditional: 0, unknown unconditional: 1657] , Statistics on independence cache: Total cache size (in pairs): 181, Positive cache size: 168, Positive conditional cache size: 0, Positive unconditional cache size: 168, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L724] 0 int b = 0; [L725] 0 _Bool main$tmp_guard0; [L726] 0 _Bool main$tmp_guard1; [L728] 0 int x = 0; [L730] 0 int y = 0; [L732] 0 int z = 0; [L733] 0 _Bool z$flush_delayed; [L734] 0 int z$mem_tmp; [L735] 0 _Bool z$r_buff0_thd0; [L736] 0 _Bool z$r_buff0_thd1; [L737] 0 _Bool z$r_buff0_thd2; [L738] 0 _Bool z$r_buff0_thd3; [L739] 0 _Bool z$r_buff0_thd4; [L740] 0 _Bool z$r_buff1_thd0; [L741] 0 _Bool z$r_buff1_thd1; [L742] 0 _Bool z$r_buff1_thd2; [L743] 0 _Bool z$r_buff1_thd3; [L744] 0 _Bool z$r_buff1_thd4; [L745] 0 _Bool z$read_delayed; [L746] 0 int *z$read_delayed_var; [L747] 0 int z$w_buff0; [L748] 0 _Bool z$w_buff0_used; [L749] 0 int z$w_buff1; [L750] 0 _Bool z$w_buff1_used; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L858] 0 pthread_t t949; [L859] FCALL, FORK 0 pthread_create(&t949, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t949, ((void *)0), P0, ((void *)0))=0, t949={11:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L860] 0 pthread_t t950; [L861] FCALL, FORK 0 pthread_create(&t950, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t950, ((void *)0), P1, ((void *)0))=1, t949={11:0}, t950={15:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L862] 0 pthread_t t951; [L863] FCALL, FORK 0 pthread_create(&t951, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t951, ((void *)0), P2, ((void *)0))=2, t949={11:0}, t950={15:0}, t951={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L864] 0 pthread_t t952; [L865] FCALL, FORK 0 pthread_create(&t952, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t952, ((void *)0), P3, ((void *)0))=3, t949={11:0}, t950={15:0}, t951={7:0}, t952={-2147483637:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L814] 4 z$w_buff1 = z$w_buff0 [L815] 4 z$w_buff0 = 1 [L816] 4 z$w_buff1_used = z$w_buff0_used [L817] 4 z$w_buff0_used = (_Bool)1 [L818] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L818] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L819] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L820] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L821] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L822] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L823] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L824] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L827] 4 a = 1 [L830] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L833] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L756] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L759] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L771] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L774] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L786] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 1 return 0; [L789] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L790] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L791] 3 z$flush_delayed = weak$$choice2 [L792] 3 z$mem_tmp = z [L793] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L794] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L795] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L796] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L797] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L799] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L800] 3 __unbuffered_p2_EAX = z [L801] 3 z = z$flush_delayed ? z$mem_tmp : z [L802] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L779] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 2 return 0; [L807] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L809] 3 return 0; [L836] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L837] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L838] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L839] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L840] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L845] 4 return 0; [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L869] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L869] RET 0 assume_abort_if_not(main$tmp_guard0) [L871] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L872] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L873] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L874] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L875] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t949={11:0}, t950={15:0}, t951={7:0}, t952={-2147483637:0}, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L878] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L880] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, 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: 856]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 865]: 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: 863]: 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: 859]: 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: 861]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 179 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 14.9s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 517 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 438 mSDsluCounter, 137 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 126 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2156 IncrementalHoareTripleChecker+Invalid, 2195 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 11 mSDtfsCounter, 2156 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 208 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=222occurred in iteration=5, InterpolantAutomatonStates: 60, 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.4s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 232 NumberOfCodeBlocks, 232 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 195 ConstructedInterpolants, 21 QuantifiedInterpolants, 1760 SizeOfPredicates, 19 NumberOfNonLiveVariables, 1657 ConjunctsInSsa, 78 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:54:00,420 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