./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix017_pso.opt_tso.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix017_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 39f434d3f7e7749f4257e03557066c1349e963b1d489e771c14fc3ff33c9a6c7 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 20:18:46,433 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:18:46,435 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:18:46,460 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:18:46,460 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:18:46,461 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:18:46,462 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:18:46,464 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:18:46,465 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:18:46,466 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:18:46,467 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:18:46,468 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:18:46,468 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:18:46,469 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:18:46,470 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:18:46,471 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:18:46,472 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:18:46,473 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:18:46,474 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:18:46,475 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:18:46,477 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:18:46,478 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:18:46,479 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:18:46,479 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:18:46,482 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:18:46,483 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:18:46,483 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:18:46,484 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:18:46,484 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:18:46,485 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:18:46,485 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:18:46,486 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:18:46,487 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:18:46,487 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:18:46,488 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:18:46,489 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:18:46,489 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:18:46,489 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:18:46,490 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:18:46,491 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:18:46,491 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:18:46,495 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-29 20:18:46,535 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:18:46,536 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:18:46,537 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:18:46,537 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:18:46,538 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:18:46,538 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:18:46,539 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:18:46,539 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:18:46,539 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:18:46,539 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:18:46,540 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:18:46,540 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:18:46,540 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:18:46,540 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:18:46,541 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:18:46,541 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:18:46,541 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:18:46,541 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:18:46,541 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:18:46,541 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:18:46,542 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:18:46,542 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:18:46,542 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:18:46,542 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:18:46,542 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:18:46,542 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:18:46,543 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:18:46,543 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:18:46,543 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 20:18:46,543 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 20:18:46,543 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:18:46,544 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:18:46,544 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:18:46,544 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:18:46,544 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 -> 39f434d3f7e7749f4257e03557066c1349e963b1d489e771c14fc3ff33c9a6c7 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-29 20:18:46,860 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:18:46,876 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:18:46,878 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:18:46,879 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:18:46,880 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:18:46,881 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix017_pso.opt_tso.opt.i [2023-08-29 20:18:48,112 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:18:48,351 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:18:48,351 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix017_pso.opt_tso.opt.i [2023-08-29 20:18:48,365 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a76d8612/78eb8de74e0d4cb2b327ee0328609400/FLAGead3fa4f0 [2023-08-29 20:18:48,379 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a76d8612/78eb8de74e0d4cb2b327ee0328609400 [2023-08-29 20:18:48,381 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:18:48,382 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:18:48,383 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:18:48,383 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:18:48,386 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:18:48,386 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:18:48" (1/1) ... [2023-08-29 20:18:48,387 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@229c7ea1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:18:48, skipping insertion in model container [2023-08-29 20:18:48,387 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:18:48" (1/1) ... [2023-08-29 20:18:48,392 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:18:48,429 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:18:48,557 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/mix017_pso.opt_tso.opt.i[956,969] [2023-08-29 20:18:48,805 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:18:48,817 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:18:48,828 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/mix017_pso.opt_tso.opt.i[956,969] [2023-08-29 20:18:48,866 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:18:48,902 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:18:48,902 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:18:48,908 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:18:48,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:18:48 WrapperNode [2023-08-29 20:18:48,909 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:18:48,910 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:18:48,910 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:18:48,910 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:18:48,915 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:18:48" (1/1) ... [2023-08-29 20:18:48,945 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:18:48" (1/1) ... [2023-08-29 20:18:48,979 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 166 [2023-08-29 20:18:48,987 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:18:48,987 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:18:48,988 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:18:48,988 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:18:48,995 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:18:48" (1/1) ... [2023-08-29 20:18:48,996 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:18:48" (1/1) ... [2023-08-29 20:18:48,998 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:18:48" (1/1) ... [2023-08-29 20:18:49,000 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:18:48" (1/1) ... [2023-08-29 20:18:49,022 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:18:48" (1/1) ... [2023-08-29 20:18:49,024 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:18:48" (1/1) ... [2023-08-29 20:18:49,026 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:18:48" (1/1) ... [2023-08-29 20:18:49,027 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:18:48" (1/1) ... [2023-08-29 20:18:49,030 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:18:49,031 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:18:49,031 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:18:49,031 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:18:49,032 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:18:48" (1/1) ... [2023-08-29 20:18:49,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:18:49,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:18:49,078 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-29 20:18:49,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-29 20:18:49,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 20:18:49,116 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:18:49,116 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:18:49,116 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:18:49,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:18:49,118 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:18:49,118 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:18:49,119 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:18:49,119 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:18:49,119 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-29 20:18:49,119 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-29 20:18:49,119 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-29 20:18:49,119 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-29 20:18:49,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-29 20:18:49,120 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:18:49,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:18:49,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:18:49,121 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 20:18:49,236 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:18:49,238 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:18:49,634 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:18:49,776 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:18:49,776 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:18:49,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:18:49 BoogieIcfgContainer [2023-08-29 20:18:49,778 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:18:49,780 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:18:49,781 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:18:49,783 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:18:49,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:18:48" (1/3) ... [2023-08-29 20:18:49,784 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@323aa75b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:18:49, skipping insertion in model container [2023-08-29 20:18:49,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:18:48" (2/3) ... [2023-08-29 20:18:49,784 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@323aa75b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:18:49, skipping insertion in model container [2023-08-29 20:18:49,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:18:49" (3/3) ... [2023-08-29 20:18:49,786 INFO L112 eAbstractionObserver]: Analyzing ICFG mix017_pso.opt_tso.opt.i [2023-08-29 20:18:49,797 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:18:49,798 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-29 20:18:49,798 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:18:49,867 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:18:49,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 141 transitions, 302 flow [2023-08-29 20:18:49,958 INFO L130 PetriNetUnfolder]: 2/137 cut-off events. [2023-08-29 20:18:49,959 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:18:49,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 137 events. 2/137 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 91 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 94. Up to 2 conditions per place. [2023-08-29 20:18:49,963 INFO L82 GeneralOperation]: Start removeDead. Operand has 152 places, 141 transitions, 302 flow [2023-08-29 20:18:49,972 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 148 places, 137 transitions, 286 flow [2023-08-29 20:18:49,976 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:18:49,995 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 137 transitions, 286 flow [2023-08-29 20:18:49,998 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 137 transitions, 286 flow [2023-08-29 20:18:49,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 137 transitions, 286 flow [2023-08-29 20:18:50,045 INFO L130 PetriNetUnfolder]: 2/137 cut-off events. [2023-08-29 20:18:50,045 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:18:50,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 137 events. 2/137 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 89 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 94. Up to 2 conditions per place. [2023-08-29 20:18:50,048 INFO L119 LiptonReduction]: Number of co-enabled transitions 3024 [2023-08-29 20:18:54,451 INFO L134 LiptonReduction]: Checked pairs total: 6935 [2023-08-29 20:18:54,451 INFO L136 LiptonReduction]: Total number of compositions: 131 [2023-08-29 20:18:54,464 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:18:54,469 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;@f688679, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:18:54,469 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-29 20:18:54,470 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-29 20:18:54,471 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:18:54,471 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:18:54,471 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:18:54,472 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-29 20:18:54,475 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:18:54,476 INFO L85 PathProgramCache]: Analyzing trace with hash 604, now seen corresponding path program 1 times [2023-08-29 20:18:54,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:18:54,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248537528] [2023-08-29 20:18:54,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:18:54,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:18:54,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:18:54,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:18:54,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:18:54,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248537528] [2023-08-29 20:18:54,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248537528] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:18:54,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:18:54,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:18:54,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053910498] [2023-08-29 20:18:54,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:18:54,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:18:54,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:18:54,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:18:54,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:18:54,603 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 272 [2023-08-29 20:18:54,605 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 84 flow. Second operand has 2 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:54,605 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:18:54,605 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 272 [2023-08-29 20:18:54,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:18:55,346 INFO L130 PetriNetUnfolder]: 3743/5215 cut-off events. [2023-08-29 20:18:55,346 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2023-08-29 20:18:55,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10455 conditions, 5215 events. 3743/5215 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 26002 event pairs, 3743 based on Foata normal form. 0/4527 useless extension candidates. Maximal degree in co-relation 10443. Up to 5137 conditions per place. [2023-08-29 20:18:55,379 INFO L137 encePairwiseOnDemand]: 264/272 looper letters, 25 selfloop transitions, 0 changer transitions 0/28 dead transitions. [2023-08-29 20:18:55,379 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 28 transitions, 118 flow [2023-08-29 20:18:55,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:18:55,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:18:55,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 289 transitions. [2023-08-29 20:18:55,398 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.53125 [2023-08-29 20:18:55,398 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 289 transitions. [2023-08-29 20:18:55,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 289 transitions. [2023-08-29 20:18:55,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:18:55,403 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 289 transitions. [2023-08-29 20:18:55,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 144.5) internal successors, (289), 2 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:55,411 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-29 20:18:55,412 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-29 20:18:55,413 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 84 flow. Second operand 2 states and 289 transitions. [2023-08-29 20:18:55,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 28 transitions, 118 flow [2023-08-29 20:18:55,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 28 transitions, 114 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-29 20:18:55,421 INFO L231 Difference]: Finished difference. Result has 38 places, 28 transitions, 64 flow [2023-08-29 20:18:55,422 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=64, PETRI_PLACES=38, PETRI_TRANSITIONS=28} [2023-08-29 20:18:55,425 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -11 predicate places. [2023-08-29 20:18:55,425 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 28 transitions, 64 flow [2023-08-29 20:18:55,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:55,427 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:18:55,427 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:18:55,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 20:18:55,430 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-29 20:18:55,431 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:18:55,431 INFO L85 PathProgramCache]: Analyzing trace with hash -545443019, now seen corresponding path program 1 times [2023-08-29 20:18:55,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:18:55,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526345665] [2023-08-29 20:18:55,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:18:55,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:18:55,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:18:55,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:18:55,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:18:55,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526345665] [2023-08-29 20:18:55,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526345665] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:18:55,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:18:55,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:18:55,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220461747] [2023-08-29 20:18:55,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:18:55,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:18:55,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:18:55,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:18:55,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:18:55,771 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 272 [2023-08-29 20:18:55,772 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 28 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:55,772 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:18:55,772 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 272 [2023-08-29 20:18:55,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:18:56,324 INFO L130 PetriNetUnfolder]: 3113/4513 cut-off events. [2023-08-29 20:18:56,325 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:18:56,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8904 conditions, 4513 events. 3113/4513 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 24026 event pairs, 593 based on Foata normal form. 0/4149 useless extension candidates. Maximal degree in co-relation 8901. Up to 3385 conditions per place. [2023-08-29 20:18:56,346 INFO L137 encePairwiseOnDemand]: 269/272 looper letters, 32 selfloop transitions, 2 changer transitions 2/39 dead transitions. [2023-08-29 20:18:56,346 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 39 transitions, 158 flow [2023-08-29 20:18:56,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:18:56,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:18:56,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 418 transitions. [2023-08-29 20:18:56,350 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5122549019607843 [2023-08-29 20:18:56,350 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 418 transitions. [2023-08-29 20:18:56,350 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 418 transitions. [2023-08-29 20:18:56,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:18:56,350 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 418 transitions. [2023-08-29 20:18:56,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:56,355 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-29 20:18:56,355 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-29 20:18:56,356 INFO L175 Difference]: Start difference. First operand has 38 places, 28 transitions, 64 flow. Second operand 3 states and 418 transitions. [2023-08-29 20:18:56,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 39 transitions, 158 flow [2023-08-29 20:18:56,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 39 transitions, 158 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:18:56,358 INFO L231 Difference]: Finished difference. Result has 39 places, 26 transitions, 64 flow [2023-08-29 20:18:56,358 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=39, PETRI_TRANSITIONS=26} [2023-08-29 20:18:56,359 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -10 predicate places. [2023-08-29 20:18:56,359 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 26 transitions, 64 flow [2023-08-29 20:18:56,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:56,359 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:18:56,359 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:18:56,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-29 20:18:56,360 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-29 20:18:56,363 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:18:56,363 INFO L85 PathProgramCache]: Analyzing trace with hash -184676579, now seen corresponding path program 1 times [2023-08-29 20:18:56,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:18:56,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096017655] [2023-08-29 20:18:56,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:18:56,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:18:56,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:18:56,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:18:56,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:18:56,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096017655] [2023-08-29 20:18:56,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096017655] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:18:56,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:18:56,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:18:56,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284179104] [2023-08-29 20:18:56,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:18:56,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:18:56,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:18:56,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:18:56,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:18:56,723 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 272 [2023-08-29 20:18:56,724 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 26 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:56,726 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:18:56,726 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 272 [2023-08-29 20:18:56,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:18:57,142 INFO L130 PetriNetUnfolder]: 2372/3448 cut-off events. [2023-08-29 20:18:57,143 INFO L131 PetriNetUnfolder]: For 117/117 co-relation queries the response was YES. [2023-08-29 20:18:57,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6992 conditions, 3448 events. 2372/3448 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 17264 event pairs, 923 based on Foata normal form. 0/3336 useless extension candidates. Maximal degree in co-relation 6988. Up to 2062 conditions per place. [2023-08-29 20:18:57,162 INFO L137 encePairwiseOnDemand]: 269/272 looper letters, 31 selfloop transitions, 2 changer transitions 0/36 dead transitions. [2023-08-29 20:18:57,162 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 36 transitions, 150 flow [2023-08-29 20:18:57,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:18:57,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:18:57,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 415 transitions. [2023-08-29 20:18:57,164 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.508578431372549 [2023-08-29 20:18:57,164 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 415 transitions. [2023-08-29 20:18:57,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 415 transitions. [2023-08-29 20:18:57,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:18:57,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 415 transitions. [2023-08-29 20:18:57,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:57,168 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-29 20:18:57,168 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-29 20:18:57,168 INFO L175 Difference]: Start difference. First operand has 39 places, 26 transitions, 64 flow. Second operand 3 states and 415 transitions. [2023-08-29 20:18:57,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 36 transitions, 150 flow [2023-08-29 20:18:57,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 36 transitions, 146 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:18:57,171 INFO L231 Difference]: Finished difference. Result has 39 places, 26 transitions, 68 flow [2023-08-29 20:18:57,171 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=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=39, PETRI_TRANSITIONS=26} [2023-08-29 20:18:57,172 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -10 predicate places. [2023-08-29 20:18:57,172 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 26 transitions, 68 flow [2023-08-29 20:18:57,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:57,173 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:18:57,173 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:18:57,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-29 20:18:57,174 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:18:57,174 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:18:57,174 INFO L85 PathProgramCache]: Analyzing trace with hash -184676571, now seen corresponding path program 1 times [2023-08-29 20:18:57,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:18:57,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854654519] [2023-08-29 20:18:57,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:18:57,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:18:57,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:18:57,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:18:57,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:18:57,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854654519] [2023-08-29 20:18:57,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854654519] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:18:57,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:18:57,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:18:57,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188283859] [2023-08-29 20:18:57,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:18:57,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:18:57,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:18:57,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:18:57,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:18:57,837 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 272 [2023-08-29 20:18:57,838 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 26 transitions, 68 flow. Second operand has 6 states, 6 states have (on average 112.83333333333333) internal successors, (677), 6 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:57,838 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:18:57,839 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 272 [2023-08-29 20:18:57,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:18:58,253 INFO L130 PetriNetUnfolder]: 2150/3115 cut-off events. [2023-08-29 20:18:58,253 INFO L131 PetriNetUnfolder]: For 144/144 co-relation queries the response was YES. [2023-08-29 20:18:58,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6546 conditions, 3115 events. 2150/3115 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 15245 event pairs, 231 based on Foata normal form. 72/3187 useless extension candidates. Maximal degree in co-relation 6541. Up to 2026 conditions per place. [2023-08-29 20:18:58,273 INFO L137 encePairwiseOnDemand]: 266/272 looper letters, 40 selfloop transitions, 5 changer transitions 0/48 dead transitions. [2023-08-29 20:18:58,273 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 48 transitions, 202 flow [2023-08-29 20:18:58,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:18:58,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:18:58,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 712 transitions. [2023-08-29 20:18:58,275 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4362745098039216 [2023-08-29 20:18:58,276 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 712 transitions. [2023-08-29 20:18:58,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 712 transitions. [2023-08-29 20:18:58,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:18:58,276 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 712 transitions. [2023-08-29 20:18:58,278 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 118.66666666666667) internal successors, (712), 6 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:58,280 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 272.0) internal successors, (1904), 7 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:58,281 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 272.0) internal successors, (1904), 7 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:58,281 INFO L175 Difference]: Start difference. First operand has 39 places, 26 transitions, 68 flow. Second operand 6 states and 712 transitions. [2023-08-29 20:18:58,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 48 transitions, 202 flow [2023-08-29 20:18:58,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 48 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:18:58,284 INFO L231 Difference]: Finished difference. Result has 43 places, 26 transitions, 78 flow [2023-08-29 20:18:58,284 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, 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=6, PETRI_FLOW=78, PETRI_PLACES=43, PETRI_TRANSITIONS=26} [2023-08-29 20:18:58,285 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -6 predicate places. [2023-08-29 20:18:58,285 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 26 transitions, 78 flow [2023-08-29 20:18:58,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.83333333333333) internal successors, (677), 6 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:58,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:18:58,286 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:18:58,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-29 20:18:58,286 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:18:58,287 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:18:58,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1416508798, now seen corresponding path program 1 times [2023-08-29 20:18:58,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:18:58,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133697332] [2023-08-29 20:18:58,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:18:58,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:18:58,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:18:59,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:18:59,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:18:59,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133697332] [2023-08-29 20:18:59,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133697332] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:18:59,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:18:59,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-29 20:18:59,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852328054] [2023-08-29 20:18:59,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:18:59,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 20:18:59,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:18:59,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 20:18:59,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-08-29 20:18:59,896 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 272 [2023-08-29 20:18:59,897 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 26 transitions, 78 flow. Second operand has 9 states, 9 states have (on average 106.44444444444444) internal successors, (958), 9 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:59,897 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:18:59,897 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 272 [2023-08-29 20:18:59,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:19:00,602 INFO L130 PetriNetUnfolder]: 2948/4273 cut-off events. [2023-08-29 20:19:00,602 INFO L131 PetriNetUnfolder]: For 464/464 co-relation queries the response was YES. [2023-08-29 20:19:00,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9271 conditions, 4273 events. 2948/4273 cut-off events. For 464/464 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 22519 event pairs, 627 based on Foata normal form. 108/4381 useless extension candidates. Maximal degree in co-relation 9265. Up to 2167 conditions per place. [2023-08-29 20:19:00,630 INFO L137 encePairwiseOnDemand]: 263/272 looper letters, 57 selfloop transitions, 10 changer transitions 0/70 dead transitions. [2023-08-29 20:19:00,630 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 70 transitions, 311 flow [2023-08-29 20:19:00,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:19:00,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:19:00,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 908 transitions. [2023-08-29 20:19:00,634 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4172794117647059 [2023-08-29 20:19:00,634 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 908 transitions. [2023-08-29 20:19:00,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 908 transitions. [2023-08-29 20:19:00,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:19:00,635 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 908 transitions. [2023-08-29 20:19:00,637 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 113.5) internal successors, (908), 8 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:00,641 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-29 20:19:00,642 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-29 20:19:00,642 INFO L175 Difference]: Start difference. First operand has 43 places, 26 transitions, 78 flow. Second operand 8 states and 908 transitions. [2023-08-29 20:19:00,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 70 transitions, 311 flow [2023-08-29 20:19:00,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 70 transitions, 297 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-29 20:19:00,647 INFO L231 Difference]: Finished difference. Result has 49 places, 34 transitions, 132 flow [2023-08-29 20:19:00,647 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=132, PETRI_PLACES=49, PETRI_TRANSITIONS=34} [2023-08-29 20:19:00,649 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 0 predicate places. [2023-08-29 20:19:00,649 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 34 transitions, 132 flow [2023-08-29 20:19:00,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 106.44444444444444) internal successors, (958), 9 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:00,650 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:19:00,650 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:19:00,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-29 20:19:00,650 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-29 20:19:00,651 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:19:00,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1383440796, now seen corresponding path program 1 times [2023-08-29 20:19:00,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:19:00,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810488834] [2023-08-29 20:19:00,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:19:00,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:19:00,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:19:00,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:19:00,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:19:00,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810488834] [2023-08-29 20:19:00,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810488834] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:19:00,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:19:00,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:19:00,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756054276] [2023-08-29 20:19:00,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:19:00,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:19:00,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:19:00,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:19:00,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:19:01,007 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 272 [2023-08-29 20:19:01,008 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 34 transitions, 132 flow. Second operand has 4 states, 4 states have (on average 124.25) internal successors, (497), 4 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:01,009 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:19:01,009 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 272 [2023-08-29 20:19:01,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:19:01,480 INFO L130 PetriNetUnfolder]: 2552/3786 cut-off events. [2023-08-29 20:19:01,480 INFO L131 PetriNetUnfolder]: For 1063/1063 co-relation queries the response was YES. [2023-08-29 20:19:01,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9126 conditions, 3786 events. 2552/3786 cut-off events. For 1063/1063 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 20301 event pairs, 325 based on Foata normal form. 234/4017 useless extension candidates. Maximal degree in co-relation 9116. Up to 2110 conditions per place. [2023-08-29 20:19:01,504 INFO L137 encePairwiseOnDemand]: 265/272 looper letters, 63 selfloop transitions, 6 changer transitions 1/73 dead transitions. [2023-08-29 20:19:01,505 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 73 transitions, 420 flow [2023-08-29 20:19:01,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:19:01,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:19:01,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 538 transitions. [2023-08-29 20:19:01,507 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4944852941176471 [2023-08-29 20:19:01,507 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 538 transitions. [2023-08-29 20:19:01,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 538 transitions. [2023-08-29 20:19:01,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:19:01,508 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 538 transitions. [2023-08-29 20:19:01,509 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.5) internal successors, (538), 4 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:01,510 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 272.0) internal successors, (1360), 5 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:01,511 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 272.0) internal successors, (1360), 5 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:01,511 INFO L175 Difference]: Start difference. First operand has 49 places, 34 transitions, 132 flow. Second operand 4 states and 538 transitions. [2023-08-29 20:19:01,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 73 transitions, 420 flow [2023-08-29 20:19:01,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 73 transitions, 413 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:19:01,518 INFO L231 Difference]: Finished difference. Result has 52 places, 38 transitions, 174 flow [2023-08-29 20:19:01,519 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=174, PETRI_PLACES=52, PETRI_TRANSITIONS=38} [2023-08-29 20:19:01,521 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 3 predicate places. [2023-08-29 20:19:01,521 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 38 transitions, 174 flow [2023-08-29 20:19:01,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.25) internal successors, (497), 4 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:01,522 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:19:01,522 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:19:01,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-29 20:19:01,523 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-29 20:19:01,523 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:19:01,523 INFO L85 PathProgramCache]: Analyzing trace with hash -784367166, now seen corresponding path program 1 times [2023-08-29 20:19:01,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:19:01,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137477967] [2023-08-29 20:19:01,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:19:01,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:19:01,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:19:01,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:19:01,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:19:01,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137477967] [2023-08-29 20:19:01,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137477967] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:19:01,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:19:01,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:19:01,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967514047] [2023-08-29 20:19:01,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:19:01,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:19:01,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:19:01,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:19:01,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:19:01,857 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 272 [2023-08-29 20:19:01,858 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 38 transitions, 174 flow. Second operand has 5 states, 5 states have (on average 124.0) internal successors, (620), 5 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:01,858 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:19:01,858 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 272 [2023-08-29 20:19:01,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:19:02,173 INFO L130 PetriNetUnfolder]: 1412/2214 cut-off events. [2023-08-29 20:19:02,174 INFO L131 PetriNetUnfolder]: For 1650/1650 co-relation queries the response was YES. [2023-08-29 20:19:02,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6771 conditions, 2214 events. 1412/2214 cut-off events. For 1650/1650 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 11411 event pairs, 127 based on Foata normal form. 178/2389 useless extension candidates. Maximal degree in co-relation 6758. Up to 842 conditions per place. [2023-08-29 20:19:02,186 INFO L137 encePairwiseOnDemand]: 265/272 looper letters, 80 selfloop transitions, 10 changer transitions 1/94 dead transitions. [2023-08-29 20:19:02,186 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 94 transitions, 595 flow [2023-08-29 20:19:02,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:19:02,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:19:02,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 674 transitions. [2023-08-29 20:19:02,189 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49558823529411766 [2023-08-29 20:19:02,189 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 674 transitions. [2023-08-29 20:19:02,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 674 transitions. [2023-08-29 20:19:02,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:19:02,189 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 674 transitions. [2023-08-29 20:19:02,191 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.8) internal successors, (674), 5 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:02,193 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-29 20:19:02,193 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-29 20:19:02,193 INFO L175 Difference]: Start difference. First operand has 52 places, 38 transitions, 174 flow. Second operand 5 states and 674 transitions. [2023-08-29 20:19:02,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 94 transitions, 595 flow [2023-08-29 20:19:02,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 94 transitions, 582 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-29 20:19:02,198 INFO L231 Difference]: Finished difference. Result has 56 places, 42 transitions, 228 flow [2023-08-29 20:19:02,199 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=228, PETRI_PLACES=56, PETRI_TRANSITIONS=42} [2023-08-29 20:19:02,199 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 7 predicate places. [2023-08-29 20:19:02,199 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 42 transitions, 228 flow [2023-08-29 20:19:02,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 124.0) internal successors, (620), 5 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:02,200 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:19:02,200 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:19:02,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-29 20:19:02,200 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-29 20:19:02,201 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:19:02,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1020232436, now seen corresponding path program 1 times [2023-08-29 20:19:02,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:19:02,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471622056] [2023-08-29 20:19:02,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:19:02,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:19:02,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:19:02,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:19:02,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:19:02,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471622056] [2023-08-29 20:19:02,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471622056] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:19:02,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:19:02,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:19:02,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138120760] [2023-08-29 20:19:02,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:19:02,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:19:02,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:19:02,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:19:02,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:19:02,376 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 272 [2023-08-29 20:19:02,377 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 42 transitions, 228 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-29 20:19:02,377 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:19:02,377 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 272 [2023-08-29 20:19:02,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:19:02,738 INFO L130 PetriNetUnfolder]: 1832/3018 cut-off events. [2023-08-29 20:19:02,738 INFO L131 PetriNetUnfolder]: For 4687/4687 co-relation queries the response was YES. [2023-08-29 20:19:02,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10623 conditions, 3018 events. 1832/3018 cut-off events. For 4687/4687 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 17236 event pairs, 390 based on Foata normal form. 46/3064 useless extension candidates. Maximal degree in co-relation 10609. Up to 1598 conditions per place. [2023-08-29 20:19:02,758 INFO L137 encePairwiseOnDemand]: 269/272 looper letters, 99 selfloop transitions, 2 changer transitions 1/104 dead transitions. [2023-08-29 20:19:02,758 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 104 transitions, 795 flow [2023-08-29 20:19:02,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:19:02,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:19:02,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 555 transitions. [2023-08-29 20:19:02,782 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5101102941176471 [2023-08-29 20:19:02,782 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 555 transitions. [2023-08-29 20:19:02,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 555 transitions. [2023-08-29 20:19:02,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:19:02,783 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 555 transitions. [2023-08-29 20:19:02,784 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 138.75) internal successors, (555), 4 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:02,786 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 272.0) internal successors, (1360), 5 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:02,786 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 272.0) internal successors, (1360), 5 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:02,786 INFO L175 Difference]: Start difference. First operand has 56 places, 42 transitions, 228 flow. Second operand 4 states and 555 transitions. [2023-08-29 20:19:02,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 104 transitions, 795 flow [2023-08-29 20:19:02,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 104 transitions, 719 flow, removed 16 selfloop flow, removed 4 redundant places. [2023-08-29 20:19:02,803 INFO L231 Difference]: Finished difference. Result has 57 places, 43 transitions, 212 flow [2023-08-29 20:19:02,803 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=212, PETRI_PLACES=57, PETRI_TRANSITIONS=43} [2023-08-29 20:19:02,803 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 8 predicate places. [2023-08-29 20:19:02,803 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 43 transitions, 212 flow [2023-08-29 20:19:02,804 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-29 20:19:02,804 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:19:02,804 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:19:02,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-29 20:19:02,804 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-29 20:19:02,805 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:19:02,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1890494012, now seen corresponding path program 2 times [2023-08-29 20:19:02,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:19:02,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500143522] [2023-08-29 20:19:02,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:19:02,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:19:02,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:19:03,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:19:03,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:19:03,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500143522] [2023-08-29 20:19:03,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500143522] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:19:03,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:19:03,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:19:03,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34169828] [2023-08-29 20:19:03,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:19:03,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:19:03,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:19:03,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:19:03,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:19:03,048 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 272 [2023-08-29 20:19:03,048 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 43 transitions, 212 flow. Second operand has 6 states, 6 states have (on average 123.83333333333333) internal successors, (743), 6 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:03,049 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:19:03,049 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 272 [2023-08-29 20:19:03,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:19:03,357 INFO L130 PetriNetUnfolder]: 1137/1880 cut-off events. [2023-08-29 20:19:03,358 INFO L131 PetriNetUnfolder]: For 2527/2537 co-relation queries the response was YES. [2023-08-29 20:19:03,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6305 conditions, 1880 events. 1137/1880 cut-off events. For 2527/2537 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 9919 event pairs, 143 based on Foata normal form. 142/1978 useless extension candidates. Maximal degree in co-relation 6290. Up to 594 conditions per place. [2023-08-29 20:19:03,369 INFO L137 encePairwiseOnDemand]: 265/272 looper letters, 83 selfloop transitions, 14 changer transitions 1/102 dead transitions. [2023-08-29 20:19:03,369 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 102 transitions, 667 flow [2023-08-29 20:19:03,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:19:03,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:19:03,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 808 transitions. [2023-08-29 20:19:03,372 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4950980392156863 [2023-08-29 20:19:03,372 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 808 transitions. [2023-08-29 20:19:03,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 808 transitions. [2023-08-29 20:19:03,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:19:03,373 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 808 transitions. [2023-08-29 20:19:03,374 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 134.66666666666666) internal successors, (808), 6 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:03,376 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 272.0) internal successors, (1904), 7 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:03,377 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 272.0) internal successors, (1904), 7 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:03,377 INFO L175 Difference]: Start difference. First operand has 57 places, 43 transitions, 212 flow. Second operand 6 states and 808 transitions. [2023-08-29 20:19:03,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 102 transitions, 667 flow [2023-08-29 20:19:03,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 102 transitions, 652 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:19:03,381 INFO L231 Difference]: Finished difference. Result has 62 places, 45 transitions, 271 flow [2023-08-29 20:19:03,381 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=271, PETRI_PLACES=62, PETRI_TRANSITIONS=45} [2023-08-29 20:19:03,382 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 13 predicate places. [2023-08-29 20:19:03,382 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 45 transitions, 271 flow [2023-08-29 20:19:03,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 123.83333333333333) internal successors, (743), 6 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:03,383 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:19:03,383 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:19:03,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-29 20:19:03,383 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-29 20:19:03,384 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:19:03,384 INFO L85 PathProgramCache]: Analyzing trace with hash 893555097, now seen corresponding path program 1 times [2023-08-29 20:19:03,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:19:03,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027277123] [2023-08-29 20:19:03,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:19:03,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:19:03,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:19:03,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:19:03,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:19:03,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027277123] [2023-08-29 20:19:03,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027277123] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:19:03,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:19:03,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:19:03,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253696702] [2023-08-29 20:19:03,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:19:03,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:19:03,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:19:03,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:19:03,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:19:03,641 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 272 [2023-08-29 20:19:03,642 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 45 transitions, 271 flow. Second operand has 5 states, 5 states have (on average 122.4) internal successors, (612), 5 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:03,643 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:19:03,643 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 272 [2023-08-29 20:19:03,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:19:04,157 INFO L130 PetriNetUnfolder]: 2620/4179 cut-off events. [2023-08-29 20:19:04,157 INFO L131 PetriNetUnfolder]: For 9133/9133 co-relation queries the response was YES. [2023-08-29 20:19:04,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16071 conditions, 4179 events. 2620/4179 cut-off events. For 9133/9133 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 22428 event pairs, 281 based on Foata normal form. 19/4198 useless extension candidates. Maximal degree in co-relation 16055. Up to 2183 conditions per place. [2023-08-29 20:19:04,184 INFO L137 encePairwiseOnDemand]: 263/272 looper letters, 115 selfloop transitions, 17 changer transitions 2/134 dead transitions. [2023-08-29 20:19:04,184 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 134 transitions, 1066 flow [2023-08-29 20:19:04,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:19:04,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:19:04,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 795 transitions. [2023-08-29 20:19:04,187 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48713235294117646 [2023-08-29 20:19:04,187 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 795 transitions. [2023-08-29 20:19:04,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 795 transitions. [2023-08-29 20:19:04,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:19:04,188 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 795 transitions. [2023-08-29 20:19:04,190 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 132.5) internal successors, (795), 6 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:04,192 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 272.0) internal successors, (1904), 7 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:04,193 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 272.0) internal successors, (1904), 7 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:04,193 INFO L175 Difference]: Start difference. First operand has 62 places, 45 transitions, 271 flow. Second operand 6 states and 795 transitions. [2023-08-29 20:19:04,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 134 transitions, 1066 flow [2023-08-29 20:19:04,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 134 transitions, 950 flow, removed 25 selfloop flow, removed 5 redundant places. [2023-08-29 20:19:04,236 INFO L231 Difference]: Finished difference. Result has 66 places, 60 transitions, 380 flow [2023-08-29 20:19:04,237 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=380, PETRI_PLACES=66, PETRI_TRANSITIONS=60} [2023-08-29 20:19:04,237 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 17 predicate places. [2023-08-29 20:19:04,237 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 60 transitions, 380 flow [2023-08-29 20:19:04,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 122.4) internal successors, (612), 5 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:04,238 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:19:04,238 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:19:04,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-29 20:19:04,238 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-29 20:19:04,239 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:19:04,239 INFO L85 PathProgramCache]: Analyzing trace with hash -811677841, now seen corresponding path program 2 times [2023-08-29 20:19:04,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:19:04,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533162507] [2023-08-29 20:19:04,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:19:04,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:19:04,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:19:04,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:19:04,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:19:04,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533162507] [2023-08-29 20:19:04,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533162507] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:19:04,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:19:04,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:19:04,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620784270] [2023-08-29 20:19:04,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:19:04,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:19:04,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:19:04,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:19:04,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:19:04,783 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 272 [2023-08-29 20:19:04,785 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 60 transitions, 380 flow. Second operand has 7 states, 7 states have (on average 123.85714285714286) internal successors, (867), 7 states have internal predecessors, (867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:04,785 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:19:04,786 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 272 [2023-08-29 20:19:04,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:19:05,205 INFO L130 PetriNetUnfolder]: 1675/2802 cut-off events. [2023-08-29 20:19:05,205 INFO L131 PetriNetUnfolder]: For 4563/4713 co-relation queries the response was YES. [2023-08-29 20:19:05,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10082 conditions, 2802 events. 1675/2802 cut-off events. For 4563/4713 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 16488 event pairs, 213 based on Foata normal form. 171/2896 useless extension candidates. Maximal degree in co-relation 10063. Up to 959 conditions per place. [2023-08-29 20:19:05,222 INFO L137 encePairwiseOnDemand]: 265/272 looper letters, 75 selfloop transitions, 18 changer transitions 1/105 dead transitions. [2023-08-29 20:19:05,223 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 105 transitions, 781 flow [2023-08-29 20:19:05,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:19:05,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:19:05,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 918 transitions. [2023-08-29 20:19:05,226 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48214285714285715 [2023-08-29 20:19:05,226 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 918 transitions. [2023-08-29 20:19:05,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 918 transitions. [2023-08-29 20:19:05,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:19:05,226 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 918 transitions. [2023-08-29 20:19:05,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 131.14285714285714) internal successors, (918), 7 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:05,231 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-29 20:19:05,231 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-29 20:19:05,231 INFO L175 Difference]: Start difference. First operand has 66 places, 60 transitions, 380 flow. Second operand 7 states and 918 transitions. [2023-08-29 20:19:05,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 105 transitions, 781 flow [2023-08-29 20:19:05,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 105 transitions, 749 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-29 20:19:05,274 INFO L231 Difference]: Finished difference. Result has 72 places, 59 transitions, 405 flow [2023-08-29 20:19:05,274 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=405, PETRI_PLACES=72, PETRI_TRANSITIONS=59} [2023-08-29 20:19:05,274 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 23 predicate places. [2023-08-29 20:19:05,275 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 59 transitions, 405 flow [2023-08-29 20:19:05,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 123.85714285714286) internal successors, (867), 7 states have internal predecessors, (867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:05,275 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:19:05,275 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] [2023-08-29 20:19:05,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-29 20:19:05,275 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-29 20:19:05,276 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:19:05,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1355714290, now seen corresponding path program 1 times [2023-08-29 20:19:05,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:19:05,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621756286] [2023-08-29 20:19:05,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:19:05,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:19:05,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:19:05,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:19:05,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:19:05,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621756286] [2023-08-29 20:19:05,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621756286] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:19:05,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:19:05,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:19:05,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549981325] [2023-08-29 20:19:05,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:19:05,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:19:05,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:19:05,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:19:05,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:19:05,509 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 272 [2023-08-29 20:19:05,509 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 59 transitions, 405 flow. Second operand has 4 states, 4 states have (on average 129.75) internal successors, (519), 4 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:05,510 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:19:05,510 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 272 [2023-08-29 20:19:05,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:19:05,997 INFO L130 PetriNetUnfolder]: 2517/4311 cut-off events. [2023-08-29 20:19:05,997 INFO L131 PetriNetUnfolder]: For 11770/11779 co-relation queries the response was YES. [2023-08-29 20:19:06,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17541 conditions, 4311 events. 2517/4311 cut-off events. For 11770/11779 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 27821 event pairs, 417 based on Foata normal form. 4/4280 useless extension candidates. Maximal degree in co-relation 17521. Up to 2303 conditions per place. [2023-08-29 20:19:06,034 INFO L137 encePairwiseOnDemand]: 269/272 looper letters, 102 selfloop transitions, 2 changer transitions 4/118 dead transitions. [2023-08-29 20:19:06,034 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 118 transitions, 1024 flow [2023-08-29 20:19:06,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:19:06,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:19:06,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 549 transitions. [2023-08-29 20:19:06,037 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5045955882352942 [2023-08-29 20:19:06,037 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 549 transitions. [2023-08-29 20:19:06,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 549 transitions. [2023-08-29 20:19:06,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:19:06,038 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 549 transitions. [2023-08-29 20:19:06,039 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.25) internal successors, (549), 4 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:06,040 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 272.0) internal successors, (1360), 5 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:06,041 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 272.0) internal successors, (1360), 5 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:06,041 INFO L175 Difference]: Start difference. First operand has 72 places, 59 transitions, 405 flow. Second operand 4 states and 549 transitions. [2023-08-29 20:19:06,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 118 transitions, 1024 flow [2023-08-29 20:19:06,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 118 transitions, 917 flow, removed 24 selfloop flow, removed 4 redundant places. [2023-08-29 20:19:06,134 INFO L231 Difference]: Finished difference. Result has 73 places, 60 transitions, 373 flow [2023-08-29 20:19:06,135 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=373, PETRI_PLACES=73, PETRI_TRANSITIONS=60} [2023-08-29 20:19:06,135 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 24 predicate places. [2023-08-29 20:19:06,135 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 60 transitions, 373 flow [2023-08-29 20:19:06,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 129.75) internal successors, (519), 4 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:06,136 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:19:06,136 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] [2023-08-29 20:19:06,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-29 20:19:06,136 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:19:06,137 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:19:06,137 INFO L85 PathProgramCache]: Analyzing trace with hash -94753116, now seen corresponding path program 1 times [2023-08-29 20:19:06,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:19:06,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523403011] [2023-08-29 20:19:06,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:19:06,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:19:06,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:19:06,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:19:06,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:19:06,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523403011] [2023-08-29 20:19:06,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523403011] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:19:06,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:19:06,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:19:06,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023181839] [2023-08-29 20:19:06,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:19:06,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-29 20:19:06,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:19:06,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-29 20:19:06,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-08-29 20:19:07,064 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 272 [2023-08-29 20:19:07,065 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 60 transitions, 373 flow. Second operand has 8 states, 8 states have (on average 107.875) internal successors, (863), 8 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:07,065 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:19:07,065 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 272 [2023-08-29 20:19:07,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:19:07,873 INFO L130 PetriNetUnfolder]: 3772/6475 cut-off events. [2023-08-29 20:19:07,873 INFO L131 PetriNetUnfolder]: For 13088/13136 co-relation queries the response was YES. [2023-08-29 20:19:07,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24746 conditions, 6475 events. 3772/6475 cut-off events. For 13088/13136 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 45307 event pairs, 594 based on Foata normal form. 16/6418 useless extension candidates. Maximal degree in co-relation 24724. Up to 2645 conditions per place. [2023-08-29 20:19:07,899 INFO L137 encePairwiseOnDemand]: 265/272 looper letters, 32 selfloop transitions, 5 changer transitions 98/137 dead transitions. [2023-08-29 20:19:07,899 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 137 transitions, 1091 flow [2023-08-29 20:19:07,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:19:07,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:19:07,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 903 transitions. [2023-08-29 20:19:07,902 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4149816176470588 [2023-08-29 20:19:07,902 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 903 transitions. [2023-08-29 20:19:07,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 903 transitions. [2023-08-29 20:19:07,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:19:07,903 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 903 transitions. [2023-08-29 20:19:07,905 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 112.875) internal successors, (903), 8 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:07,908 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-29 20:19:07,908 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-29 20:19:07,908 INFO L175 Difference]: Start difference. First operand has 73 places, 60 transitions, 373 flow. Second operand 8 states and 903 transitions. [2023-08-29 20:19:07,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 137 transitions, 1091 flow [2023-08-29 20:19:08,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 137 transitions, 967 flow, removed 9 selfloop flow, removed 6 redundant places. [2023-08-29 20:19:08,066 INFO L231 Difference]: Finished difference. Result has 73 places, 37 transitions, 195 flow [2023-08-29 20:19:08,067 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=195, PETRI_PLACES=73, PETRI_TRANSITIONS=37} [2023-08-29 20:19:08,067 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 24 predicate places. [2023-08-29 20:19:08,067 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 37 transitions, 195 flow [2023-08-29 20:19:08,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 107.875) internal successors, (863), 8 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:08,068 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:19:08,068 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] [2023-08-29 20:19:08,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-29 20:19:08,068 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-29 20:19:08,068 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:19:08,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1190501798, now seen corresponding path program 2 times [2023-08-29 20:19:08,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:19:08,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306402238] [2023-08-29 20:19:08,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:19:08,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:19:08,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:19:09,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:19:09,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:19:09,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306402238] [2023-08-29 20:19:09,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306402238] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:19:09,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:19:09,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:19:09,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060490621] [2023-08-29 20:19:09,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:19:09,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-29 20:19:09,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:19:09,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-29 20:19:09,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-08-29 20:19:09,952 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 272 [2023-08-29 20:19:09,954 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 37 transitions, 195 flow. Second operand has 8 states, 8 states have (on average 121.75) internal successors, (974), 8 states have internal predecessors, (974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:09,954 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:19:09,954 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 272 [2023-08-29 20:19:09,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:19:10,317 INFO L130 PetriNetUnfolder]: 391/694 cut-off events. [2023-08-29 20:19:10,318 INFO L131 PetriNetUnfolder]: For 633/633 co-relation queries the response was YES. [2023-08-29 20:19:10,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2229 conditions, 694 events. 391/694 cut-off events. For 633/633 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3253 event pairs, 61 based on Foata normal form. 1/651 useless extension candidates. Maximal degree in co-relation 2212. Up to 299 conditions per place. [2023-08-29 20:19:10,321 INFO L137 encePairwiseOnDemand]: 266/272 looper letters, 39 selfloop transitions, 4 changer transitions 28/74 dead transitions. [2023-08-29 20:19:10,321 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 74 transitions, 520 flow [2023-08-29 20:19:10,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:19:10,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:19:10,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 875 transitions. [2023-08-29 20:19:10,324 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45955882352941174 [2023-08-29 20:19:10,324 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 875 transitions. [2023-08-29 20:19:10,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 875 transitions. [2023-08-29 20:19:10,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:19:10,325 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 875 transitions. [2023-08-29 20:19:10,327 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.0) internal successors, (875), 7 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:10,329 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-29 20:19:10,330 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-29 20:19:10,330 INFO L175 Difference]: Start difference. First operand has 73 places, 37 transitions, 195 flow. Second operand 7 states and 875 transitions. [2023-08-29 20:19:10,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 74 transitions, 520 flow [2023-08-29 20:19:10,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 74 transitions, 421 flow, removed 13 selfloop flow, removed 21 redundant places. [2023-08-29 20:19:10,334 INFO L231 Difference]: Finished difference. Result has 55 places, 37 transitions, 146 flow [2023-08-29 20:19:10,334 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=146, PETRI_PLACES=55, PETRI_TRANSITIONS=37} [2023-08-29 20:19:10,334 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 6 predicate places. [2023-08-29 20:19:10,335 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 37 transitions, 146 flow [2023-08-29 20:19:10,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 121.75) internal successors, (974), 8 states have internal predecessors, (974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:10,335 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:19:10,335 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] [2023-08-29 20:19:10,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-29 20:19:10,336 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-29 20:19:10,336 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:19:10,336 INFO L85 PathProgramCache]: Analyzing trace with hash 527112262, now seen corresponding path program 3 times [2023-08-29 20:19:10,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:19:10,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896658484] [2023-08-29 20:19:10,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:19:10,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:19:10,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:19:10,380 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:19:10,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:19:10,484 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 20:19:10,484 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:19:10,485 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-29 20:19:10,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-29 20:19:10,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-29 20:19:10,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-29 20:19:10,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-29 20:19:10,487 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-29 20:19:10,487 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-29 20:19:10,487 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-29 20:19:10,487 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-29 20:19:10,487 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-29 20:19:10,487 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-29 20:19:10,487 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-29 20:19:10,488 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-29 20:19:10,488 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-29 20:19:10,488 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-29 20:19:10,488 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-29 20:19:10,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-29 20:19:10,488 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:19:10,493 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:19:10,493 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:19:10,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:19:10 BasicIcfg [2023-08-29 20:19:10,569 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:19:10,570 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:19:10,570 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:19:10,570 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:19:10,571 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:18:49" (3/4) ... [2023-08-29 20:19:10,576 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:19:10,576 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:19:10,577 INFO L158 Benchmark]: Toolchain (without parser) took 22194.61ms. Allocated memory was 62.9MB in the beginning and 1.0GB in the end (delta: 968.9MB). Free memory was 39.0MB in the beginning and 645.2MB in the end (delta: -606.3MB). Peak memory consumption was 365.7MB. Max. memory is 16.1GB. [2023-08-29 20:19:10,577 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 52.4MB. Free memory was 30.6MB in the beginning and 30.6MB in the end (delta: 54.0kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:19:10,577 INFO L158 Benchmark]: CACSL2BoogieTranslator took 525.95ms. Allocated memory is still 62.9MB. Free memory was 38.8MB in the beginning and 30.0MB in the end (delta: 8.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-08-29 20:19:10,577 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.33ms. Allocated memory is still 62.9MB. Free memory was 30.0MB in the beginning and 27.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:19:10,578 INFO L158 Benchmark]: Boogie Preprocessor took 43.02ms. Allocated memory was 62.9MB in the beginning and 75.5MB in the end (delta: 12.6MB). Free memory was 27.2MB in the beginning and 53.3MB in the end (delta: -26.1MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. [2023-08-29 20:19:10,578 INFO L158 Benchmark]: RCFGBuilder took 747.36ms. Allocated memory is still 75.5MB. Free memory was 53.3MB in the beginning and 32.2MB in the end (delta: 21.1MB). Peak memory consumption was 23.0MB. Max. memory is 16.1GB. [2023-08-29 20:19:10,578 INFO L158 Benchmark]: TraceAbstraction took 20789.26ms. Allocated memory was 75.5MB in the beginning and 1.0GB in the end (delta: 956.3MB). Free memory was 31.8MB in the beginning and 645.2MB in the end (delta: -613.4MB). Peak memory consumption was 342.4MB. Max. memory is 16.1GB. [2023-08-29 20:19:10,579 INFO L158 Benchmark]: Witness Printer took 5.89ms. Allocated memory is still 1.0GB. Free memory was 645.2MB in the beginning and 645.2MB in the end (delta: 2.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:19:10,581 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.18ms. Allocated memory is still 52.4MB. Free memory was 30.6MB in the beginning and 30.6MB in the end (delta: 54.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 525.95ms. Allocated memory is still 62.9MB. Free memory was 38.8MB in the beginning and 30.0MB in the end (delta: 8.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.33ms. Allocated memory is still 62.9MB. Free memory was 30.0MB in the beginning and 27.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.02ms. Allocated memory was 62.9MB in the beginning and 75.5MB in the end (delta: 12.6MB). Free memory was 27.2MB in the beginning and 53.3MB in the end (delta: -26.1MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. * RCFGBuilder took 747.36ms. Allocated memory is still 75.5MB. Free memory was 53.3MB in the beginning and 32.2MB in the end (delta: 21.1MB). Peak memory consumption was 23.0MB. Max. memory is 16.1GB. * TraceAbstraction took 20789.26ms. Allocated memory was 75.5MB in the beginning and 1.0GB in the end (delta: 956.3MB). Free memory was 31.8MB in the beginning and 645.2MB in the end (delta: -613.4MB). Peak memory consumption was 342.4MB. Max. memory is 16.1GB. * Witness Printer took 5.89ms. Allocated memory is still 1.0GB. Free memory was 645.2MB in the beginning and 645.2MB in the end (delta: 2.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.5s, 148 PlacesBefore, 49 PlacesAfterwards, 137 TransitionsBefore, 36 TransitionsAfterwards, 3024 CoEnabledTransitionPairs, 6 FixpointIterations, 53 TrivialSequentialCompositions, 67 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 131 TotalNumberOfCompositions, 6935 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3202, independent: 3036, independent conditional: 0, independent unconditional: 3036, dependent: 166, dependent conditional: 0, dependent unconditional: 166, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1630, independent: 1589, independent conditional: 0, independent unconditional: 1589, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3202, independent: 1447, independent conditional: 0, independent unconditional: 1447, dependent: 125, dependent conditional: 0, dependent unconditional: 125, unknown: 1630, unknown conditional: 0, unknown unconditional: 1630] , Statistics on independence cache: Total cache size (in pairs): 148, Positive cache size: 132, Positive conditional cache size: 0, Positive unconditional cache size: 132, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, 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; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L866] 0 pthread_t t445; [L867] FCALL, FORK 0 pthread_create(&t445, ((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}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t445, ((void *)0), P0, ((void *)0))=-4, t445={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] [L868] 0 pthread_t t446; [L869] FCALL, FORK 0 pthread_create(&t446, ((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}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t446, ((void *)0), P1, ((void *)0))=-3, t445={5:0}, t446={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] [L870] 0 pthread_t t447; [L871] FCALL, FORK 0 pthread_create(&t447, ((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}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t447, ((void *)0), P2, ((void *)0))=-2, t445={5:0}, t446={6:0}, t447={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] [L872] 0 pthread_t t448; [L873] FCALL, FORK 0 pthread_create(&t448, ((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}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t448, ((void *)0), P3, ((void *)0))=-1, t445={5:0}, t446={6:0}, t447={7:0}, t448={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] [L812] 4 z$w_buff1 = z$w_buff0 [L813] 4 z$w_buff0 = 1 [L814] 4 z$w_buff1_used = z$w_buff0_used [L815] 4 z$w_buff0_used = (_Bool)1 [L816] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L816] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L817] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L818] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L819] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L820] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L821] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L822] 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}, 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] [L825] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L826] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L827] 4 z$flush_delayed = weak$$choice2 [L828] 4 z$mem_tmp = z [L829] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L830] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L831] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L832] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L833] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L834] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L835] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L836] 4 __unbuffered_p3_EAX = z [L837] 4 z = z$flush_delayed ? z$mem_tmp : z [L838] 4 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=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=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] [L841] 4 __unbuffered_p3_EBX = 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=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=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] [L754] 1 a = 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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, 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] [L757] 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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, 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] [L769] 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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, 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] [L772] 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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, 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] [L784] 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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, 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] [L787] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L788] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L789] 3 z$flush_delayed = weak$$choice2 [L790] 3 z$mem_tmp = z [L791] 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) [L792] 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)) [L793] 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)) [L794] 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)) [L795] 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)) [L796] 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)) [L797] 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)) [L798] 3 __unbuffered_p2_EAX = z [L799] 3 z = z$flush_delayed ? z$mem_tmp : z [L800] 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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, 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] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L844] 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) [L845] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L846] 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 [L847] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L848] 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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, 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] [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 3 return 0; [L851] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L853] 4 return 0; [L875] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_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}, main$tmp_guard0=1, main$tmp_guard1=0, t445={5:0}, t446={6:0}, t447={7:0}, t448={3:0}, weak$$choice2=1, 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] [L877] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L877] RET 0 assume_abort_if_not(main$tmp_guard0) [L879] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L880] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L881] 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 [L882] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L883] 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}, main$tmp_guard0=1, main$tmp_guard1=0, t445={5:0}, t446={6:0}, t447={7:0}, t448={3:0}, weak$$choice2=1, 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] [L886] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L888] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_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}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=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: 864]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 867]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 873]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 871]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 175 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 20.6s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 8.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1124 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 957 mSDsluCounter, 326 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 285 mSDsCounter, 111 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3008 IncrementalHoareTripleChecker+Invalid, 3119 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 111 mSolverCounterUnsat, 41 mSDtfsCounter, 3008 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=405occurred in iteration=11, InterpolantAutomatonStates: 73, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 256 NumberOfCodeBlocks, 256 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 217 ConstructedInterpolants, 0 QuantifiedInterpolants, 3774 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-29 20:19:10,624 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/mix017_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 39f434d3f7e7749f4257e03557066c1349e963b1d489e771c14fc3ff33c9a6c7 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 20:19:12,519 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:19:12,521 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:19:12,558 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:19:12,559 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:19:12,561 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:19:12,563 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:19:12,565 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:19:12,567 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:19:12,571 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:19:12,572 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:19:12,573 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:19:12,574 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:19:12,574 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:19:12,575 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:19:12,576 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:19:12,577 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:19:12,577 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:19:12,578 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:19:12,580 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:19:12,581 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:19:12,588 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:19:12,589 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:19:12,590 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:19:12,593 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:19:12,596 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:19:12,597 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:19:12,598 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:19:12,600 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:19:12,601 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:19:12,601 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:19:12,602 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:19:12,603 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:19:12,604 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:19:12,605 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:19:12,606 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:19:12,607 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:19:12,607 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:19:12,607 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:19:12,608 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:19:12,609 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:19:12,610 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-29 20:19:12,643 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:19:12,643 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:19:12,644 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:19:12,645 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:19:12,645 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:19:12,646 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:19:12,646 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:19:12,646 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:19:12,647 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:19:12,647 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:19:12,647 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:19:12,648 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:19:12,648 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:19:12,648 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:19:12,648 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:19:12,648 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:19:12,649 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:19:12,649 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:19:12,649 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:19:12,649 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:19:12,649 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-29 20:19:12,650 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-29 20:19:12,650 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:19:12,650 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:19:12,650 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:19:12,650 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:19:12,651 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:19:12,651 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:19:12,651 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:19:12,651 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:19:12,651 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-29 20:19:12,652 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-29 20:19:12,652 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:19:12,652 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:19:12,652 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:19:12,653 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-29 20:19:12,653 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:19:12,653 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 -> 39f434d3f7e7749f4257e03557066c1349e963b1d489e771c14fc3ff33c9a6c7 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-29 20:19:12,952 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:19:12,971 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:19:12,973 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:19:12,973 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:19:12,974 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:19:12,975 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix017_pso.opt_tso.opt.i [2023-08-29 20:19:14,217 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:19:14,461 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:19:14,462 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix017_pso.opt_tso.opt.i [2023-08-29 20:19:14,481 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9037e5ca8/223fa75365ba46ccae8ebe80504feded/FLAGc1007e51c [2023-08-29 20:19:14,492 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9037e5ca8/223fa75365ba46ccae8ebe80504feded [2023-08-29 20:19:14,495 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:19:14,496 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:19:14,497 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:19:14,498 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:19:14,501 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:19:14,502 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:19:14" (1/1) ... [2023-08-29 20:19:14,504 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@334fda92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:19:14, skipping insertion in model container [2023-08-29 20:19:14,504 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:19:14" (1/1) ... [2023-08-29 20:19:14,509 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:19:14,574 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:19:14,716 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/mix017_pso.opt_tso.opt.i[956,969] [2023-08-29 20:19:14,849 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:19:14,861 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:19:14,879 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/mix017_pso.opt_tso.opt.i[956,969] [2023-08-29 20:19:14,949 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:19:14,992 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:19:14,992 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:19:14,998 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:19:14,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:19:14 WrapperNode [2023-08-29 20:19:14,998 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:19:14,999 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:19:15,000 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:19:15,000 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:19:15,005 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:19:14" (1/1) ... [2023-08-29 20:19:15,024 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:19:14" (1/1) ... [2023-08-29 20:19:15,059 INFO L138 Inliner]: procedures = 180, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 167 [2023-08-29 20:19:15,060 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:19:15,064 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:19:15,064 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:19:15,064 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:19:15,072 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:19:14" (1/1) ... [2023-08-29 20:19:15,072 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:19:14" (1/1) ... [2023-08-29 20:19:15,086 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:19:14" (1/1) ... [2023-08-29 20:19:15,086 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:19:14" (1/1) ... [2023-08-29 20:19:15,095 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:19:14" (1/1) ... [2023-08-29 20:19:15,109 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:19:14" (1/1) ... [2023-08-29 20:19:15,111 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:19:14" (1/1) ... [2023-08-29 20:19:15,113 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:19:14" (1/1) ... [2023-08-29 20:19:15,116 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:19:15,117 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:19:15,117 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:19:15,117 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:19:15,117 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:19:14" (1/1) ... [2023-08-29 20:19:15,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:19:15,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:19:15,166 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-29 20:19:15,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-29 20:19:15,207 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:19:15,207 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:19:15,208 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:19:15,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:19:15,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-29 20:19:15,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-29 20:19:15,208 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:19:15,208 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:19:15,208 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:19:15,208 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:19:15,208 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-29 20:19:15,209 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-29 20:19:15,209 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-29 20:19:15,209 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-29 20:19:15,209 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:19:15,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:19:15,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:19:15,211 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 20:19:15,374 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:19:15,376 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:19:15,755 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:19:15,884 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:19:15,885 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:19:15,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:19:15 BoogieIcfgContainer [2023-08-29 20:19:15,887 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:19:15,889 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:19:15,889 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:19:15,892 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:19:15,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:19:14" (1/3) ... [2023-08-29 20:19:15,892 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@356be931 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:19:15, skipping insertion in model container [2023-08-29 20:19:15,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:19:14" (2/3) ... [2023-08-29 20:19:15,892 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@356be931 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:19:15, skipping insertion in model container [2023-08-29 20:19:15,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:19:15" (3/3) ... [2023-08-29 20:19:15,893 INFO L112 eAbstractionObserver]: Analyzing ICFG mix017_pso.opt_tso.opt.i [2023-08-29 20:19:15,907 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:19:15,907 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-29 20:19:15,907 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:19:15,968 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:19:16,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 142 transitions, 304 flow [2023-08-29 20:19:16,055 INFO L130 PetriNetUnfolder]: 2/138 cut-off events. [2023-08-29 20:19:16,056 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:19:16,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 138 events. 2/138 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 90 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 94. Up to 2 conditions per place. [2023-08-29 20:19:16,063 INFO L82 GeneralOperation]: Start removeDead. Operand has 153 places, 142 transitions, 304 flow [2023-08-29 20:19:16,070 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 149 places, 138 transitions, 288 flow [2023-08-29 20:19:16,074 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:19:16,085 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 138 transitions, 288 flow [2023-08-29 20:19:16,088 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 149 places, 138 transitions, 288 flow [2023-08-29 20:19:16,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 138 transitions, 288 flow [2023-08-29 20:19:16,135 INFO L130 PetriNetUnfolder]: 2/138 cut-off events. [2023-08-29 20:19:16,135 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:19:16,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 138 events. 2/138 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 89 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 94. Up to 2 conditions per place. [2023-08-29 20:19:16,140 INFO L119 LiptonReduction]: Number of co-enabled transitions 3024 [2023-08-29 20:19:22,678 INFO L134 LiptonReduction]: Checked pairs total: 7555 [2023-08-29 20:19:22,678 INFO L136 LiptonReduction]: Total number of compositions: 134 [2023-08-29 20:19:22,690 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:19:22,694 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;@c1c99cd, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:19:22,695 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-29 20:19:22,701 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-29 20:19:22,701 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:19:22,703 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:19:22,703 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:19:22,704 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-29 20:19:22,708 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:19:22,710 INFO L85 PathProgramCache]: Analyzing trace with hash 610, now seen corresponding path program 1 times [2023-08-29 20:19:22,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:19:22,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1328385776] [2023-08-29 20:19:22,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:19:22,724 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:19:22,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:19:22,729 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:19:22,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-08-29 20:19:22,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:19:22,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-29 20:19:22,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:19:22,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:19:22,818 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:19:22,819 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:19:22,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1328385776] [2023-08-29 20:19:22,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1328385776] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:19:22,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:19:22,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:19:22,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850808152] [2023-08-29 20:19:22,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:19:22,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:19:22,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:19:22,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:19:22,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:19:22,854 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 276 [2023-08-29 20:19:22,856 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 84 flow. Second operand has 2 states, 2 states have (on average 129.5) internal successors, (259), 2 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:22,856 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:19:22,857 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 276 [2023-08-29 20:19:22,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:19:23,571 INFO L130 PetriNetUnfolder]: 3743/5215 cut-off events. [2023-08-29 20:19:23,571 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2023-08-29 20:19:23,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10455 conditions, 5215 events. 3743/5215 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 25964 event pairs, 3743 based on Foata normal form. 0/4527 useless extension candidates. Maximal degree in co-relation 10443. Up to 5137 conditions per place. [2023-08-29 20:19:23,606 INFO L137 encePairwiseOnDemand]: 268/276 looper letters, 25 selfloop transitions, 0 changer transitions 0/28 dead transitions. [2023-08-29 20:19:23,606 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 28 transitions, 118 flow [2023-08-29 20:19:23,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:19:23,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:19:23,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 291 transitions. [2023-08-29 20:19:23,625 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5271739130434783 [2023-08-29 20:19:23,625 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 291 transitions. [2023-08-29 20:19:23,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 291 transitions. [2023-08-29 20:19:23,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:19:23,630 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 291 transitions. [2023-08-29 20:19:23,635 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 145.5) internal successors, (291), 2 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:23,639 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 276.0) internal successors, (828), 3 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:23,640 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 276.0) internal successors, (828), 3 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:23,642 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 84 flow. Second operand 2 states and 291 transitions. [2023-08-29 20:19:23,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 28 transitions, 118 flow [2023-08-29 20:19:23,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 28 transitions, 114 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-29 20:19:23,651 INFO L231 Difference]: Finished difference. Result has 38 places, 28 transitions, 64 flow [2023-08-29 20:19:23,652 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=64, PETRI_PLACES=38, PETRI_TRANSITIONS=28} [2023-08-29 20:19:23,655 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -11 predicate places. [2023-08-29 20:19:23,655 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 28 transitions, 64 flow [2023-08-29 20:19:23,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 129.5) internal successors, (259), 2 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:23,655 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:19:23,655 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:19:23,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-08-29 20:19:23,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:19:23,857 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-29 20:19:23,857 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:19:23,858 INFO L85 PathProgramCache]: Analyzing trace with hash 687974668, now seen corresponding path program 1 times [2023-08-29 20:19:23,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:19:23,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [455967222] [2023-08-29 20:19:23,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:19:23,859 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:19:23,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:19:23,862 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:19:23,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-08-29 20:19:23,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:19:23,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:19:23,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:19:24,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:19:24,017 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:19:24,017 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:19:24,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [455967222] [2023-08-29 20:19:24,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [455967222] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:19:24,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:19:24,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:19:24,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459132537] [2023-08-29 20:19:24,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:19:24,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:19:24,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:19:24,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:19:24,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:19:24,024 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 276 [2023-08-29 20:19:24,024 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 28 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:24,024 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:19:24,024 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 276 [2023-08-29 20:19:24,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:19:24,512 INFO L130 PetriNetUnfolder]: 3113/4513 cut-off events. [2023-08-29 20:19:24,512 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:19:24,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8904 conditions, 4513 events. 3113/4513 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 24048 event pairs, 593 based on Foata normal form. 0/4149 useless extension candidates. Maximal degree in co-relation 8901. Up to 3385 conditions per place. [2023-08-29 20:19:24,533 INFO L137 encePairwiseOnDemand]: 273/276 looper letters, 32 selfloop transitions, 2 changer transitions 2/39 dead transitions. [2023-08-29 20:19:24,533 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 39 transitions, 158 flow [2023-08-29 20:19:24,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:19:24,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:19:24,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2023-08-29 20:19:24,535 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5084541062801933 [2023-08-29 20:19:24,535 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 421 transitions. [2023-08-29 20:19:24,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 421 transitions. [2023-08-29 20:19:24,536 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:19:24,536 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 421 transitions. [2023-08-29 20:19:24,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:24,539 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:24,540 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:24,540 INFO L175 Difference]: Start difference. First operand has 38 places, 28 transitions, 64 flow. Second operand 3 states and 421 transitions. [2023-08-29 20:19:24,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 39 transitions, 158 flow [2023-08-29 20:19:24,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 39 transitions, 158 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:19:24,541 INFO L231 Difference]: Finished difference. Result has 39 places, 26 transitions, 64 flow [2023-08-29 20:19:24,542 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=39, PETRI_TRANSITIONS=26} [2023-08-29 20:19:24,542 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -10 predicate places. [2023-08-29 20:19:24,543 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 26 transitions, 64 flow [2023-08-29 20:19:24,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:24,543 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:19:24,543 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:19:24,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-08-29 20:19:24,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:19:24,753 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-29 20:19:24,753 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:19:24,753 INFO L85 PathProgramCache]: Analyzing trace with hash -281215874, now seen corresponding path program 1 times [2023-08-29 20:19:24,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:19:24,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2013789759] [2023-08-29 20:19:24,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:19:24,754 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:19:24,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:19:24,756 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:19:24,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-08-29 20:19:24,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:19:24,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:19:24,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:19:24,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:19:24,908 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:19:24,908 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:19:24,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2013789759] [2023-08-29 20:19:24,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2013789759] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:19:24,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:19:24,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:19:24,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925227306] [2023-08-29 20:19:24,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:19:24,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:19:24,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:19:24,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:19:24,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:19:24,932 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 276 [2023-08-29 20:19:24,933 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 26 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 122.75) internal successors, (491), 4 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:24,933 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:19:24,933 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 276 [2023-08-29 20:19:24,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:19:25,382 INFO L130 PetriNetUnfolder]: 2213/3215 cut-off events. [2023-08-29 20:19:25,382 INFO L131 PetriNetUnfolder]: For 156/156 co-relation queries the response was YES. [2023-08-29 20:19:25,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6684 conditions, 3215 events. 2213/3215 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 15743 event pairs, 423 based on Foata normal form. 180/3260 useless extension candidates. Maximal degree in co-relation 6680. Up to 2428 conditions per place. [2023-08-29 20:19:25,397 INFO L137 encePairwiseOnDemand]: 269/276 looper letters, 35 selfloop transitions, 5 changer transitions 23/66 dead transitions. [2023-08-29 20:19:25,397 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 66 transitions, 282 flow [2023-08-29 20:19:25,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:19:25,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:19:25,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 665 transitions. [2023-08-29 20:19:25,399 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48188405797101447 [2023-08-29 20:19:25,399 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 665 transitions. [2023-08-29 20:19:25,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 665 transitions. [2023-08-29 20:19:25,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:19:25,400 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 665 transitions. [2023-08-29 20:19:25,401 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.0) internal successors, (665), 5 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:25,404 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 276.0) internal successors, (1656), 6 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:25,405 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 276.0) internal successors, (1656), 6 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:25,405 INFO L175 Difference]: Start difference. First operand has 39 places, 26 transitions, 64 flow. Second operand 5 states and 665 transitions. [2023-08-29 20:19:25,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 66 transitions, 282 flow [2023-08-29 20:19:25,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 66 transitions, 272 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:19:25,407 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 105 flow [2023-08-29 20:19:25,408 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=36, 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=105, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2023-08-29 20:19:25,408 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -6 predicate places. [2023-08-29 20:19:25,408 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 105 flow [2023-08-29 20:19:25,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.75) internal successors, (491), 4 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:25,409 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:19:25,409 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:19:25,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-08-29 20:19:25,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:19:25,618 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-29 20:19:25,619 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:19:25,619 INFO L85 PathProgramCache]: Analyzing trace with hash -343279765, now seen corresponding path program 1 times [2023-08-29 20:19:25,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:19:25,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1535616190] [2023-08-29 20:19:25,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:19:25,620 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:19:25,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:19:25,621 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:19:25,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-08-29 20:19:25,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:19:25,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:19:25,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:19:25,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:19:25,761 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:19:25,761 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:19:25,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1535616190] [2023-08-29 20:19:25,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1535616190] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:19:25,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:19:25,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:19:25,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564257177] [2023-08-29 20:19:25,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:19:25,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:19:25,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:19:25,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:19:25,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:19:25,790 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 276 [2023-08-29 20:19:25,792 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 105 flow. Second operand has 5 states, 5 states have (on average 122.6) internal successors, (613), 5 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:25,792 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:19:25,792 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 276 [2023-08-29 20:19:25,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:19:26,162 INFO L130 PetriNetUnfolder]: 1185/1835 cut-off events. [2023-08-29 20:19:26,163 INFO L131 PetriNetUnfolder]: For 766/766 co-relation queries the response was YES. [2023-08-29 20:19:26,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5111 conditions, 1835 events. 1185/1835 cut-off events. For 766/766 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8584 event pairs, 173 based on Foata normal form. 132/1908 useless extension candidates. Maximal degree in co-relation 5104. Up to 872 conditions per place. [2023-08-29 20:19:26,172 INFO L137 encePairwiseOnDemand]: 269/276 looper letters, 46 selfloop transitions, 9 changer transitions 23/81 dead transitions. [2023-08-29 20:19:26,172 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 81 transitions, 423 flow [2023-08-29 20:19:26,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:19:26,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:19:26,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 800 transitions. [2023-08-29 20:19:26,175 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4830917874396135 [2023-08-29 20:19:26,175 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 800 transitions. [2023-08-29 20:19:26,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 800 transitions. [2023-08-29 20:19:26,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:19:26,176 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 800 transitions. [2023-08-29 20:19:26,178 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 133.33333333333334) internal successors, (800), 6 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:26,181 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 276.0) internal successors, (1932), 7 states have internal predecessors, (1932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:26,182 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 276.0) internal successors, (1932), 7 states have internal predecessors, (1932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:26,182 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 105 flow. Second operand 6 states and 800 transitions. [2023-08-29 20:19:26,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 81 transitions, 423 flow [2023-08-29 20:19:26,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 81 transitions, 416 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-29 20:19:26,189 INFO L231 Difference]: Finished difference. Result has 47 places, 34 transitions, 170 flow [2023-08-29 20:19:26,189 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=170, PETRI_PLACES=47, PETRI_TRANSITIONS=34} [2023-08-29 20:19:26,190 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -2 predicate places. [2023-08-29 20:19:26,190 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 34 transitions, 170 flow [2023-08-29 20:19:26,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 122.6) internal successors, (613), 5 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:26,191 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:19:26,191 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:19:26,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-08-29 20:19:26,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:19:26,408 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-29 20:19:26,408 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:19:26,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1958112813, now seen corresponding path program 1 times [2023-08-29 20:19:26,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:19:26,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [635010099] [2023-08-29 20:19:26,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:19:26,409 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:19:26,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:19:26,410 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:19:26,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-08-29 20:19:26,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:19:26,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-29 20:19:26,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:19:26,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:19:26,556 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:19:26,557 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:19:26,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [635010099] [2023-08-29 20:19:26,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [635010099] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:19:26,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:19:26,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:19:26,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364665345] [2023-08-29 20:19:26,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:19:26,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:19:26,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:19:26,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:19:26,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:19:26,594 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 276 [2023-08-29 20:19:26,596 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 34 transitions, 170 flow. Second operand has 6 states, 6 states have (on average 122.5) internal successors, (735), 6 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:26,596 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:19:26,596 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 276 [2023-08-29 20:19:26,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:19:26,928 INFO L130 PetriNetUnfolder]: 649/1047 cut-off events. [2023-08-29 20:19:26,928 INFO L131 PetriNetUnfolder]: For 1188/1188 co-relation queries the response was YES. [2023-08-29 20:19:26,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3434 conditions, 1047 events. 649/1047 cut-off events. For 1188/1188 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4430 event pairs, 123 based on Foata normal form. 56/1088 useless extension candidates. Maximal degree in co-relation 3425. Up to 391 conditions per place. [2023-08-29 20:19:26,934 INFO L137 encePairwiseOnDemand]: 269/276 looper letters, 55 selfloop transitions, 13 changer transitions 23/94 dead transitions. [2023-08-29 20:19:26,934 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 94 transitions, 584 flow [2023-08-29 20:19:26,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:19:26,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:19:26,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 933 transitions. [2023-08-29 20:19:26,937 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4829192546583851 [2023-08-29 20:19:26,937 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 933 transitions. [2023-08-29 20:19:26,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 933 transitions. [2023-08-29 20:19:26,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:19:26,938 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 933 transitions. [2023-08-29 20:19:26,939 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 133.28571428571428) internal successors, (933), 7 states have internal predecessors, (933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:26,943 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 276.0) internal successors, (2208), 8 states have internal predecessors, (2208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:26,943 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 276.0) internal successors, (2208), 8 states have internal predecessors, (2208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:26,944 INFO L175 Difference]: Start difference. First operand has 47 places, 34 transitions, 170 flow. Second operand 7 states and 933 transitions. [2023-08-29 20:19:26,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 94 transitions, 584 flow [2023-08-29 20:19:26,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 94 transitions, 522 flow, removed 26 selfloop flow, removed 4 redundant places. [2023-08-29 20:19:26,952 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 220 flow [2023-08-29 20:19:26,953 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=220, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2023-08-29 20:19:26,954 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 1 predicate places. [2023-08-29 20:19:26,955 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 220 flow [2023-08-29 20:19:26,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.5) internal successors, (735), 6 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:26,957 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:19:26,957 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:19:26,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-08-29 20:19:27,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:19:27,166 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-29 20:19:27,167 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:19:27,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1213084143, now seen corresponding path program 1 times [2023-08-29 20:19:27,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:19:27,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1449073949] [2023-08-29 20:19:27,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:19:27,167 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:19:27,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:19:27,168 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:19:27,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-08-29 20:19:27,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:19:27,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-29 20:19:27,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:19:27,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-29 20:19:27,325 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:19:27,325 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:19:27,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1449073949] [2023-08-29 20:19:27,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1449073949] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:19:27,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:19:27,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:19:27,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721551797] [2023-08-29 20:19:27,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:19:27,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:19:27,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:19:27,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:19:27,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:19:27,373 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 276 [2023-08-29 20:19:27,374 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 220 flow. Second operand has 7 states, 7 states have (on average 122.57142857142857) internal successors, (858), 7 states have internal predecessors, (858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:27,374 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:19:27,374 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 276 [2023-08-29 20:19:27,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:19:27,743 INFO L130 PetriNetUnfolder]: 528/838 cut-off events. [2023-08-29 20:19:27,743 INFO L131 PetriNetUnfolder]: For 938/938 co-relation queries the response was YES. [2023-08-29 20:19:27,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2637 conditions, 838 events. 528/838 cut-off events. For 938/938 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3362 event pairs, 119 based on Foata normal form. 12/846 useless extension candidates. Maximal degree in co-relation 2627. Up to 340 conditions per place. [2023-08-29 20:19:27,749 INFO L137 encePairwiseOnDemand]: 269/276 looper letters, 51 selfloop transitions, 17 changer transitions 12/83 dead transitions. [2023-08-29 20:19:27,749 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 83 transitions, 528 flow [2023-08-29 20:19:27,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:19:27,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:19:27,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1042 transitions. [2023-08-29 20:19:27,752 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47192028985507245 [2023-08-29 20:19:27,752 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1042 transitions. [2023-08-29 20:19:27,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1042 transitions. [2023-08-29 20:19:27,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:19:27,772 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1042 transitions. [2023-08-29 20:19:27,774 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 130.25) internal successors, (1042), 8 states have internal predecessors, (1042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:27,777 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 276.0) internal successors, (2484), 9 states have internal predecessors, (2484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:27,778 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 276.0) internal successors, (2484), 9 states have internal predecessors, (2484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:27,778 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 220 flow. Second operand 8 states and 1042 transitions. [2023-08-29 20:19:27,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 83 transitions, 528 flow [2023-08-29 20:19:27,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 83 transitions, 466 flow, removed 22 selfloop flow, removed 5 redundant places. [2023-08-29 20:19:27,785 INFO L231 Difference]: Finished difference. Result has 53 places, 38 transitions, 214 flow [2023-08-29 20:19:27,786 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=214, PETRI_PLACES=53, PETRI_TRANSITIONS=38} [2023-08-29 20:19:27,786 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 4 predicate places. [2023-08-29 20:19:27,786 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 38 transitions, 214 flow [2023-08-29 20:19:27,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 122.57142857142857) internal successors, (858), 7 states have internal predecessors, (858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:27,787 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:19:27,787 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] [2023-08-29 20:19:27,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-08-29 20:19:27,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:19:27,988 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-29 20:19:27,988 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:19:27,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1985924060, now seen corresponding path program 1 times [2023-08-29 20:19:27,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:19:27,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [789048083] [2023-08-29 20:19:27,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:19:27,989 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:19:27,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:19:27,990 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:19:27,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-08-29 20:19:28,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:19:28,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:19:28,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:19:28,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:19:28,154 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:19:28,154 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:19:28,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [789048083] [2023-08-29 20:19:28,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [789048083] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:19:28,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:19:28,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:19:28,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824307748] [2023-08-29 20:19:28,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:19:28,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:19:28,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:19:28,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:19:28,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:19:28,162 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 276 [2023-08-29 20:19:28,163 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 38 transitions, 214 flow. Second operand has 4 states, 4 states have (on average 130.75) internal successors, (523), 4 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:28,163 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:19:28,163 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 276 [2023-08-29 20:19:28,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:19:28,388 INFO L130 PetriNetUnfolder]: 707/1169 cut-off events. [2023-08-29 20:19:28,389 INFO L131 PetriNetUnfolder]: For 1643/1643 co-relation queries the response was YES. [2023-08-29 20:19:28,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3599 conditions, 1169 events. 707/1169 cut-off events. For 1643/1643 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5655 event pairs, 115 based on Foata normal form. 0/1167 useless extension candidates. Maximal degree in co-relation 3588. Up to 652 conditions per place. [2023-08-29 20:19:28,402 INFO L137 encePairwiseOnDemand]: 273/276 looper letters, 79 selfloop transitions, 2 changer transitions 0/83 dead transitions. [2023-08-29 20:19:28,403 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 83 transitions, 649 flow [2023-08-29 20:19:28,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:19:28,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:19:28,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 552 transitions. [2023-08-29 20:19:28,405 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-08-29 20:19:28,405 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 552 transitions. [2023-08-29 20:19:28,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 552 transitions. [2023-08-29 20:19:28,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:19:28,406 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 552 transitions. [2023-08-29 20:19:28,407 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:28,410 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 276.0) internal successors, (1380), 5 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:28,410 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 276.0) internal successors, (1380), 5 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:28,410 INFO L175 Difference]: Start difference. First operand has 53 places, 38 transitions, 214 flow. Second operand 4 states and 552 transitions. [2023-08-29 20:19:28,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 83 transitions, 649 flow [2023-08-29 20:19:28,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 83 transitions, 508 flow, removed 38 selfloop flow, removed 7 redundant places. [2023-08-29 20:19:28,421 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 163 flow [2023-08-29 20:19:28,421 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=163, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2023-08-29 20:19:28,421 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 0 predicate places. [2023-08-29 20:19:28,422 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 163 flow [2023-08-29 20:19:28,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.75) internal successors, (523), 4 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:28,422 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:19:28,422 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] [2023-08-29 20:19:28,437 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-08-29 20:19:28,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:19:28,632 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-29 20:19:28,632 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:19:28,632 INFO L85 PathProgramCache]: Analyzing trace with hash 549232652, now seen corresponding path program 2 times [2023-08-29 20:19:28,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:19:28,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2090082581] [2023-08-29 20:19:28,633 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 20:19:28,633 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:19:28,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:19:28,634 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:19:28,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-08-29 20:19:28,745 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-29 20:19:28,745 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:19:28,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:19:28,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:19:28,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:19:28,788 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:19:28,788 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:19:28,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2090082581] [2023-08-29 20:19:28,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2090082581] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:19:28,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:19:28,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:19:28,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599790816] [2023-08-29 20:19:28,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:19:28,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:19:28,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:19:28,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:19:28,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:19:28,804 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 276 [2023-08-29 20:19:28,806 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 163 flow. Second operand has 4 states, 4 states have (on average 130.75) internal successors, (523), 4 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:28,806 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:19:28,806 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 276 [2023-08-29 20:19:28,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:19:29,113 INFO L130 PetriNetUnfolder]: 1178/2005 cut-off events. [2023-08-29 20:19:29,113 INFO L131 PetriNetUnfolder]: For 1822/1822 co-relation queries the response was YES. [2023-08-29 20:19:29,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5591 conditions, 2005 events. 1178/2005 cut-off events. For 1822/1822 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 11139 event pairs, 185 based on Foata normal form. 1/2001 useless extension candidates. Maximal degree in co-relation 5581. Up to 949 conditions per place. [2023-08-29 20:19:29,124 INFO L137 encePairwiseOnDemand]: 273/276 looper letters, 82 selfloop transitions, 2 changer transitions 0/87 dead transitions. [2023-08-29 20:19:29,125 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 87 transitions, 538 flow [2023-08-29 20:19:29,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:19:29,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:19:29,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 555 transitions. [2023-08-29 20:19:29,127 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5027173913043478 [2023-08-29 20:19:29,128 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 555 transitions. [2023-08-29 20:19:29,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 555 transitions. [2023-08-29 20:19:29,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:19:29,128 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 555 transitions. [2023-08-29 20:19:29,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 138.75) internal successors, (555), 4 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:29,131 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 276.0) internal successors, (1380), 5 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:29,132 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 276.0) internal successors, (1380), 5 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:29,132 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 163 flow. Second operand 4 states and 555 transitions. [2023-08-29 20:19:29,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 87 transitions, 538 flow [2023-08-29 20:19:29,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 87 transitions, 536 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:19:29,151 INFO L231 Difference]: Finished difference. Result has 53 places, 40 transitions, 175 flow [2023-08-29 20:19:29,151 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=175, PETRI_PLACES=53, PETRI_TRANSITIONS=40} [2023-08-29 20:19:29,153 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 4 predicate places. [2023-08-29 20:19:29,153 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 40 transitions, 175 flow [2023-08-29 20:19:29,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.75) internal successors, (523), 4 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:29,153 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:19:29,154 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] [2023-08-29 20:19:29,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-08-29 20:19:29,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:19:29,363 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-29 20:19:29,364 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:19:29,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1517538361, now seen corresponding path program 1 times [2023-08-29 20:19:29,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:19:29,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [787844420] [2023-08-29 20:19:29,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:19:29,365 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:19:29,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:19:29,366 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:19:29,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-08-29 20:19:29,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:19:29,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-29 20:19:29,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:19:30,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:19:30,114 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:19:30,114 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:19:30,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [787844420] [2023-08-29 20:19:30,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [787844420] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:19:30,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:19:30,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:19:30,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739477271] [2023-08-29 20:19:30,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:19:30,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:19:30,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:19:30,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:19:30,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:19:30,577 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 276 [2023-08-29 20:19:30,578 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 40 transitions, 175 flow. Second operand has 6 states, 6 states have (on average 112.66666666666667) internal successors, (676), 6 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:30,578 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:19:30,578 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 276 [2023-08-29 20:19:30,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:19:30,894 INFO L130 PetriNetUnfolder]: 942/1541 cut-off events. [2023-08-29 20:19:30,894 INFO L131 PetriNetUnfolder]: For 2018/2021 co-relation queries the response was YES. [2023-08-29 20:19:30,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4783 conditions, 1541 events. 942/1541 cut-off events. For 2018/2021 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 8221 event pairs, 70 based on Foata normal form. 5/1508 useless extension candidates. Maximal degree in co-relation 4771. Up to 1289 conditions per place. [2023-08-29 20:19:30,900 INFO L137 encePairwiseOnDemand]: 271/276 looper letters, 33 selfloop transitions, 4 changer transitions 20/60 dead transitions. [2023-08-29 20:19:30,900 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 60 transitions, 393 flow [2023-08-29 20:19:30,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:19:30,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:19:30,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 690 transitions. [2023-08-29 20:19:30,903 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2023-08-29 20:19:30,903 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 690 transitions. [2023-08-29 20:19:30,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 690 transitions. [2023-08-29 20:19:30,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:19:30,904 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 690 transitions. [2023-08-29 20:19:30,905 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:30,908 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 276.0) internal successors, (1932), 7 states have internal predecessors, (1932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:30,908 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 276.0) internal successors, (1932), 7 states have internal predecessors, (1932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:30,908 INFO L175 Difference]: Start difference. First operand has 53 places, 40 transitions, 175 flow. Second operand 6 states and 690 transitions. [2023-08-29 20:19:30,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 60 transitions, 393 flow [2023-08-29 20:19:30,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 60 transitions, 390 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:19:30,917 INFO L231 Difference]: Finished difference. Result has 56 places, 37 transitions, 168 flow [2023-08-29 20:19:30,918 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=168, PETRI_PLACES=56, PETRI_TRANSITIONS=37} [2023-08-29 20:19:30,918 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 7 predicate places. [2023-08-29 20:19:30,918 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 37 transitions, 168 flow [2023-08-29 20:19:30,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.66666666666667) internal successors, (676), 6 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:30,919 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:19:30,919 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] [2023-08-29 20:19:30,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-08-29 20:19:31,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:19:31,129 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-29 20:19:31,129 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:19:31,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1447160004, now seen corresponding path program 3 times [2023-08-29 20:19:31,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:19:31,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [592303812] [2023-08-29 20:19:31,130 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-29 20:19:31,130 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:19:31,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:19:31,131 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:19:31,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-08-29 20:19:31,239 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-29 20:19:31,239 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:19:31,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:19:31,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:19:31,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:19:31,276 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:19:31,276 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:19:31,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [592303812] [2023-08-29 20:19:31,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [592303812] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:19:31,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:19:31,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:19:31,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835645851] [2023-08-29 20:19:31,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:19:31,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:19:31,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:19:31,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:19:31,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:19:31,288 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 276 [2023-08-29 20:19:31,289 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 37 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 130.75) internal successors, (523), 4 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:31,289 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:19:31,289 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 276 [2023-08-29 20:19:31,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:19:31,513 INFO L130 PetriNetUnfolder]: 1188/1887 cut-off events. [2023-08-29 20:19:31,513 INFO L131 PetriNetUnfolder]: For 1638/1639 co-relation queries the response was YES. [2023-08-29 20:19:31,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5762 conditions, 1887 events. 1188/1887 cut-off events. For 1638/1639 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 9393 event pairs, 159 based on Foata normal form. 1/1841 useless extension candidates. Maximal degree in co-relation 5750. Up to 999 conditions per place. [2023-08-29 20:19:31,516 INFO L137 encePairwiseOnDemand]: 273/276 looper letters, 44 selfloop transitions, 1 changer transitions 32/79 dead transitions. [2023-08-29 20:19:31,516 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 79 transitions, 520 flow [2023-08-29 20:19:31,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:19:31,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:19:31,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 548 transitions. [2023-08-29 20:19:31,522 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4963768115942029 [2023-08-29 20:19:31,522 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 548 transitions. [2023-08-29 20:19:31,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 548 transitions. [2023-08-29 20:19:31,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:19:31,523 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 548 transitions. [2023-08-29 20:19:31,524 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:31,526 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 276.0) internal successors, (1380), 5 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:31,526 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 276.0) internal successors, (1380), 5 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:31,526 INFO L175 Difference]: Start difference. First operand has 56 places, 37 transitions, 168 flow. Second operand 4 states and 548 transitions. [2023-08-29 20:19:31,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 79 transitions, 520 flow [2023-08-29 20:19:31,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 79 transitions, 507 flow, removed 2 selfloop flow, removed 6 redundant places. [2023-08-29 20:19:31,539 INFO L231 Difference]: Finished difference. Result has 53 places, 37 transitions, 164 flow [2023-08-29 20:19:31,539 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=164, PETRI_PLACES=53, PETRI_TRANSITIONS=37} [2023-08-29 20:19:31,539 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 4 predicate places. [2023-08-29 20:19:31,539 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 37 transitions, 164 flow [2023-08-29 20:19:31,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.75) internal successors, (523), 4 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:31,540 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:19:31,540 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] [2023-08-29 20:19:31,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-08-29 20:19:31,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:19:31,750 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-29 20:19:31,750 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:19:31,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1770717572, now seen corresponding path program 4 times [2023-08-29 20:19:31,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:19:31,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [873774611] [2023-08-29 20:19:31,751 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-29 20:19:31,751 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:19:31,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:19:31,752 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:19:31,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-08-29 20:19:31,869 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-29 20:19:31,869 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:19:31,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 19 conjunts are in the unsatisfiable core [2023-08-29 20:19:31,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:19:32,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:19:32,725 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:19:32,725 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:19:32,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [873774611] [2023-08-29 20:19:32,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [873774611] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:19:32,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:19:32,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:19:32,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026659372] [2023-08-29 20:19:32,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:19:32,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:19:32,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:19:32,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:19:32,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:19:32,786 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 276 [2023-08-29 20:19:32,787 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 37 transitions, 164 flow. Second operand has 7 states, 7 states have (on average 126.14285714285714) internal successors, (883), 7 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:32,787 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:19:32,787 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 276 [2023-08-29 20:19:32,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:19:33,138 INFO L130 PetriNetUnfolder]: 836/1393 cut-off events. [2023-08-29 20:19:33,138 INFO L131 PetriNetUnfolder]: For 1724/1729 co-relation queries the response was YES. [2023-08-29 20:19:33,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4454 conditions, 1393 events. 836/1393 cut-off events. For 1724/1729 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 6686 event pairs, 273 based on Foata normal form. 1/1330 useless extension candidates. Maximal degree in co-relation 4442. Up to 495 conditions per place. [2023-08-29 20:19:33,142 INFO L137 encePairwiseOnDemand]: 270/276 looper letters, 39 selfloop transitions, 4 changer transitions 50/96 dead transitions. [2023-08-29 20:19:33,142 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 96 transitions, 665 flow [2023-08-29 20:19:33,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:19:33,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:19:33,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 913 transitions. [2023-08-29 20:19:33,148 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4725672877846791 [2023-08-29 20:19:33,148 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 913 transitions. [2023-08-29 20:19:33,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 913 transitions. [2023-08-29 20:19:33,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:19:33,149 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 913 transitions. [2023-08-29 20:19:33,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 130.42857142857142) internal successors, (913), 7 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:33,153 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 276.0) internal successors, (2208), 8 states have internal predecessors, (2208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:33,154 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 276.0) internal successors, (2208), 8 states have internal predecessors, (2208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:33,154 INFO L175 Difference]: Start difference. First operand has 53 places, 37 transitions, 164 flow. Second operand 7 states and 913 transitions. [2023-08-29 20:19:33,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 96 transitions, 665 flow [2023-08-29 20:19:33,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 96 transitions, 659 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-29 20:19:33,163 INFO L231 Difference]: Finished difference. Result has 58 places, 37 transitions, 174 flow [2023-08-29 20:19:33,163 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=174, PETRI_PLACES=58, PETRI_TRANSITIONS=37} [2023-08-29 20:19:33,164 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 9 predicate places. [2023-08-29 20:19:33,164 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 37 transitions, 174 flow [2023-08-29 20:19:33,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 126.14285714285714) internal successors, (883), 7 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:33,164 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:19:33,165 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] [2023-08-29 20:19:33,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-08-29 20:19:33,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:19:33,374 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-29 20:19:33,375 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:19:33,375 INFO L85 PathProgramCache]: Analyzing trace with hash -249731726, now seen corresponding path program 5 times [2023-08-29 20:19:33,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:19:33,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1800930928] [2023-08-29 20:19:33,375 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-29 20:19:33,376 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:19:33,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:19:33,377 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:19:33,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-08-29 20:19:33,500 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-29 20:19:33,500 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-29 20:19:33,500 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:19:33,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:19:33,643 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-29 20:19:33,643 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:19:33,644 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-29 20:19:33,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-29 20:19:33,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-29 20:19:33,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-29 20:19:33,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-29 20:19:33,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-29 20:19:33,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-29 20:19:33,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-29 20:19:33,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-29 20:19:33,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-29 20:19:33,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-29 20:19:33,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-29 20:19:33,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-29 20:19:33,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-29 20:19:33,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-29 20:19:33,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-29 20:19:33,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-08-29 20:19:33,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:19:33,858 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:19:33,864 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:19:33,864 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:19:33,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:19:33 BasicIcfg [2023-08-29 20:19:33,946 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:19:33,947 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:19:33,947 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:19:33,947 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:19:33,947 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:19:15" (3/4) ... [2023-08-29 20:19:33,949 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:19:33,949 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:19:33,950 INFO L158 Benchmark]: Toolchain (without parser) took 19453.85ms. Allocated memory was 69.2MB in the beginning and 574.6MB in the end (delta: 505.4MB). Free memory was 40.2MB in the beginning and 329.3MB in the end (delta: -289.1MB). Peak memory consumption was 215.9MB. Max. memory is 16.1GB. [2023-08-29 20:19:33,950 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 56.6MB. Free memory is still 34.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:19:33,950 INFO L158 Benchmark]: CACSL2BoogieTranslator took 501.64ms. Allocated memory is still 69.2MB. Free memory was 40.0MB in the beginning and 31.2MB in the end (delta: 8.8MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. [2023-08-29 20:19:33,950 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.37ms. Allocated memory is still 69.2MB. Free memory was 31.2MB in the beginning and 48.1MB in the end (delta: -16.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-29 20:19:33,951 INFO L158 Benchmark]: Boogie Preprocessor took 52.21ms. Allocated memory is still 69.2MB. Free memory was 47.8MB in the beginning and 45.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:19:33,951 INFO L158 Benchmark]: RCFGBuilder took 770.82ms. Allocated memory was 69.2MB in the beginning and 88.1MB in the end (delta: 18.9MB). Free memory was 45.7MB in the beginning and 53.9MB in the end (delta: -8.2MB). Peak memory consumption was 23.6MB. Max. memory is 16.1GB. [2023-08-29 20:19:33,951 INFO L158 Benchmark]: TraceAbstraction took 18057.15ms. Allocated memory was 88.1MB in the beginning and 574.6MB in the end (delta: 486.5MB). Free memory was 53.4MB in the beginning and 330.3MB in the end (delta: -276.9MB). Peak memory consumption was 211.0MB. Max. memory is 16.1GB. [2023-08-29 20:19:33,951 INFO L158 Benchmark]: Witness Printer took 2.69ms. Allocated memory is still 574.6MB. Free memory is still 329.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:19:33,953 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.11ms. Allocated memory is still 56.6MB. Free memory is still 34.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 501.64ms. Allocated memory is still 69.2MB. Free memory was 40.0MB in the beginning and 31.2MB in the end (delta: 8.8MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.37ms. Allocated memory is still 69.2MB. Free memory was 31.2MB in the beginning and 48.1MB in the end (delta: -16.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.21ms. Allocated memory is still 69.2MB. Free memory was 47.8MB in the beginning and 45.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 770.82ms. Allocated memory was 69.2MB in the beginning and 88.1MB in the end (delta: 18.9MB). Free memory was 45.7MB in the beginning and 53.9MB in the end (delta: -8.2MB). Peak memory consumption was 23.6MB. Max. memory is 16.1GB. * TraceAbstraction took 18057.15ms. Allocated memory was 88.1MB in the beginning and 574.6MB in the end (delta: 486.5MB). Free memory was 53.4MB in the beginning and 330.3MB in the end (delta: -276.9MB). Peak memory consumption was 211.0MB. Max. memory is 16.1GB. * Witness Printer took 2.69ms. Allocated memory is still 574.6MB. Free memory is still 329.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.6s, 149 PlacesBefore, 49 PlacesAfterwards, 138 TransitionsBefore, 36 TransitionsAfterwards, 3024 CoEnabledTransitionPairs, 7 FixpointIterations, 56 TrivialSequentialCompositions, 67 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 134 TotalNumberOfCompositions, 7555 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3464, independent: 3264, independent conditional: 0, independent unconditional: 3264, dependent: 200, dependent conditional: 0, dependent unconditional: 200, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1635, independent: 1596, independent conditional: 0, independent unconditional: 1596, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3464, independent: 1668, independent conditional: 0, independent unconditional: 1668, dependent: 161, dependent conditional: 0, dependent unconditional: 161, unknown: 1635, unknown conditional: 0, unknown unconditional: 1635] , Statistics on independence cache: Total cache size (in pairs): 152, Positive cache size: 136, Positive conditional cache size: 0, Positive unconditional cache size: 136, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, 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; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L866] 0 pthread_t t445; [L867] FCALL, FORK 0 pthread_create(&t445, ((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}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t445, ((void *)0), P0, ((void *)0))=-1, t445={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] [L868] 0 pthread_t t446; [L869] FCALL, FORK 0 pthread_create(&t446, ((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}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t446, ((void *)0), P1, ((void *)0))=0, t445={11:0}, t446={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] [L870] 0 pthread_t t447; [L871] FCALL, FORK 0 pthread_create(&t447, ((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}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t447, ((void *)0), P2, ((void *)0))=1, t445={11:0}, t446={15:0}, t447={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] [L872] 0 pthread_t t448; [L873] FCALL, FORK 0 pthread_create(&t448, ((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}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t448, ((void *)0), P3, ((void *)0))=2, t445={11:0}, t446={15:0}, t447={7:0}, t448={-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] [L812] 4 z$w_buff1 = z$w_buff0 [L813] 4 z$w_buff0 = 1 [L814] 4 z$w_buff1_used = z$w_buff0_used [L815] 4 z$w_buff0_used = (_Bool)1 [L816] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L816] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L817] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L818] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L819] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L820] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L821] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L822] 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}, 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] [L825] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L826] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L827] 4 z$flush_delayed = weak$$choice2 [L828] 4 z$mem_tmp = z [L829] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L830] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L831] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L832] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L833] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L834] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L835] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L836] 4 __unbuffered_p3_EAX = z [L837] 4 z = z$flush_delayed ? z$mem_tmp : z [L838] 4 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=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, 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] [L841] 4 __unbuffered_p3_EBX = 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=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, 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] [L754] 1 a = 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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, 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] [L757] 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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, 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] [L769] 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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, 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] [L772] 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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, 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] [L784] 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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, 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] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L787] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L788] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L789] 3 z$flush_delayed = weak$$choice2 [L790] 3 z$mem_tmp = z [L791] 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) [L792] 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)) [L793] 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)) [L794] 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)) [L795] 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)) [L796] 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)) [L797] 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)) [L798] 3 __unbuffered_p2_EAX = z [L799] 3 z = z$flush_delayed ? z$mem_tmp : z [L800] 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}, 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] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 3 return 0; [L844] 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) [L845] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L846] 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 [L847] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L848] 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}, 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] [L851] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L853] 4 return 0; [L875] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L877] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L877] RET 0 assume_abort_if_not(main$tmp_guard0) [L879] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L880] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L881] 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 [L882] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L883] 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}, main$tmp_guard0=1, main$tmp_guard1=0, t445={11:0}, t446={15:0}, t447={7:0}, t448={-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] [L886] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L888] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_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}, 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: 864]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 871]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 867]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 873]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 176 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 17.9s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 534 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 404 mSDsluCounter, 197 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 150 mSDsCounter, 64 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2178 IncrementalHoareTripleChecker+Invalid, 2242 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 64 mSolverCounterUnsat, 47 mSDtfsCounter, 2178 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 196 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=220occurred in iteration=5, InterpolantAutomatonStates: 56, 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.3s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 222 NumberOfCodeBlocks, 222 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 186 ConstructedInterpolants, 17 QuantifiedInterpolants, 1934 SizeOfPredicates, 17 NumberOfNonLiveVariables, 1677 ConjunctsInSsa, 87 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-29 20:19:33,975 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