./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/rfi009_rmo.oepc.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi009_rmo.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6efd977ba774fd706e089a911dcd82549d76c764859cf8b84047b990ab28d067 --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:33:06,751 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:33:06,753 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:33:06,786 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:33:06,787 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:33:06,790 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:33:06,792 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:33:06,794 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:33:06,796 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:33:06,801 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:33:06,802 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:33:06,804 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:33:06,805 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:33:06,807 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:33:06,809 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:33:06,814 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:33:06,815 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:33:06,816 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:33:06,818 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:33:06,822 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:33:06,831 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:33:06,832 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:33:06,833 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:33:06,834 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:33:06,840 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:33:06,841 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:33:06,841 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:33:06,843 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:33:06,844 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:33:06,845 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:33:06,845 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:33:06,846 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:33:06,848 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:33:06,848 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:33:06,849 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:33:06,849 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:33:06,850 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:33:06,850 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:33:06,850 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:33:06,851 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:33:06,852 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:33:06,853 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:33:06,893 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:33:06,893 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:33:06,894 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:33:06,894 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:33:06,895 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:33:06,896 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:33:06,896 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:33:06,896 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:33:06,896 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:33:06,897 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:33:06,898 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:33:06,898 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:33:06,898 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:33:06,898 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:33:06,898 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:33:06,899 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:33:06,899 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:33:06,899 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:33:06,899 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:33:06,899 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:33:06,899 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:33:06,900 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:33:06,900 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:33:06,900 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:33:06,900 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:33:06,900 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:33:06,901 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:33:06,901 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:33:06,901 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 20:33:06,901 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 20:33:06,901 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:33:06,902 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:33:06,902 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:33:06,902 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:33:06,902 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 -> 6efd977ba774fd706e089a911dcd82549d76c764859cf8b84047b990ab28d067 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:33:07,211 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:33:07,232 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:33:07,234 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:33:07,235 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:33:07,236 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:33:07,237 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi009_rmo.oepc.i [2023-08-29 20:33:08,506 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:33:08,758 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:33:08,759 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi009_rmo.oepc.i [2023-08-29 20:33:08,781 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2f25a8d6/3dce4e6f3da345a098aa187a14f08145/FLAG3fd3631ec [2023-08-29 20:33:08,791 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2f25a8d6/3dce4e6f3da345a098aa187a14f08145 [2023-08-29 20:33:08,794 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:33:08,795 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:33:08,796 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:33:08,796 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:33:08,799 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:33:08,799 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:33:08" (1/1) ... [2023-08-29 20:33:08,800 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ee5a31e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:33:08, skipping insertion in model container [2023-08-29 20:33:08,801 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:33:08" (1/1) ... [2023-08-29 20:33:08,806 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:33:08,861 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:33:08,982 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/rfi009_rmo.oepc.i[992,1005] [2023-08-29 20:33:09,226 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:33:09,239 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:33:09,252 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/rfi009_rmo.oepc.i[992,1005] [2023-08-29 20:33:09,328 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:33:09,383 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:33:09,383 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:33:09,389 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:33:09,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:33:09 WrapperNode [2023-08-29 20:33:09,389 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:33:09,391 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:33:09,391 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:33:09,391 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:33:09,397 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:33:09" (1/1) ... [2023-08-29 20:33:09,427 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:33:09" (1/1) ... [2023-08-29 20:33:09,451 INFO L138 Inliner]: procedures = 176, calls = 73, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 138 [2023-08-29 20:33:09,451 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:33:09,452 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:33:09,452 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:33:09,452 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:33:09,459 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:33:09" (1/1) ... [2023-08-29 20:33:09,460 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:33:09" (1/1) ... [2023-08-29 20:33:09,466 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:33:09" (1/1) ... [2023-08-29 20:33:09,473 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:33:09" (1/1) ... [2023-08-29 20:33:09,493 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:33:09" (1/1) ... [2023-08-29 20:33:09,495 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:33:09" (1/1) ... [2023-08-29 20:33:09,497 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:33:09" (1/1) ... [2023-08-29 20:33:09,499 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:33:09" (1/1) ... [2023-08-29 20:33:09,502 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:33:09,516 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:33:09,517 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:33:09,517 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:33:09,518 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:33:09" (1/1) ... [2023-08-29 20:33:09,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:33:09,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:33:09,546 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:33:09,568 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:33:09,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-29 20:33:09,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 20:33:09,582 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:33:09,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:33:09,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:33:09,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:33:09,584 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:33:09,584 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:33:09,584 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:33:09,584 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:33:09,585 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-29 20:33:09,585 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-29 20:33:09,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-29 20:33:09,585 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:33:09,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:33:09,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:33:09,586 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:33:09,769 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:33:09,770 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:33:10,201 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:33:10,686 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:33:10,686 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:33:10,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:33:10 BoogieIcfgContainer [2023-08-29 20:33:10,689 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:33:10,690 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:33:10,690 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:33:10,693 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:33:10,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:33:08" (1/3) ... [2023-08-29 20:33:10,694 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@604f95a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:33:10, skipping insertion in model container [2023-08-29 20:33:10,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:33:09" (2/3) ... [2023-08-29 20:33:10,694 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@604f95a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:33:10, skipping insertion in model container [2023-08-29 20:33:10,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:33:10" (3/3) ... [2023-08-29 20:33:10,695 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi009_rmo.oepc.i [2023-08-29 20:33:10,711 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:33:10,711 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2023-08-29 20:33:10,711 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:33:10,805 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:33:10,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 179 places, 171 transitions, 357 flow [2023-08-29 20:33:10,900 INFO L130 PetriNetUnfolder]: 2/168 cut-off events. [2023-08-29 20:33:10,900 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:33:10,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178 conditions, 168 events. 2/168 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 242 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 109. Up to 2 conditions per place. [2023-08-29 20:33:10,906 INFO L82 GeneralOperation]: Start removeDead. Operand has 179 places, 171 transitions, 357 flow [2023-08-29 20:33:10,911 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 176 places, 168 transitions, 345 flow [2023-08-29 20:33:10,914 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:33:10,934 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 168 transitions, 345 flow [2023-08-29 20:33:10,938 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 176 places, 168 transitions, 345 flow [2023-08-29 20:33:10,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 176 places, 168 transitions, 345 flow [2023-08-29 20:33:11,001 INFO L130 PetriNetUnfolder]: 2/168 cut-off events. [2023-08-29 20:33:11,001 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:33:11,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178 conditions, 168 events. 2/168 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 244 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 109. Up to 2 conditions per place. [2023-08-29 20:33:11,007 INFO L119 LiptonReduction]: Number of co-enabled transitions 6286 [2023-08-29 20:33:17,971 INFO L134 LiptonReduction]: Checked pairs total: 30012 [2023-08-29 20:33:17,972 INFO L136 LiptonReduction]: Total number of compositions: 143 [2023-08-29 20:33:17,982 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:33:17,987 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;@45cb3a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:33:17,988 INFO L358 AbstractCegarLoop]: Starting to check reachability of 77 error locations. [2023-08-29 20:33:17,990 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-29 20:33:17,990 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:33:17,990 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:33:17,991 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:33:17,991 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-08-29 20:33:17,996 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:33:17,996 INFO L85 PathProgramCache]: Analyzing trace with hash 972, now seen corresponding path program 1 times [2023-08-29 20:33:18,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:33:18,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564985808] [2023-08-29 20:33:18,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:33:18,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:33:18,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:33:18,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:33:18,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:33:18,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564985808] [2023-08-29 20:33:18,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564985808] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:33:18,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:33:18,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:33:18,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321657035] [2023-08-29 20:33:18,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:33:18,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:33:18,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:33:18,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:33:18,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:33:18,118 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 314 [2023-08-29 20:33:18,120 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 68 transitions, 145 flow. Second operand has 2 states, 2 states have (on average 126.5) internal successors, (253), 2 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:18,120 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:33:18,120 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 314 [2023-08-29 20:33:18,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:33:20,235 INFO L130 PetriNetUnfolder]: 11260/15873 cut-off events. [2023-08-29 20:33:20,237 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2023-08-29 20:33:20,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31816 conditions, 15873 events. 11260/15873 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 1266. Compared 99965 event pairs, 11260 based on Foata normal form. 0/7395 useless extension candidates. Maximal degree in co-relation 31805. Up to 15867 conditions per place. [2023-08-29 20:33:20,351 INFO L137 encePairwiseOnDemand]: 288/314 looper letters, 40 selfloop transitions, 0 changer transitions 0/42 dead transitions. [2023-08-29 20:33:20,351 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 42 transitions, 173 flow [2023-08-29 20:33:20,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:33:20,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:33:20,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 318 transitions. [2023-08-29 20:33:20,376 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5063694267515924 [2023-08-29 20:33:20,377 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 318 transitions. [2023-08-29 20:33:20,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 318 transitions. [2023-08-29 20:33:20,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:33:20,383 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 318 transitions. [2023-08-29 20:33:20,385 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 159.0) internal successors, (318), 2 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:20,389 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 314.0) internal successors, (942), 3 states have internal predecessors, (942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:20,390 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 314.0) internal successors, (942), 3 states have internal predecessors, (942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:20,391 INFO L175 Difference]: Start difference. First operand has 78 places, 68 transitions, 145 flow. Second operand 2 states and 318 transitions. [2023-08-29 20:33:20,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 42 transitions, 173 flow [2023-08-29 20:33:20,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 42 transitions, 170 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 20:33:20,401 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 90 flow [2023-08-29 20:33:20,403 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=90, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2023-08-29 20:33:20,406 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -28 predicate places. [2023-08-29 20:33:20,407 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 90 flow [2023-08-29 20:33:20,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 126.5) internal successors, (253), 2 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:20,408 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:33:20,409 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 20:33:20,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 20:33:20,412 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-08-29 20:33:20,420 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:33:20,421 INFO L85 PathProgramCache]: Analyzing trace with hash 960548, now seen corresponding path program 1 times [2023-08-29 20:33:20,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:33:20,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54194582] [2023-08-29 20:33:20,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:33:20,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:33:20,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:33:20,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:33:20,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:33:20,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54194582] [2023-08-29 20:33:20,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54194582] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:33:20,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:33:20,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:33:20,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577182582] [2023-08-29 20:33:20,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:33:20,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:33:20,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:33:20,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:33:20,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:33:20,694 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 314 [2023-08-29 20:33:20,695 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:20,695 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:33:20,695 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 314 [2023-08-29 20:33:20,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:33:22,104 INFO L130 PetriNetUnfolder]: 7440/11019 cut-off events. [2023-08-29 20:33:22,105 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:33:22,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22005 conditions, 11019 events. 7440/11019 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 801. Compared 70980 event pairs, 4668 based on Foata normal form. 0/6425 useless extension candidates. Maximal degree in co-relation 22002. Up to 6813 conditions per place. [2023-08-29 20:33:22,177 INFO L137 encePairwiseOnDemand]: 298/314 looper letters, 45 selfloop transitions, 9 changer transitions 0/56 dead transitions. [2023-08-29 20:33:22,177 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 56 transitions, 226 flow [2023-08-29 20:33:22,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:33:22,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:33:22,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2023-08-29 20:33:22,181 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4469214437367304 [2023-08-29 20:33:22,181 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 421 transitions. [2023-08-29 20:33:22,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 421 transitions. [2023-08-29 20:33:22,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:33:22,182 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 421 transitions. [2023-08-29 20:33:22,183 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:33:22,187 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 314.0) internal successors, (1256), 4 states have internal predecessors, (1256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:22,187 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 314.0) internal successors, (1256), 4 states have internal predecessors, (1256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:22,188 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 90 flow. Second operand 3 states and 421 transitions. [2023-08-29 20:33:22,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 56 transitions, 226 flow [2023-08-29 20:33:22,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 56 transitions, 226 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:33:22,190 INFO L231 Difference]: Finished difference. Result has 52 places, 47 transitions, 160 flow [2023-08-29 20:33:22,190 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=52, PETRI_TRANSITIONS=47} [2023-08-29 20:33:22,190 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -26 predicate places. [2023-08-29 20:33:22,191 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 47 transitions, 160 flow [2023-08-29 20:33:22,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:22,191 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:33:22,191 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 20:33:22,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-29 20:33:22,192 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-08-29 20:33:22,194 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:33:22,194 INFO L85 PathProgramCache]: Analyzing trace with hash 960549, now seen corresponding path program 1 times [2023-08-29 20:33:22,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:33:22,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529802973] [2023-08-29 20:33:22,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:33:22,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:33:22,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:33:22,352 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:33:22,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:33:22,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529802973] [2023-08-29 20:33:22,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529802973] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:33:22,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:33:22,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:33:22,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506205127] [2023-08-29 20:33:22,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:33:22,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:33:22,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:33:22,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:33:22,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:33:22,380 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 314 [2023-08-29 20:33:22,381 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 47 transitions, 160 flow. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:22,381 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:33:22,381 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 314 [2023-08-29 20:33:22,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:33:22,909 INFO L130 PetriNetUnfolder]: 2598/4056 cut-off events. [2023-08-29 20:33:22,909 INFO L131 PetriNetUnfolder]: For 1136/1136 co-relation queries the response was YES. [2023-08-29 20:33:22,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11323 conditions, 4056 events. 2598/4056 cut-off events. For 1136/1136 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 23864 event pairs, 1942 based on Foata normal form. 1105/4677 useless extension candidates. Maximal degree in co-relation 11318. Up to 4004 conditions per place. [2023-08-29 20:33:22,932 INFO L137 encePairwiseOnDemand]: 306/314 looper letters, 37 selfloop transitions, 1 changer transitions 0/40 dead transitions. [2023-08-29 20:33:22,932 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 40 transitions, 222 flow [2023-08-29 20:33:22,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:33:22,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:33:22,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 410 transitions. [2023-08-29 20:33:22,934 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43524416135881105 [2023-08-29 20:33:22,934 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 410 transitions. [2023-08-29 20:33:22,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 410 transitions. [2023-08-29 20:33:22,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:33:22,935 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 410 transitions. [2023-08-29 20:33:22,936 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:22,938 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 314.0) internal successors, (1256), 4 states have internal predecessors, (1256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:22,938 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 314.0) internal successors, (1256), 4 states have internal predecessors, (1256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:22,938 INFO L175 Difference]: Start difference. First operand has 52 places, 47 transitions, 160 flow. Second operand 3 states and 410 transitions. [2023-08-29 20:33:22,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 40 transitions, 222 flow [2023-08-29 20:33:22,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 40 transitions, 204 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:33:22,950 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 130 flow [2023-08-29 20:33:22,951 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2023-08-29 20:33:22,952 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -33 predicate places. [2023-08-29 20:33:22,954 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 130 flow [2023-08-29 20:33:22,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:22,955 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:33:22,955 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:33:22,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-29 20:33:22,956 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-08-29 20:33:22,956 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:33:22,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1364936896, now seen corresponding path program 1 times [2023-08-29 20:33:22,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:33:22,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302630726] [2023-08-29 20:33:22,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:33:22,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:33:23,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:33:23,139 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:33:23,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:33:23,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302630726] [2023-08-29 20:33:23,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302630726] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:33:23,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:33:23,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:33:23,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27860100] [2023-08-29 20:33:23,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:33:23,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:33:23,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:33:23,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:33:23,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:33:23,146 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 314 [2023-08-29 20:33:23,146 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:23,147 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:33:23,150 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 314 [2023-08-29 20:33:23,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:33:23,644 INFO L130 PetriNetUnfolder]: 2518/4058 cut-off events. [2023-08-29 20:33:23,644 INFO L131 PetriNetUnfolder]: For 488/491 co-relation queries the response was YES. [2023-08-29 20:33:23,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10349 conditions, 4058 events. 2518/4058 cut-off events. For 488/491 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 25047 event pairs, 1068 based on Foata normal form. 0/3197 useless extension candidates. Maximal degree in co-relation 10344. Up to 2515 conditions per place. [2023-08-29 20:33:23,663 INFO L137 encePairwiseOnDemand]: 310/314 looper letters, 65 selfloop transitions, 3 changer transitions 0/70 dead transitions. [2023-08-29 20:33:23,663 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 70 transitions, 364 flow [2023-08-29 20:33:23,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:33:23,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:33:23,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 432 transitions. [2023-08-29 20:33:23,665 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4585987261146497 [2023-08-29 20:33:23,665 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 432 transitions. [2023-08-29 20:33:23,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 432 transitions. [2023-08-29 20:33:23,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:33:23,666 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 432 transitions. [2023-08-29 20:33:23,667 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:23,669 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 314.0) internal successors, (1256), 4 states have internal predecessors, (1256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:23,669 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 314.0) internal successors, (1256), 4 states have internal predecessors, (1256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:23,670 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 130 flow. Second operand 3 states and 432 transitions. [2023-08-29 20:33:23,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 70 transitions, 364 flow [2023-08-29 20:33:23,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 70 transitions, 363 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:33:23,672 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 142 flow [2023-08-29 20:33:23,672 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2023-08-29 20:33:23,673 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -31 predicate places. [2023-08-29 20:33:23,673 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 142 flow [2023-08-29 20:33:23,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:23,673 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:33:23,673 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:33:23,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-29 20:33:23,674 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-08-29 20:33:23,674 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:33:23,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1364937120, now seen corresponding path program 1 times [2023-08-29 20:33:23,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:33:23,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155786344] [2023-08-29 20:33:23,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:33:23,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:33:23,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:33:23,958 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:33:23,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:33:23,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155786344] [2023-08-29 20:33:23,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155786344] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:33:23,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:33:23,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:33:23,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108010331] [2023-08-29 20:33:23,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:33:23,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:33:23,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:33:23,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:33:23,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:33:23,963 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 314 [2023-08-29 20:33:23,964 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:23,964 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:33:23,964 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 314 [2023-08-29 20:33:23,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:33:24,581 INFO L130 PetriNetUnfolder]: 3060/4737 cut-off events. [2023-08-29 20:33:24,581 INFO L131 PetriNetUnfolder]: For 1236/1236 co-relation queries the response was YES. [2023-08-29 20:33:24,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13044 conditions, 4737 events. 3060/4737 cut-off events. For 1236/1236 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 28444 event pairs, 948 based on Foata normal form. 0/3956 useless extension candidates. Maximal degree in co-relation 13038. Up to 3264 conditions per place. [2023-08-29 20:33:24,607 INFO L137 encePairwiseOnDemand]: 311/314 looper letters, 64 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2023-08-29 20:33:24,608 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 67 transitions, 374 flow [2023-08-29 20:33:24,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:33:24,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:33:24,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 426 transitions. [2023-08-29 20:33:24,610 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45222929936305734 [2023-08-29 20:33:24,610 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 426 transitions. [2023-08-29 20:33:24,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 426 transitions. [2023-08-29 20:33:24,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:33:24,611 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 426 transitions. [2023-08-29 20:33:24,612 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:24,614 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 314.0) internal successors, (1256), 4 states have internal predecessors, (1256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:24,614 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 314.0) internal successors, (1256), 4 states have internal predecessors, (1256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:24,614 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 142 flow. Second operand 3 states and 426 transitions. [2023-08-29 20:33:24,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 67 transitions, 374 flow [2023-08-29 20:33:24,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 67 transitions, 364 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:33:24,617 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 144 flow [2023-08-29 20:33:24,617 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2023-08-29 20:33:24,620 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -30 predicate places. [2023-08-29 20:33:24,620 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 144 flow [2023-08-29 20:33:24,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:24,620 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:33:24,621 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:33:24,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-29 20:33:24,621 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-08-29 20:33:24,621 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:33:24,621 INFO L85 PathProgramCache]: Analyzing trace with hash 950502690, now seen corresponding path program 1 times [2023-08-29 20:33:24,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:33:24,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653082733] [2023-08-29 20:33:24,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:33:24,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:33:24,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:33:24,874 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:33:24,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:33:24,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653082733] [2023-08-29 20:33:24,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653082733] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:33:24,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:33:24,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:33:24,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297940770] [2023-08-29 20:33:24,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:33:24,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:33:24,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:33:24,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:33:24,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:33:24,991 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 314 [2023-08-29 20:33:24,992 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 144 flow. Second operand has 6 states, 6 states have (on average 118.0) internal successors, (708), 6 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:24,992 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:33:24,992 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 314 [2023-08-29 20:33:24,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:33:25,692 INFO L130 PetriNetUnfolder]: 2425/3987 cut-off events. [2023-08-29 20:33:25,692 INFO L131 PetriNetUnfolder]: For 499/502 co-relation queries the response was YES. [2023-08-29 20:33:25,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10503 conditions, 3987 events. 2425/3987 cut-off events. For 499/502 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 25501 event pairs, 747 based on Foata normal form. 0/3238 useless extension candidates. Maximal degree in co-relation 10496. Up to 1468 conditions per place. [2023-08-29 20:33:25,716 INFO L137 encePairwiseOnDemand]: 304/314 looper letters, 61 selfloop transitions, 10 changer transitions 0/73 dead transitions. [2023-08-29 20:33:25,716 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 73 transitions, 390 flow [2023-08-29 20:33:25,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:33:25,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:33:25,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 645 transitions. [2023-08-29 20:33:25,719 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.410828025477707 [2023-08-29 20:33:25,719 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 645 transitions. [2023-08-29 20:33:25,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 645 transitions. [2023-08-29 20:33:25,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:33:25,720 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 645 transitions. [2023-08-29 20:33:25,722 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.0) internal successors, (645), 5 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:25,724 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 314.0) internal successors, (1884), 6 states have internal predecessors, (1884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:25,725 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 314.0) internal successors, (1884), 6 states have internal predecessors, (1884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:25,725 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 144 flow. Second operand 5 states and 645 transitions. [2023-08-29 20:33:25,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 73 transitions, 390 flow [2023-08-29 20:33:25,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 73 transitions, 386 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:33:25,728 INFO L231 Difference]: Finished difference. Result has 51 places, 46 transitions, 214 flow [2023-08-29 20:33:25,728 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=214, PETRI_PLACES=51, PETRI_TRANSITIONS=46} [2023-08-29 20:33:25,729 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -27 predicate places. [2023-08-29 20:33:25,729 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 46 transitions, 214 flow [2023-08-29 20:33:25,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 118.0) internal successors, (708), 6 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:25,730 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:33:25,730 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:33:25,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-29 20:33:25,730 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-08-29 20:33:25,730 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:33:25,731 INFO L85 PathProgramCache]: Analyzing trace with hash -636623371, now seen corresponding path program 1 times [2023-08-29 20:33:25,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:33:25,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005826701] [2023-08-29 20:33:25,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:33:25,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:33:25,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:33:25,996 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:33:25,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:33:25,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005826701] [2023-08-29 20:33:25,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005826701] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:33:25,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:33:25,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:33:25,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548837847] [2023-08-29 20:33:25,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:33:25,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:33:25,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:33:25,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:33:26,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:33:26,056 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 314 [2023-08-29 20:33:26,057 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 46 transitions, 214 flow. Second operand has 5 states, 5 states have (on average 120.4) internal successors, (602), 5 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:26,057 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:33:26,057 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 314 [2023-08-29 20:33:26,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:33:26,891 INFO L130 PetriNetUnfolder]: 3579/5704 cut-off events. [2023-08-29 20:33:26,891 INFO L131 PetriNetUnfolder]: For 3480/3483 co-relation queries the response was YES. [2023-08-29 20:33:26,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17012 conditions, 5704 events. 3579/5704 cut-off events. For 3480/3483 co-relation queries the response was YES. Maximal size of possible extension queue 462. Compared 37292 event pairs, 1256 based on Foata normal form. 32/5241 useless extension candidates. Maximal degree in co-relation 17003. Up to 3175 conditions per place. [2023-08-29 20:33:26,926 INFO L137 encePairwiseOnDemand]: 306/314 looper letters, 75 selfloop transitions, 11 changer transitions 0/88 dead transitions. [2023-08-29 20:33:26,927 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 88 transitions, 550 flow [2023-08-29 20:33:26,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:33:26,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:33:26,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 657 transitions. [2023-08-29 20:33:26,930 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41847133757961785 [2023-08-29 20:33:26,930 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 657 transitions. [2023-08-29 20:33:26,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 657 transitions. [2023-08-29 20:33:26,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:33:26,931 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 657 transitions. [2023-08-29 20:33:26,932 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 131.4) internal successors, (657), 5 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:26,934 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 314.0) internal successors, (1884), 6 states have internal predecessors, (1884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:26,935 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 314.0) internal successors, (1884), 6 states have internal predecessors, (1884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:26,935 INFO L175 Difference]: Start difference. First operand has 51 places, 46 transitions, 214 flow. Second operand 5 states and 657 transitions. [2023-08-29 20:33:26,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 88 transitions, 550 flow [2023-08-29 20:33:26,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 88 transitions, 545 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:33:26,961 INFO L231 Difference]: Finished difference. Result has 55 places, 53 transitions, 278 flow [2023-08-29 20:33:26,962 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=278, PETRI_PLACES=55, PETRI_TRANSITIONS=53} [2023-08-29 20:33:26,963 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -23 predicate places. [2023-08-29 20:33:26,963 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 53 transitions, 278 flow [2023-08-29 20:33:26,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 120.4) internal successors, (602), 5 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:26,963 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:33:26,963 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:33:26,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-29 20:33:26,964 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-08-29 20:33:26,964 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:33:26,964 INFO L85 PathProgramCache]: Analyzing trace with hash -138337345, now seen corresponding path program 2 times [2023-08-29 20:33:26,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:33:26,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133594777] [2023-08-29 20:33:26,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:33:26,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:33:26,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:33:27,307 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:33:27,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:33:27,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133594777] [2023-08-29 20:33:27,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133594777] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:33:27,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:33:27,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:33:27,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312790927] [2023-08-29 20:33:27,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:33:27,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:33:27,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:33:27,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:33:27,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:33:27,387 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 314 [2023-08-29 20:33:27,388 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 53 transitions, 278 flow. Second operand has 6 states, 6 states have (on average 121.0) internal successors, (726), 6 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:27,388 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:33:27,388 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 314 [2023-08-29 20:33:27,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:33:28,041 INFO L130 PetriNetUnfolder]: 3515/5608 cut-off events. [2023-08-29 20:33:28,041 INFO L131 PetriNetUnfolder]: For 5236/5248 co-relation queries the response was YES. [2023-08-29 20:33:28,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17685 conditions, 5608 events. 3515/5608 cut-off events. For 5236/5248 co-relation queries the response was YES. Maximal size of possible extension queue 457. Compared 36651 event pairs, 1242 based on Foata normal form. 34/5149 useless extension candidates. Maximal degree in co-relation 17674. Up to 4014 conditions per place. [2023-08-29 20:33:28,079 INFO L137 encePairwiseOnDemand]: 306/314 looper letters, 74 selfloop transitions, 10 changer transitions 0/86 dead transitions. [2023-08-29 20:33:28,079 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 86 transitions, 562 flow [2023-08-29 20:33:28,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:33:28,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:33:28,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 661 transitions. [2023-08-29 20:33:28,082 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4210191082802548 [2023-08-29 20:33:28,082 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 661 transitions. [2023-08-29 20:33:28,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 661 transitions. [2023-08-29 20:33:28,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:33:28,083 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 661 transitions. [2023-08-29 20:33:28,084 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.2) internal successors, (661), 5 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:28,086 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 314.0) internal successors, (1884), 6 states have internal predecessors, (1884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:28,087 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 314.0) internal successors, (1884), 6 states have internal predecessors, (1884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:28,087 INFO L175 Difference]: Start difference. First operand has 55 places, 53 transitions, 278 flow. Second operand 5 states and 661 transitions. [2023-08-29 20:33:28,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 86 transitions, 562 flow [2023-08-29 20:33:28,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 86 transitions, 542 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-08-29 20:33:28,113 INFO L231 Difference]: Finished difference. Result has 57 places, 56 transitions, 319 flow [2023-08-29 20:33:28,114 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=319, PETRI_PLACES=57, PETRI_TRANSITIONS=56} [2023-08-29 20:33:28,114 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -21 predicate places. [2023-08-29 20:33:28,114 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 56 transitions, 319 flow [2023-08-29 20:33:28,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.0) internal successors, (726), 6 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:28,115 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:33:28,115 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:33:28,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-29 20:33:28,116 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-08-29 20:33:28,116 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:33:28,116 INFO L85 PathProgramCache]: Analyzing trace with hash 967813466, now seen corresponding path program 1 times [2023-08-29 20:33:28,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:33:28,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235407395] [2023-08-29 20:33:28,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:33:28,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:33:28,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:33:28,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:33:28,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:33:28,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235407395] [2023-08-29 20:33:28,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235407395] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:33:28,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:33:28,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:33:28,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665093427] [2023-08-29 20:33:28,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:33:28,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:33:28,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:33:28,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:33:28,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:33:28,400 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 314 [2023-08-29 20:33:28,400 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 56 transitions, 319 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:33:28,400 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:33:28,401 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 314 [2023-08-29 20:33:28,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:33:28,983 INFO L130 PetriNetUnfolder]: 3486/5566 cut-off events. [2023-08-29 20:33:28,983 INFO L131 PetriNetUnfolder]: For 6427/6433 co-relation queries the response was YES. [2023-08-29 20:33:29,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17572 conditions, 5566 events. 3486/5566 cut-off events. For 6427/6433 co-relation queries the response was YES. Maximal size of possible extension queue 457. Compared 36540 event pairs, 1560 based on Foata normal form. 14/5086 useless extension candidates. Maximal degree in co-relation 17561. Up to 4087 conditions per place. [2023-08-29 20:33:29,021 INFO L137 encePairwiseOnDemand]: 311/314 looper letters, 71 selfloop transitions, 4 changer transitions 0/77 dead transitions. [2023-08-29 20:33:29,021 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 77 transitions, 543 flow [2023-08-29 20:33:29,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:33:29,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:33:29,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 431 transitions. [2023-08-29 20:33:29,023 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4575371549893843 [2023-08-29 20:33:29,023 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 431 transitions. [2023-08-29 20:33:29,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 431 transitions. [2023-08-29 20:33:29,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:33:29,074 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 431 transitions. [2023-08-29 20:33:29,075 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:29,077 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 314.0) internal successors, (1256), 4 states have internal predecessors, (1256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:29,077 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 314.0) internal successors, (1256), 4 states have internal predecessors, (1256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:29,077 INFO L175 Difference]: Start difference. First operand has 57 places, 56 transitions, 319 flow. Second operand 3 states and 431 transitions. [2023-08-29 20:33:29,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 77 transitions, 543 flow [2023-08-29 20:33:29,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 77 transitions, 538 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:33:29,101 INFO L231 Difference]: Finished difference. Result has 58 places, 56 transitions, 328 flow [2023-08-29 20:33:29,101 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=328, PETRI_PLACES=58, PETRI_TRANSITIONS=56} [2023-08-29 20:33:29,102 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -20 predicate places. [2023-08-29 20:33:29,102 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 56 transitions, 328 flow [2023-08-29 20:33:29,102 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:33:29,103 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:33:29,103 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:33:29,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-29 20:33:29,103 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-08-29 20:33:29,104 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:33:29,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1739536172, now seen corresponding path program 1 times [2023-08-29 20:33:29,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:33:29,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237050739] [2023-08-29 20:33:29,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:33:29,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:33:29,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:33:29,252 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:33:29,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:33:29,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237050739] [2023-08-29 20:33:29,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237050739] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:33:29,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:33:29,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:33:29,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579325661] [2023-08-29 20:33:29,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:33:29,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:33:29,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:33:29,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:33:29,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:33:29,345 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 314 [2023-08-29 20:33:29,346 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 56 transitions, 328 flow. Second operand has 5 states, 5 states have (on average 118.6) internal successors, (593), 5 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:29,346 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:33:29,346 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 314 [2023-08-29 20:33:29,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:33:29,945 INFO L130 PetriNetUnfolder]: 3065/4865 cut-off events. [2023-08-29 20:33:29,945 INFO L131 PetriNetUnfolder]: For 5975/5985 co-relation queries the response was YES. [2023-08-29 20:33:29,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16084 conditions, 4865 events. 3065/4865 cut-off events. For 5975/5985 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 30518 event pairs, 1153 based on Foata normal form. 78/4479 useless extension candidates. Maximal degree in co-relation 16072. Up to 1952 conditions per place. [2023-08-29 20:33:29,968 INFO L137 encePairwiseOnDemand]: 301/314 looper letters, 58 selfloop transitions, 15 changer transitions 0/75 dead transitions. [2023-08-29 20:33:29,969 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 75 transitions, 574 flow [2023-08-29 20:33:29,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:33:29,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:33:29,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 516 transitions. [2023-08-29 20:33:29,971 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.410828025477707 [2023-08-29 20:33:29,971 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 516 transitions. [2023-08-29 20:33:29,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 516 transitions. [2023-08-29 20:33:29,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:33:29,972 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 516 transitions. [2023-08-29 20:33:29,973 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:29,975 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 314.0) internal successors, (1570), 5 states have internal predecessors, (1570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:29,976 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 314.0) internal successors, (1570), 5 states have internal predecessors, (1570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:29,976 INFO L175 Difference]: Start difference. First operand has 58 places, 56 transitions, 328 flow. Second operand 4 states and 516 transitions. [2023-08-29 20:33:29,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 75 transitions, 574 flow [2023-08-29 20:33:29,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 75 transitions, 562 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:33:29,999 INFO L231 Difference]: Finished difference. Result has 61 places, 63 transitions, 446 flow [2023-08-29 20:33:29,999 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=446, PETRI_PLACES=61, PETRI_TRANSITIONS=63} [2023-08-29 20:33:30,000 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -17 predicate places. [2023-08-29 20:33:30,000 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 63 transitions, 446 flow [2023-08-29 20:33:30,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.6) internal successors, (593), 5 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:30,001 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:33:30,001 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:33:30,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-29 20:33:30,001 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-08-29 20:33:30,002 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:33:30,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1366221054, now seen corresponding path program 1 times [2023-08-29 20:33:30,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:33:30,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477948011] [2023-08-29 20:33:30,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:33:30,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:33:30,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:33:31,444 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:33:31,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:33:31,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477948011] [2023-08-29 20:33:31,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477948011] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:33:31,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:33:31,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:33:31,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993880839] [2023-08-29 20:33:31,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:33:31,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-29 20:33:31,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:33:31,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-29 20:33:31,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-08-29 20:33:31,604 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 314 [2023-08-29 20:33:31,605 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 63 transitions, 446 flow. Second operand has 8 states, 8 states have (on average 109.625) internal successors, (877), 8 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:31,606 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:33:31,606 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 314 [2023-08-29 20:33:31,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:33:32,539 INFO L130 PetriNetUnfolder]: 3212/5074 cut-off events. [2023-08-29 20:33:32,539 INFO L131 PetriNetUnfolder]: For 7357/7367 co-relation queries the response was YES. [2023-08-29 20:33:32,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18626 conditions, 5074 events. 3212/5074 cut-off events. For 7357/7367 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 31694 event pairs, 825 based on Foata normal form. 5/4605 useless extension candidates. Maximal degree in co-relation 18613. Up to 4339 conditions per place. [2023-08-29 20:33:32,562 INFO L137 encePairwiseOnDemand]: 302/314 looper letters, 98 selfloop transitions, 59 changer transitions 0/159 dead transitions. [2023-08-29 20:33:32,562 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 159 transitions, 1380 flow [2023-08-29 20:33:32,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-29 20:33:32,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-29 20:33:32,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1396 transitions. [2023-08-29 20:33:32,567 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37048832271762205 [2023-08-29 20:33:32,567 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1396 transitions. [2023-08-29 20:33:32,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1396 transitions. [2023-08-29 20:33:32,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:33:32,568 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1396 transitions. [2023-08-29 20:33:32,571 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 116.33333333333333) internal successors, (1396), 12 states have internal predecessors, (1396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:32,576 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 314.0) internal successors, (4082), 13 states have internal predecessors, (4082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:32,577 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 314.0) internal successors, (4082), 13 states have internal predecessors, (4082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:32,577 INFO L175 Difference]: Start difference. First operand has 61 places, 63 transitions, 446 flow. Second operand 12 states and 1396 transitions. [2023-08-29 20:33:32,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 159 transitions, 1380 flow [2023-08-29 20:33:32,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 159 transitions, 1373 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:33:32,612 INFO L231 Difference]: Finished difference. Result has 76 places, 116 transitions, 1111 flow [2023-08-29 20:33:32,612 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1111, PETRI_PLACES=76, PETRI_TRANSITIONS=116} [2023-08-29 20:33:32,612 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -2 predicate places. [2023-08-29 20:33:32,613 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 116 transitions, 1111 flow [2023-08-29 20:33:32,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 109.625) internal successors, (877), 8 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:32,613 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:33:32,613 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:33:32,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-29 20:33:32,614 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-08-29 20:33:32,614 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:33:32,614 INFO L85 PathProgramCache]: Analyzing trace with hash -569721640, now seen corresponding path program 2 times [2023-08-29 20:33:32,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:33:32,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779160322] [2023-08-29 20:33:32,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:33:32,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:33:32,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:33:33,694 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:33:33,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:33:33,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779160322] [2023-08-29 20:33:33,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779160322] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:33:33,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:33:33,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:33:33,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493483731] [2023-08-29 20:33:33,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:33:33,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-29 20:33:33,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:33:33,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-29 20:33:33,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-08-29 20:33:33,918 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 314 [2023-08-29 20:33:33,919 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 116 transitions, 1111 flow. Second operand has 8 states, 8 states have (on average 108.625) internal successors, (869), 8 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:33,919 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:33:33,919 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 314 [2023-08-29 20:33:33,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:33:34,710 INFO L130 PetriNetUnfolder]: 3464/5456 cut-off events. [2023-08-29 20:33:34,710 INFO L131 PetriNetUnfolder]: For 11283/11317 co-relation queries the response was YES. [2023-08-29 20:33:34,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22481 conditions, 5456 events. 3464/5456 cut-off events. For 11283/11317 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 34473 event pairs, 1749 based on Foata normal form. 17/4978 useless extension candidates. Maximal degree in co-relation 22462. Up to 5078 conditions per place. [2023-08-29 20:33:34,735 INFO L137 encePairwiseOnDemand]: 303/314 looper letters, 136 selfloop transitions, 27 changer transitions 0/165 dead transitions. [2023-08-29 20:33:34,736 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 165 transitions, 1775 flow [2023-08-29 20:33:34,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:33:34,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:33:34,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 925 transitions. [2023-08-29 20:33:34,739 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3682324840764331 [2023-08-29 20:33:34,739 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 925 transitions. [2023-08-29 20:33:34,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 925 transitions. [2023-08-29 20:33:34,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:33:34,739 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 925 transitions. [2023-08-29 20:33:34,741 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 115.625) internal successors, (925), 8 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:34,744 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 314.0) internal successors, (2826), 9 states have internal predecessors, (2826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:34,745 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 314.0) internal successors, (2826), 9 states have internal predecessors, (2826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:34,745 INFO L175 Difference]: Start difference. First operand has 76 places, 116 transitions, 1111 flow. Second operand 8 states and 925 transitions. [2023-08-29 20:33:34,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 165 transitions, 1775 flow [2023-08-29 20:33:34,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 165 transitions, 1747 flow, removed 14 selfloop flow, removed 0 redundant places. [2023-08-29 20:33:34,781 INFO L231 Difference]: Finished difference. Result has 89 places, 138 transitions, 1452 flow [2023-08-29 20:33:34,781 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=1087, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1452, PETRI_PLACES=89, PETRI_TRANSITIONS=138} [2023-08-29 20:33:34,781 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, 11 predicate places. [2023-08-29 20:33:34,782 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 138 transitions, 1452 flow [2023-08-29 20:33:34,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 108.625) internal successors, (869), 8 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:34,782 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:33:34,782 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:33:34,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-29 20:33:34,783 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-08-29 20:33:34,783 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:33:34,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1150549318, now seen corresponding path program 3 times [2023-08-29 20:33:34,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:33:34,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997260748] [2023-08-29 20:33:34,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:33:34,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:33:34,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:33:35,819 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:33:35,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:33:35,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997260748] [2023-08-29 20:33:35,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997260748] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:33:35,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:33:35,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-29 20:33:35,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278902804] [2023-08-29 20:33:35,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:33:35,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 20:33:35,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:33:35,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 20:33:35,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-08-29 20:33:36,065 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 314 [2023-08-29 20:33:36,066 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 138 transitions, 1452 flow. Second operand has 9 states, 9 states have (on average 109.44444444444444) internal successors, (985), 9 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:36,066 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:33:36,066 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 314 [2023-08-29 20:33:36,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:33:37,121 INFO L130 PetriNetUnfolder]: 3471/5477 cut-off events. [2023-08-29 20:33:37,122 INFO L131 PetriNetUnfolder]: For 12798/12832 co-relation queries the response was YES. [2023-08-29 20:33:37,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23540 conditions, 5477 events. 3471/5477 cut-off events. For 12798/12832 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 34637 event pairs, 858 based on Foata normal form. 45/5024 useless extension candidates. Maximal degree in co-relation 23514. Up to 4655 conditions per place. [2023-08-29 20:33:37,154 INFO L137 encePairwiseOnDemand]: 302/314 looper letters, 137 selfloop transitions, 61 changer transitions 1/201 dead transitions. [2023-08-29 20:33:37,154 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 201 transitions, 2320 flow [2023-08-29 20:33:37,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-29 20:33:37,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-29 20:33:37,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1272 transitions. [2023-08-29 20:33:37,158 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3682686740011581 [2023-08-29 20:33:37,158 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1272 transitions. [2023-08-29 20:33:37,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1272 transitions. [2023-08-29 20:33:37,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:33:37,160 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1272 transitions. [2023-08-29 20:33:37,162 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 115.63636363636364) internal successors, (1272), 11 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:37,167 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 314.0) internal successors, (3768), 12 states have internal predecessors, (3768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:37,168 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 314.0) internal successors, (3768), 12 states have internal predecessors, (3768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:37,168 INFO L175 Difference]: Start difference. First operand has 89 places, 138 transitions, 1452 flow. Second operand 11 states and 1272 transitions. [2023-08-29 20:33:37,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 201 transitions, 2320 flow [2023-08-29 20:33:37,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 201 transitions, 2316 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-08-29 20:33:37,234 INFO L231 Difference]: Finished difference. Result has 106 places, 167 transitions, 2054 flow [2023-08-29 20:33:37,234 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=1448, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2054, PETRI_PLACES=106, PETRI_TRANSITIONS=167} [2023-08-29 20:33:37,235 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, 28 predicate places. [2023-08-29 20:33:37,235 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 167 transitions, 2054 flow [2023-08-29 20:33:37,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 109.44444444444444) internal successors, (985), 9 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:37,236 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:33:37,236 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:33:37,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-29 20:33:37,236 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-08-29 20:33:37,237 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:33:37,237 INFO L85 PathProgramCache]: Analyzing trace with hash -2045510362, now seen corresponding path program 4 times [2023-08-29 20:33:37,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:33:37,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427797628] [2023-08-29 20:33:37,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:33:37,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:33:37,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:33:38,484 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:33:38,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:33:38,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427797628] [2023-08-29 20:33:38,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427797628] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:33:38,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:33:38,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-29 20:33:38,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000083479] [2023-08-29 20:33:38,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:33:38,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 20:33:38,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:33:38,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 20:33:38,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-08-29 20:33:38,770 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 314 [2023-08-29 20:33:38,772 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 167 transitions, 2054 flow. Second operand has 9 states, 9 states have (on average 109.44444444444444) internal successors, (985), 9 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:38,772 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:33:38,772 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 314 [2023-08-29 20:33:38,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:33:39,917 INFO L130 PetriNetUnfolder]: 3462/5468 cut-off events. [2023-08-29 20:33:39,918 INFO L131 PetriNetUnfolder]: For 18865/18907 co-relation queries the response was YES. [2023-08-29 20:33:39,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25643 conditions, 5468 events. 3462/5468 cut-off events. For 18865/18907 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 34572 event pairs, 869 based on Foata normal form. 38/5178 useless extension candidates. Maximal degree in co-relation 25609. Up to 4695 conditions per place. [2023-08-29 20:33:39,958 INFO L137 encePairwiseOnDemand]: 304/314 looper letters, 123 selfloop transitions, 80 changer transitions 0/205 dead transitions. [2023-08-29 20:33:39,958 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 205 transitions, 2656 flow [2023-08-29 20:33:39,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-29 20:33:39,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-29 20:33:39,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1276 transitions. [2023-08-29 20:33:39,962 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36942675159235666 [2023-08-29 20:33:39,962 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1276 transitions. [2023-08-29 20:33:39,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1276 transitions. [2023-08-29 20:33:39,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:33:39,963 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1276 transitions. [2023-08-29 20:33:39,965 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 116.0) internal successors, (1276), 11 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:39,969 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 314.0) internal successors, (3768), 12 states have internal predecessors, (3768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:39,970 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 314.0) internal successors, (3768), 12 states have internal predecessors, (3768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:39,970 INFO L175 Difference]: Start difference. First operand has 106 places, 167 transitions, 2054 flow. Second operand 11 states and 1276 transitions. [2023-08-29 20:33:39,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 205 transitions, 2656 flow [2023-08-29 20:33:40,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 205 transitions, 2608 flow, removed 18 selfloop flow, removed 3 redundant places. [2023-08-29 20:33:40,074 INFO L231 Difference]: Finished difference. Result has 114 places, 171 transitions, 2230 flow [2023-08-29 20:33:40,075 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=2008, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2230, PETRI_PLACES=114, PETRI_TRANSITIONS=171} [2023-08-29 20:33:40,075 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, 36 predicate places. [2023-08-29 20:33:40,075 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 171 transitions, 2230 flow [2023-08-29 20:33:40,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 109.44444444444444) internal successors, (985), 9 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:40,076 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:33:40,076 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:33:40,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-29 20:33:40,076 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-08-29 20:33:40,077 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:33:40,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1908954123, now seen corresponding path program 1 times [2023-08-29 20:33:40,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:33:40,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956671309] [2023-08-29 20:33:40,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:33:40,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:33:40,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:33:40,336 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:33:40,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:33:40,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956671309] [2023-08-29 20:33:40,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956671309] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:33:40,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:33:40,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:33:40,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548565585] [2023-08-29 20:33:40,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:33:40,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-29 20:33:40,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:33:40,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-29 20:33:40,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2023-08-29 20:33:40,460 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 314 [2023-08-29 20:33:40,461 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 171 transitions, 2230 flow. Second operand has 8 states, 8 states have (on average 112.75) internal successors, (902), 8 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:40,461 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:33:40,461 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 314 [2023-08-29 20:33:40,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:33:41,161 INFO L130 PetriNetUnfolder]: 2755/4532 cut-off events. [2023-08-29 20:33:41,161 INFO L131 PetriNetUnfolder]: For 16301/16325 co-relation queries the response was YES. [2023-08-29 20:33:41,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20802 conditions, 4532 events. 2755/4532 cut-off events. For 16301/16325 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 29453 event pairs, 921 based on Foata normal form. 98/4470 useless extension candidates. Maximal degree in co-relation 20767. Up to 1947 conditions per place. [2023-08-29 20:33:41,190 INFO L137 encePairwiseOnDemand]: 300/314 looper letters, 148 selfloop transitions, 51 changer transitions 1/202 dead transitions. [2023-08-29 20:33:41,190 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 202 transitions, 2845 flow [2023-08-29 20:33:41,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:33:41,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:33:41,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 726 transitions. [2023-08-29 20:33:41,193 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3853503184713376 [2023-08-29 20:33:41,193 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 726 transitions. [2023-08-29 20:33:41,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 726 transitions. [2023-08-29 20:33:41,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:33:41,193 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 726 transitions. [2023-08-29 20:33:41,195 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 121.0) internal successors, (726), 6 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:41,197 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 314.0) internal successors, (2198), 7 states have internal predecessors, (2198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:41,198 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 314.0) internal successors, (2198), 7 states have internal predecessors, (2198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:41,198 INFO L175 Difference]: Start difference. First operand has 114 places, 171 transitions, 2230 flow. Second operand 6 states and 726 transitions. [2023-08-29 20:33:41,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 202 transitions, 2845 flow [2023-08-29 20:33:41,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 202 transitions, 2756 flow, removed 14 selfloop flow, removed 4 redundant places. [2023-08-29 20:33:41,269 INFO L231 Difference]: Finished difference. Result has 117 places, 177 transitions, 2413 flow [2023-08-29 20:33:41,269 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=2143, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2413, PETRI_PLACES=117, PETRI_TRANSITIONS=177} [2023-08-29 20:33:41,269 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, 39 predicate places. [2023-08-29 20:33:41,270 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 177 transitions, 2413 flow [2023-08-29 20:33:41,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 112.75) internal successors, (902), 8 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:41,270 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:33:41,270 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:33:41,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-29 20:33:41,270 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-08-29 20:33:41,270 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:33:41,270 INFO L85 PathProgramCache]: Analyzing trace with hash 951964938, now seen corresponding path program 1 times [2023-08-29 20:33:41,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:33:41,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11334753] [2023-08-29 20:33:41,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:33:41,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:33:41,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:33:41,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:33:41,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:33:41,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11334753] [2023-08-29 20:33:41,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11334753] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:33:41,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:33:41,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-29 20:33:41,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431325618] [2023-08-29 20:33:41,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:33:41,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 20:33:41,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:33:41,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 20:33:41,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-08-29 20:33:41,961 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 314 [2023-08-29 20:33:41,962 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 177 transitions, 2413 flow. Second operand has 9 states, 9 states have (on average 111.66666666666667) internal successors, (1005), 9 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:41,962 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:33:41,962 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 314 [2023-08-29 20:33:41,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:33:43,304 INFO L130 PetriNetUnfolder]: 4357/6935 cut-off events. [2023-08-29 20:33:43,305 INFO L131 PetriNetUnfolder]: For 32034/32034 co-relation queries the response was YES. [2023-08-29 20:33:43,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33931 conditions, 6935 events. 4357/6935 cut-off events. For 32034/32034 co-relation queries the response was YES. Maximal size of possible extension queue 446. Compared 45182 event pairs, 1052 based on Foata normal form. 89/6894 useless extension candidates. Maximal degree in co-relation 33896. Up to 3929 conditions per place. [2023-08-29 20:33:43,354 INFO L137 encePairwiseOnDemand]: 306/314 looper letters, 320 selfloop transitions, 43 changer transitions 0/364 dead transitions. [2023-08-29 20:33:43,355 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 364 transitions, 5333 flow [2023-08-29 20:33:43,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-29 20:33:43,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-29 20:33:43,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1081 transitions. [2023-08-29 20:33:43,357 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38251946213729654 [2023-08-29 20:33:43,357 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1081 transitions. [2023-08-29 20:33:43,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1081 transitions. [2023-08-29 20:33:43,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:33:43,357 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1081 transitions. [2023-08-29 20:33:43,360 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 120.11111111111111) internal successors, (1081), 9 states have internal predecessors, (1081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:43,363 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 314.0) internal successors, (3140), 10 states have internal predecessors, (3140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:43,364 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 314.0) internal successors, (3140), 10 states have internal predecessors, (3140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:43,364 INFO L175 Difference]: Start difference. First operand has 117 places, 177 transitions, 2413 flow. Second operand 9 states and 1081 transitions. [2023-08-29 20:33:43,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 364 transitions, 5333 flow [2023-08-29 20:33:43,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 364 transitions, 5275 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 20:33:43,508 INFO L231 Difference]: Finished difference. Result has 125 places, 218 transitions, 3143 flow [2023-08-29 20:33:43,509 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=2378, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3143, PETRI_PLACES=125, PETRI_TRANSITIONS=218} [2023-08-29 20:33:43,509 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, 47 predicate places. [2023-08-29 20:33:43,509 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 218 transitions, 3143 flow [2023-08-29 20:33:43,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 111.66666666666667) internal successors, (1005), 9 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:43,510 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:33:43,510 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:33:43,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-29 20:33:43,511 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-08-29 20:33:43,511 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:33:43,511 INFO L85 PathProgramCache]: Analyzing trace with hash 950452973, now seen corresponding path program 1 times [2023-08-29 20:33:43,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:33:43,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734238865] [2023-08-29 20:33:43,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:33:43,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:33:43,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:33:43,720 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:33:43,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:33:43,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734238865] [2023-08-29 20:33:43,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734238865] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:33:43,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:33:43,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:33:43,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876754265] [2023-08-29 20:33:43,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:33:43,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:33:43,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:33:43,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:33:43,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:33:43,727 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 314 [2023-08-29 20:33:43,728 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 218 transitions, 3143 flow. Second operand has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:43,728 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:33:43,728 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 314 [2023-08-29 20:33:43,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:33:44,332 INFO L130 PetriNetUnfolder]: 2119/3722 cut-off events. [2023-08-29 20:33:44,332 INFO L131 PetriNetUnfolder]: For 19767/19776 co-relation queries the response was YES. [2023-08-29 20:33:44,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19376 conditions, 3722 events. 2119/3722 cut-off events. For 19767/19776 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 24152 event pairs, 397 based on Foata normal form. 58/3705 useless extension candidates. Maximal degree in co-relation 19337. Up to 3407 conditions per place. [2023-08-29 20:33:44,356 INFO L137 encePairwiseOnDemand]: 309/314 looper letters, 228 selfloop transitions, 4 changer transitions 0/238 dead transitions. [2023-08-29 20:33:44,356 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 238 transitions, 3794 flow [2023-08-29 20:33:44,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:33:44,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:33:44,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 410 transitions. [2023-08-29 20:33:44,357 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43524416135881105 [2023-08-29 20:33:44,357 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 410 transitions. [2023-08-29 20:33:44,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 410 transitions. [2023-08-29 20:33:44,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:33:44,358 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 410 transitions. [2023-08-29 20:33:44,358 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:44,359 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 314.0) internal successors, (1256), 4 states have internal predecessors, (1256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:44,359 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 314.0) internal successors, (1256), 4 states have internal predecessors, (1256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:44,359 INFO L175 Difference]: Start difference. First operand has 125 places, 218 transitions, 3143 flow. Second operand 3 states and 410 transitions. [2023-08-29 20:33:44,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 238 transitions, 3794 flow [2023-08-29 20:33:44,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 238 transitions, 3710 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-08-29 20:33:44,426 INFO L231 Difference]: Finished difference. Result has 123 places, 195 transitions, 2744 flow [2023-08-29 20:33:44,426 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=2718, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2744, PETRI_PLACES=123, PETRI_TRANSITIONS=195} [2023-08-29 20:33:44,427 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, 45 predicate places. [2023-08-29 20:33:44,427 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 195 transitions, 2744 flow [2023-08-29 20:33:44,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:44,427 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:33:44,427 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:33:44,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-29 20:33:44,428 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-08-29 20:33:44,428 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:33:44,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1906043561, now seen corresponding path program 1 times [2023-08-29 20:33:44,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:33:44,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594739402] [2023-08-29 20:33:44,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:33:44,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:33:44,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:33:45,845 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:33:45,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:33:45,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594739402] [2023-08-29 20:33:45,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594739402] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:33:45,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:33:45,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:33:45,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558162546] [2023-08-29 20:33:45,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:33:45,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:33:45,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:33:45,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:33:45,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:33:45,914 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 314 [2023-08-29 20:33:45,915 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 195 transitions, 2744 flow. Second operand has 6 states, 6 states have (on average 119.5) internal successors, (717), 6 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:45,915 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:33:45,915 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 314 [2023-08-29 20:33:45,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:33:46,901 INFO L130 PetriNetUnfolder]: 3082/5542 cut-off events. [2023-08-29 20:33:46,901 INFO L131 PetriNetUnfolder]: For 27937/27951 co-relation queries the response was YES. [2023-08-29 20:33:46,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29257 conditions, 5542 events. 3082/5542 cut-off events. For 27937/27951 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 40379 event pairs, 819 based on Foata normal form. 38/5464 useless extension candidates. Maximal degree in co-relation 29217. Up to 3578 conditions per place. [2023-08-29 20:33:46,930 INFO L137 encePairwiseOnDemand]: 306/314 looper letters, 220 selfloop transitions, 51 changer transitions 0/277 dead transitions. [2023-08-29 20:33:46,930 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 277 transitions, 4178 flow [2023-08-29 20:33:46,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:33:46,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:33:46,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 658 transitions. [2023-08-29 20:33:46,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4191082802547771 [2023-08-29 20:33:46,932 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 658 transitions. [2023-08-29 20:33:46,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 658 transitions. [2023-08-29 20:33:46,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:33:46,933 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 658 transitions. [2023-08-29 20:33:46,933 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 131.6) internal successors, (658), 5 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:46,934 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 314.0) internal successors, (1884), 6 states have internal predecessors, (1884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:46,935 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 314.0) internal successors, (1884), 6 states have internal predecessors, (1884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:46,935 INFO L175 Difference]: Start difference. First operand has 123 places, 195 transitions, 2744 flow. Second operand 5 states and 658 transitions. [2023-08-29 20:33:46,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 277 transitions, 4178 flow [2023-08-29 20:33:47,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 277 transitions, 4168 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:33:47,041 INFO L231 Difference]: Finished difference. Result has 128 places, 218 transitions, 3208 flow [2023-08-29 20:33:47,041 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=2740, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3208, PETRI_PLACES=128, PETRI_TRANSITIONS=218} [2023-08-29 20:33:47,041 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, 50 predicate places. [2023-08-29 20:33:47,041 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 218 transitions, 3208 flow [2023-08-29 20:33:47,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.5) internal successors, (717), 6 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:47,042 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:33:47,042 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:33:47,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-29 20:33:47,042 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-08-29 20:33:47,042 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:33:47,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1807019973, now seen corresponding path program 2 times [2023-08-29 20:33:47,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:33:47,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975369205] [2023-08-29 20:33:47,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:33:47,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:33:47,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:33:48,537 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:33:48,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:33:48,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975369205] [2023-08-29 20:33:48,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975369205] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:33:48,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:33:48,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-29 20:33:48,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129831309] [2023-08-29 20:33:48,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:33:48,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-29 20:33:48,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:33:48,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-29 20:33:48,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-08-29 20:33:48,841 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 314 [2023-08-29 20:33:48,841 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 218 transitions, 3208 flow. Second operand has 10 states, 10 states have (on average 108.5) internal successors, (1085), 10 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:48,841 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:33:48,842 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 314 [2023-08-29 20:33:48,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:33:50,232 INFO L130 PetriNetUnfolder]: 3202/5718 cut-off events. [2023-08-29 20:33:50,232 INFO L131 PetriNetUnfolder]: For 35141/35155 co-relation queries the response was YES. [2023-08-29 20:33:50,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32008 conditions, 5718 events. 3202/5718 cut-off events. For 35141/35155 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 41693 event pairs, 565 based on Foata normal form. 24/5624 useless extension candidates. Maximal degree in co-relation 31966. Up to 4146 conditions per place. [2023-08-29 20:33:50,261 INFO L137 encePairwiseOnDemand]: 304/314 looper letters, 143 selfloop transitions, 165 changer transitions 0/314 dead transitions. [2023-08-29 20:33:50,261 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 314 transitions, 4839 flow [2023-08-29 20:33:50,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-29 20:33:50,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-29 20:33:50,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1378 transitions. [2023-08-29 20:33:50,264 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3657112526539278 [2023-08-29 20:33:50,264 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1378 transitions. [2023-08-29 20:33:50,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1378 transitions. [2023-08-29 20:33:50,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:33:50,265 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1378 transitions. [2023-08-29 20:33:50,267 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 114.83333333333333) internal successors, (1378), 12 states have internal predecessors, (1378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:50,270 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 314.0) internal successors, (4082), 13 states have internal predecessors, (4082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:50,271 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 314.0) internal successors, (4082), 13 states have internal predecessors, (4082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:50,271 INFO L175 Difference]: Start difference. First operand has 128 places, 218 transitions, 3208 flow. Second operand 12 states and 1378 transitions. [2023-08-29 20:33:50,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 314 transitions, 4839 flow [2023-08-29 20:33:50,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 314 transitions, 4834 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-29 20:33:50,415 INFO L231 Difference]: Finished difference. Result has 142 places, 260 transitions, 4410 flow [2023-08-29 20:33:50,416 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=3203, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=133, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4410, PETRI_PLACES=142, PETRI_TRANSITIONS=260} [2023-08-29 20:33:50,416 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, 64 predicate places. [2023-08-29 20:33:50,416 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 260 transitions, 4410 flow [2023-08-29 20:33:50,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 108.5) internal successors, (1085), 10 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:50,417 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:33:50,417 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:33:50,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-29 20:33:50,417 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-08-29 20:33:50,417 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:33:50,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1318889429, now seen corresponding path program 3 times [2023-08-29 20:33:50,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:33:50,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130977732] [2023-08-29 20:33:50,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:33:50,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:33:50,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:33:52,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:33:52,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:33:52,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130977732] [2023-08-29 20:33:52,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130977732] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:33:52,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:33:52,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-29 20:33:52,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96678376] [2023-08-29 20:33:52,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:33:52,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-29 20:33:52,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:33:52,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-29 20:33:52,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-08-29 20:33:52,498 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 314 [2023-08-29 20:33:52,499 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 260 transitions, 4410 flow. Second operand has 10 states, 10 states have (on average 110.5) internal successors, (1105), 10 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:52,499 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:33:52,499 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 314 [2023-08-29 20:33:52,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:33:53,856 INFO L130 PetriNetUnfolder]: 3199/5720 cut-off events. [2023-08-29 20:33:53,856 INFO L131 PetriNetUnfolder]: For 44435/44449 co-relation queries the response was YES. [2023-08-29 20:33:53,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34213 conditions, 5720 events. 3199/5720 cut-off events. For 44435/44449 co-relation queries the response was YES. Maximal size of possible extension queue 405. Compared 41974 event pairs, 576 based on Foata normal form. 30/5632 useless extension candidates. Maximal degree in co-relation 34167. Up to 4145 conditions per place. [2023-08-29 20:33:53,891 INFO L137 encePairwiseOnDemand]: 302/314 looper letters, 141 selfloop transitions, 159 changer transitions 4/310 dead transitions. [2023-08-29 20:33:53,891 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 310 transitions, 5405 flow [2023-08-29 20:33:53,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-29 20:33:53,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-29 20:33:53,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1511 transitions. [2023-08-29 20:33:53,893 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37016168544830963 [2023-08-29 20:33:53,893 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1511 transitions. [2023-08-29 20:33:53,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1511 transitions. [2023-08-29 20:33:53,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:33:53,893 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1511 transitions. [2023-08-29 20:33:53,894 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 116.23076923076923) internal successors, (1511), 13 states have internal predecessors, (1511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:53,897 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 314.0) internal successors, (4396), 14 states have internal predecessors, (4396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:53,898 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 314.0) internal successors, (4396), 14 states have internal predecessors, (4396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:53,898 INFO L175 Difference]: Start difference. First operand has 142 places, 260 transitions, 4410 flow. Second operand 13 states and 1511 transitions. [2023-08-29 20:33:53,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 310 transitions, 5405 flow [2023-08-29 20:33:54,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 310 transitions, 5224 flow, removed 73 selfloop flow, removed 3 redundant places. [2023-08-29 20:33:54,095 INFO L231 Difference]: Finished difference. Result has 154 places, 266 transitions, 4749 flow [2023-08-29 20:33:54,095 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=4241, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=149, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=4749, PETRI_PLACES=154, PETRI_TRANSITIONS=266} [2023-08-29 20:33:54,096 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, 76 predicate places. [2023-08-29 20:33:54,096 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 266 transitions, 4749 flow [2023-08-29 20:33:54,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 110.5) internal successors, (1105), 10 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:54,096 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:33:54,096 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:33:54,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-29 20:33:54,097 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-08-29 20:33:54,097 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:33:54,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1329602693, now seen corresponding path program 1 times [2023-08-29 20:33:54,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:33:54,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51735988] [2023-08-29 20:33:54,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:33:54,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:33:54,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:33:54,255 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:33:54,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:33:54,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51735988] [2023-08-29 20:33:54,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51735988] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:33:54,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:33:54,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:33:54,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124235776] [2023-08-29 20:33:54,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:33:54,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:33:54,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:33:54,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:33:54,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:33:54,266 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 314 [2023-08-29 20:33:54,267 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 266 transitions, 4749 flow. Second operand has 4 states, 4 states have (on average 125.75) internal successors, (503), 4 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:54,267 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:33:54,267 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 314 [2023-08-29 20:33:54,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:33:54,701 INFO L130 PetriNetUnfolder]: 987/2071 cut-off events. [2023-08-29 20:33:54,701 INFO L131 PetriNetUnfolder]: For 17953/17959 co-relation queries the response was YES. [2023-08-29 20:33:54,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12089 conditions, 2071 events. 987/2071 cut-off events. For 17953/17959 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 13900 event pairs, 100 based on Foata normal form. 122/2143 useless extension candidates. Maximal degree in co-relation 12040. Up to 1255 conditions per place. [2023-08-29 20:33:54,714 INFO L137 encePairwiseOnDemand]: 309/314 looper letters, 244 selfloop transitions, 7 changer transitions 0/257 dead transitions. [2023-08-29 20:33:54,714 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 257 transitions, 4646 flow [2023-08-29 20:33:54,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:33:54,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:33:54,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 543 transitions. [2023-08-29 20:33:54,716 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4323248407643312 [2023-08-29 20:33:54,716 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 543 transitions. [2023-08-29 20:33:54,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 543 transitions. [2023-08-29 20:33:54,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:33:54,716 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 543 transitions. [2023-08-29 20:33:54,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 135.75) internal successors, (543), 4 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:54,718 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 314.0) internal successors, (1570), 5 states have internal predecessors, (1570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:54,719 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 314.0) internal successors, (1570), 5 states have internal predecessors, (1570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:54,719 INFO L175 Difference]: Start difference. First operand has 154 places, 266 transitions, 4749 flow. Second operand 4 states and 543 transitions. [2023-08-29 20:33:54,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 257 transitions, 4646 flow [2023-08-29 20:33:54,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 257 transitions, 4198 flow, removed 62 selfloop flow, removed 17 redundant places. [2023-08-29 20:33:54,758 INFO L231 Difference]: Finished difference. Result has 132 places, 175 transitions, 2528 flow [2023-08-29 20:33:54,759 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=2488, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2528, PETRI_PLACES=132, PETRI_TRANSITIONS=175} [2023-08-29 20:33:54,759 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, 54 predicate places. [2023-08-29 20:33:54,759 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 175 transitions, 2528 flow [2023-08-29 20:33:54,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 125.75) internal successors, (503), 4 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:54,759 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:33:54,759 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:33:54,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-29 20:33:54,760 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-08-29 20:33:54,760 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:33:54,760 INFO L85 PathProgramCache]: Analyzing trace with hash 608524230, now seen corresponding path program 1 times [2023-08-29 20:33:54,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:33:54,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17088010] [2023-08-29 20:33:54,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:33:54,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:33:54,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:33:54,961 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:33:54,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:33:54,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17088010] [2023-08-29 20:33:54,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17088010] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:33:54,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:33:54,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:33:54,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786071330] [2023-08-29 20:33:54,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:33:54,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:33:54,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:33:54,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:33:54,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:33:54,970 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 314 [2023-08-29 20:33:54,971 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 175 transitions, 2528 flow. Second operand has 4 states, 4 states have (on average 126.5) internal successors, (506), 4 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:54,971 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:33:54,971 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 314 [2023-08-29 20:33:54,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:33:55,580 INFO L130 PetriNetUnfolder]: 1814/3697 cut-off events. [2023-08-29 20:33:55,580 INFO L131 PetriNetUnfolder]: For 28221/28221 co-relation queries the response was YES. [2023-08-29 20:33:55,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20547 conditions, 3697 events. 1814/3697 cut-off events. For 28221/28221 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 26590 event pairs, 255 based on Foata normal form. 36/3665 useless extension candidates. Maximal degree in co-relation 20509. Up to 1868 conditions per place. [2023-08-29 20:33:55,601 INFO L137 encePairwiseOnDemand]: 311/314 looper letters, 300 selfloop transitions, 2 changer transitions 8/315 dead transitions. [2023-08-29 20:33:55,601 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 315 transitions, 5117 flow [2023-08-29 20:33:55,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:33:55,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:33:55,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 554 transitions. [2023-08-29 20:33:55,602 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4410828025477707 [2023-08-29 20:33:55,603 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 554 transitions. [2023-08-29 20:33:55,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 554 transitions. [2023-08-29 20:33:55,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:33:55,603 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 554 transitions. [2023-08-29 20:33:55,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 138.5) internal successors, (554), 4 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:55,604 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 314.0) internal successors, (1570), 5 states have internal predecessors, (1570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:55,604 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 314.0) internal successors, (1570), 5 states have internal predecessors, (1570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:55,604 INFO L175 Difference]: Start difference. First operand has 132 places, 175 transitions, 2528 flow. Second operand 4 states and 554 transitions. [2023-08-29 20:33:55,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 315 transitions, 5117 flow [2023-08-29 20:33:55,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 315 transitions, 5022 flow, removed 11 selfloop flow, removed 3 redundant places. [2023-08-29 20:33:55,647 INFO L231 Difference]: Finished difference. Result has 134 places, 176 transitions, 2494 flow [2023-08-29 20:33:55,647 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=2481, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2494, PETRI_PLACES=134, PETRI_TRANSITIONS=176} [2023-08-29 20:33:55,648 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, 56 predicate places. [2023-08-29 20:33:55,648 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 176 transitions, 2494 flow [2023-08-29 20:33:55,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.5) internal successors, (506), 4 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:55,648 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:33:55,648 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:33:55,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-29 20:33:55,649 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-08-29 20:33:55,649 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:33:55,649 INFO L85 PathProgramCache]: Analyzing trace with hash 2025780722, now seen corresponding path program 2 times [2023-08-29 20:33:55,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:33:55,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700012317] [2023-08-29 20:33:55,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:33:55,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:33:55,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:33:55,882 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:33:55,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:33:55,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700012317] [2023-08-29 20:33:55,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700012317] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:33:55,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:33:55,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:33:55,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506818493] [2023-08-29 20:33:55,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:33:55,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:33:55,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:33:55,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:33:55,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:33:55,894 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 314 [2023-08-29 20:33:55,894 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 176 transitions, 2494 flow. Second operand has 5 states, 5 states have (on average 125.4) internal successors, (627), 5 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:55,894 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:33:55,894 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 314 [2023-08-29 20:33:55,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:33:56,154 INFO L130 PetriNetUnfolder]: 820/1673 cut-off events. [2023-08-29 20:33:56,155 INFO L131 PetriNetUnfolder]: For 13695/13701 co-relation queries the response was YES. [2023-08-29 20:33:56,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8942 conditions, 1673 events. 820/1673 cut-off events. For 13695/13701 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 11441 event pairs, 70 based on Foata normal form. 87/1728 useless extension candidates. Maximal degree in co-relation 8903. Up to 749 conditions per place. [2023-08-29 20:33:56,164 INFO L137 encePairwiseOnDemand]: 309/314 looper letters, 159 selfloop transitions, 10 changer transitions 4/177 dead transitions. [2023-08-29 20:33:56,164 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 177 transitions, 2778 flow [2023-08-29 20:33:56,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:33:56,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:33:56,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 660 transitions. [2023-08-29 20:33:56,165 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42038216560509556 [2023-08-29 20:33:56,165 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 660 transitions. [2023-08-29 20:33:56,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 660 transitions. [2023-08-29 20:33:56,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:33:56,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 660 transitions. [2023-08-29 20:33:56,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.0) internal successors, (660), 5 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:56,167 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 314.0) internal successors, (1884), 6 states have internal predecessors, (1884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:56,167 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 314.0) internal successors, (1884), 6 states have internal predecessors, (1884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:56,167 INFO L175 Difference]: Start difference. First operand has 134 places, 176 transitions, 2494 flow. Second operand 5 states and 660 transitions. [2023-08-29 20:33:56,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 177 transitions, 2778 flow [2023-08-29 20:33:56,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 177 transitions, 2523 flow, removed 22 selfloop flow, removed 16 redundant places. [2023-08-29 20:33:56,183 INFO L231 Difference]: Finished difference. Result has 107 places, 91 transitions, 1107 flow [2023-08-29 20:33:56,183 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=1099, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1107, PETRI_PLACES=107, PETRI_TRANSITIONS=91} [2023-08-29 20:33:56,183 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, 29 predicate places. [2023-08-29 20:33:56,183 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 91 transitions, 1107 flow [2023-08-29 20:33:56,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 125.4) internal successors, (627), 5 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:33:56,184 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:33:56,184 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:33:56,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-29 20:33:56,184 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-08-29 20:33:56,185 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:33:56,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1952802652, now seen corresponding path program 1 times [2023-08-29 20:33:56,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:33:56,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546476410] [2023-08-29 20:33:56,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:33:56,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:33:56,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:33:56,238 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:33:56,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:33:56,355 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 20:33:56,359 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:33:56,361 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (76 of 77 remaining) [2023-08-29 20:33:56,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 77 remaining) [2023-08-29 20:33:56,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 77 remaining) [2023-08-29 20:33:56,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 77 remaining) [2023-08-29 20:33:56,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 77 remaining) [2023-08-29 20:33:56,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 77 remaining) [2023-08-29 20:33:56,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 77 remaining) [2023-08-29 20:33:56,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 77 remaining) [2023-08-29 20:33:56,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 77 remaining) [2023-08-29 20:33:56,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 77 remaining) [2023-08-29 20:33:56,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 77 remaining) [2023-08-29 20:33:56,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 77 remaining) [2023-08-29 20:33:56,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 77 remaining) [2023-08-29 20:33:56,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 77 remaining) [2023-08-29 20:33:56,375 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 77 remaining) [2023-08-29 20:33:56,375 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 77 remaining) [2023-08-29 20:33:56,375 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 77 remaining) [2023-08-29 20:33:56,375 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 77 remaining) [2023-08-29 20:33:56,375 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 77 remaining) [2023-08-29 20:33:56,375 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 77 remaining) [2023-08-29 20:33:56,376 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 77 remaining) [2023-08-29 20:33:56,376 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 77 remaining) [2023-08-29 20:33:56,376 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 77 remaining) [2023-08-29 20:33:56,376 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 77 remaining) [2023-08-29 20:33:56,376 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 77 remaining) [2023-08-29 20:33:56,376 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 77 remaining) [2023-08-29 20:33:56,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 77 remaining) [2023-08-29 20:33:56,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 77 remaining) [2023-08-29 20:33:56,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 77 remaining) [2023-08-29 20:33:56,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 77 remaining) [2023-08-29 20:33:56,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 77 remaining) [2023-08-29 20:33:56,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 77 remaining) [2023-08-29 20:33:56,378 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 77 remaining) [2023-08-29 20:33:56,378 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 77 remaining) [2023-08-29 20:33:56,378 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 77 remaining) [2023-08-29 20:33:56,378 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 77 remaining) [2023-08-29 20:33:56,378 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 77 remaining) [2023-08-29 20:33:56,378 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 77 remaining) [2023-08-29 20:33:56,379 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 77 remaining) [2023-08-29 20:33:56,379 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 77 remaining) [2023-08-29 20:33:56,379 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 77 remaining) [2023-08-29 20:33:56,379 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 77 remaining) [2023-08-29 20:33:56,379 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 77 remaining) [2023-08-29 20:33:56,379 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (33 of 77 remaining) [2023-08-29 20:33:56,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (32 of 77 remaining) [2023-08-29 20:33:56,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 77 remaining) [2023-08-29 20:33:56,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 77 remaining) [2023-08-29 20:33:56,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 77 remaining) [2023-08-29 20:33:56,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 77 remaining) [2023-08-29 20:33:56,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 77 remaining) [2023-08-29 20:33:56,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 77 remaining) [2023-08-29 20:33:56,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 77 remaining) [2023-08-29 20:33:56,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 77 remaining) [2023-08-29 20:33:56,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 77 remaining) [2023-08-29 20:33:56,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 77 remaining) [2023-08-29 20:33:56,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 77 remaining) [2023-08-29 20:33:56,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 77 remaining) [2023-08-29 20:33:56,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 77 remaining) [2023-08-29 20:33:56,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 77 remaining) [2023-08-29 20:33:56,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 77 remaining) [2023-08-29 20:33:56,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 77 remaining) [2023-08-29 20:33:56,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 77 remaining) [2023-08-29 20:33:56,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 77 remaining) [2023-08-29 20:33:56,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 77 remaining) [2023-08-29 20:33:56,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 77 remaining) [2023-08-29 20:33:56,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 77 remaining) [2023-08-29 20:33:56,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 77 remaining) [2023-08-29 20:33:56,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 77 remaining) [2023-08-29 20:33:56,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 77 remaining) [2023-08-29 20:33:56,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 77 remaining) [2023-08-29 20:33:56,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 77 remaining) [2023-08-29 20:33:56,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 77 remaining) [2023-08-29 20:33:56,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 77 remaining) [2023-08-29 20:33:56,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 77 remaining) [2023-08-29 20:33:56,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 77 remaining) [2023-08-29 20:33:56,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 77 remaining) [2023-08-29 20:33:56,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 77 remaining) [2023-08-29 20:33:56,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-29 20:33:56,387 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:33:56,395 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:33:56,395 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:33:56,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:33:56 BasicIcfg [2023-08-29 20:33:56,461 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:33:56,462 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:33:56,462 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:33:56,462 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:33:56,462 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:33:10" (3/4) ... [2023-08-29 20:33:56,465 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:33:56,465 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:33:56,465 INFO L158 Benchmark]: Toolchain (without parser) took 47670.28ms. Allocated memory was 88.1MB in the beginning and 2.7GB in the end (delta: 2.6GB). Free memory was 64.4MB in the beginning and 2.5GB in the end (delta: -2.5GB). Peak memory consumption was 103.6MB. Max. memory is 16.1GB. [2023-08-29 20:33:56,465 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 65.0MB. Free memory is still 42.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:33:56,466 INFO L158 Benchmark]: CACSL2BoogieTranslator took 593.79ms. Allocated memory is still 88.1MB. Free memory was 64.1MB in the beginning and 59.8MB in the end (delta: 4.3MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. [2023-08-29 20:33:56,466 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.74ms. Allocated memory is still 88.1MB. Free memory was 59.8MB in the beginning and 57.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:33:56,466 INFO L158 Benchmark]: Boogie Preprocessor took 63.92ms. Allocated memory is still 88.1MB. Free memory was 57.3MB in the beginning and 55.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:33:56,466 INFO L158 Benchmark]: RCFGBuilder took 1172.29ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 55.2MB in the beginning and 79.2MB in the end (delta: -24.0MB). Peak memory consumption was 35.3MB. Max. memory is 16.1GB. [2023-08-29 20:33:56,467 INFO L158 Benchmark]: TraceAbstraction took 45770.99ms. Allocated memory was 107.0MB in the beginning and 2.7GB in the end (delta: 2.6GB). Free memory was 78.5MB in the beginning and 2.5GB in the end (delta: -2.5GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2023-08-29 20:33:56,467 INFO L158 Benchmark]: Witness Printer took 3.03ms. Allocated memory is still 2.7GB. Free memory was 2.5GB in the beginning and 2.5GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:33:56,468 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 65.0MB. Free memory is still 42.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 593.79ms. Allocated memory is still 88.1MB. Free memory was 64.1MB in the beginning and 59.8MB in the end (delta: 4.3MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.74ms. Allocated memory is still 88.1MB. Free memory was 59.8MB in the beginning and 57.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.92ms. Allocated memory is still 88.1MB. Free memory was 57.3MB in the beginning and 55.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1172.29ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 55.2MB in the beginning and 79.2MB in the end (delta: -24.0MB). Peak memory consumption was 35.3MB. Max. memory is 16.1GB. * TraceAbstraction took 45770.99ms. Allocated memory was 107.0MB in the beginning and 2.7GB in the end (delta: 2.6GB). Free memory was 78.5MB in the beginning and 2.5GB in the end (delta: -2.5GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. * Witness Printer took 3.03ms. Allocated memory is still 2.7GB. Free memory was 2.5GB in the beginning and 2.5GB in the end (delta: 1.1MB). 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: 7.0s, 176 PlacesBefore, 78 PlacesAfterwards, 168 TransitionsBefore, 68 TransitionsAfterwards, 6286 CoEnabledTransitionPairs, 7 FixpointIterations, 67 TrivialSequentialCompositions, 70 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 143 TotalNumberOfCompositions, 30012 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 10957, independent: 10398, independent conditional: 0, independent unconditional: 10398, dependent: 559, dependent conditional: 0, dependent unconditional: 559, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2606, independent: 2526, independent conditional: 0, independent unconditional: 2526, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 10957, independent: 7872, independent conditional: 0, independent unconditional: 7872, dependent: 479, dependent conditional: 0, dependent unconditional: 479, unknown: 2606, unknown conditional: 0, unknown unconditional: 2606] , Statistics on independence cache: Total cache size (in pairs): 401, Positive cache size: 361, Positive conditional cache size: 0, Positive unconditional cache size: 361, Negative cache size: 40, Negative conditional cache size: 0, Negative unconditional cache size: 40, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p1_EAX = 0; [L734] 0 int __unbuffered_p1_EBX = 0; [L735] 0 _Bool main$tmp_guard0; [L736] 0 _Bool main$tmp_guard1; [L738] 0 int x = 0; [L739] 0 _Bool x$flush_delayed; [L740] 0 int x$mem_tmp; [L741] 0 _Bool x$r_buff0_thd0; [L742] 0 _Bool x$r_buff0_thd1; [L743] 0 _Bool x$r_buff0_thd2; [L744] 0 _Bool x$r_buff0_thd3; [L745] 0 _Bool x$r_buff1_thd0; [L746] 0 _Bool x$r_buff1_thd1; [L747] 0 _Bool x$r_buff1_thd2; [L748] 0 _Bool x$r_buff1_thd3; [L749] 0 _Bool x$read_delayed; [L750] 0 int *x$read_delayed_var; [L751] 0 int x$w_buff0; [L752] 0 _Bool x$w_buff0_used; [L753] 0 int x$w_buff1; [L754] 0 _Bool x$w_buff1_used; [L756] 0 int y = 0; [L757] 0 _Bool weak$$choice0; [L758] 0 _Bool weak$$choice1; [L759] 0 _Bool weak$$choice2; [L849] 0 pthread_t t1749; [L850] FCALL, FORK 0 pthread_create(&t1749, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1749, ((void *)0), P0, ((void *)0))=-2, t1749={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L851] 0 pthread_t t1750; [L763] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 1 x$flush_delayed = weak$$choice2 [L766] EXPR 1 \read(x) [L766] 1 x$mem_tmp = x [L767] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L767] EXPR 1 \read(x) [L767] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L767] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L769] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L770] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L771] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L773] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L774] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L775] 1 __unbuffered_p0_EAX$read_delayed_var = &x [L776] EXPR 1 \read(x) [L776] 1 __unbuffered_p0_EAX = x [L777] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L777] EXPR 1 \read(x) [L777] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L777] 1 x = x$flush_delayed ? x$mem_tmp : x [L778] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L781] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L852] FCALL, FORK 0 pthread_create(&t1750, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1750, ((void *)0), P1, ((void *)0))=-1, t1749={7:0}, t1750={5:0}, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L793] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L853] 0 pthread_t t1751; [L796] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L799] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L800] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L801] 2 x$flush_delayed = weak$$choice2 [L802] EXPR 2 \read(x) [L802] 2 x$mem_tmp = x [L803] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L803] EXPR 2 \read(x) [L803] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L803] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L804] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L805] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L806] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L807] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L808] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L809] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L810] EXPR 2 \read(x) [L810] 2 __unbuffered_p1_EBX = x [L811] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L811] 2 x = x$flush_delayed ? x$mem_tmp : x [L812] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L854] FCALL, FORK 0 pthread_create(&t1751, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1751, ((void *)0), P2, ((void *)0))=0, t1749={7:0}, t1750={5:0}, t1751={6:0}, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L824] 3 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L827] EXPR 3 \read(x) [L827] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L786] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L788] 1 return 0; [L817] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L819] 2 return 0; [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L836] 3 return 0; [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L858] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L858] RET 0 assume_abort_if_not(main$tmp_guard0) [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 \read(x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, 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, t1749={7:0}, t1750={5:0}, t1751={6:0}, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L867] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L868] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L868] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L868] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L868] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L868] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L868] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L869] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L871] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] - 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: -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: -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: -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: -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: -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: 847]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 852]: 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: 850]: 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: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 225 locations, 77 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: 45.6s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 24.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3011 SdHoareTripleChecker+Valid, 5.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2364 mSDsluCounter, 1187 SdHoareTripleChecker+Invalid, 4.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1054 mSDsCounter, 566 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6770 IncrementalHoareTripleChecker+Invalid, 7336 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 566 mSolverCounterUnsat, 133 mSDtfsCounter, 6770 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 140 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4749occurred in iteration=20, InterpolantAutomatonStates: 139, 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.7s SatisfiabilityAnalysisTime, 12.2s InterpolantComputationTime, 315 NumberOfCodeBlocks, 315 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 271 ConstructedInterpolants, 0 QuantifiedInterpolants, 4510 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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:33:56,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi009_rmo.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6efd977ba774fd706e089a911dcd82549d76c764859cf8b84047b990ab28d067 --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:33:58,499 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:33:58,501 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:33:58,533 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:33:58,535 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:33:58,538 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:33:58,541 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:33:58,544 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:33:58,546 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:33:58,550 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:33:58,551 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:33:58,553 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:33:58,553 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:33:58,555 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:33:58,558 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:33:58,561 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:33:58,562 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:33:58,563 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:33:58,564 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:33:58,569 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:33:58,570 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:33:58,571 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:33:58,571 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:33:58,572 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:33:58,578 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:33:58,579 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:33:58,579 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:33:58,581 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:33:58,581 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:33:58,582 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:33:58,583 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:33:58,587 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:33:58,588 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:33:58,589 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:33:58,590 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:33:58,591 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:33:58,591 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:33:58,591 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:33:58,591 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:33:58,592 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:33:58,593 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:33:58,594 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:33:58,626 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:33:58,626 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:33:58,627 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:33:58,627 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:33:58,628 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:33:58,628 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:33:58,629 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:33:58,629 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:33:58,629 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:33:58,629 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:33:58,630 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:33:58,630 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:33:58,630 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:33:58,631 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:33:58,631 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:33:58,631 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:33:58,631 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:33:58,631 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:33:58,631 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:33:58,632 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:33:58,632 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-29 20:33:58,632 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-29 20:33:58,632 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:33:58,632 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:33:58,632 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:33:58,633 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:33:58,633 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:33:58,633 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:33:58,633 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:33:58,633 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:33:58,634 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-29 20:33:58,634 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-29 20:33:58,634 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:33:58,634 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:33:58,634 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:33:58,634 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-29 20:33:58,635 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:33:58,635 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 -> 6efd977ba774fd706e089a911dcd82549d76c764859cf8b84047b990ab28d067 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:33:58,936 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:33:58,966 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:33:58,968 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:33:58,969 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:33:58,970 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:33:58,971 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi009_rmo.oepc.i [2023-08-29 20:34:00,187 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:34:00,433 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:34:00,433 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi009_rmo.oepc.i [2023-08-29 20:34:00,446 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c6ddb4e2/014822d7b4c04b428740f317acdf8241/FLAG0e2307709 [2023-08-29 20:34:00,755 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c6ddb4e2/014822d7b4c04b428740f317acdf8241 [2023-08-29 20:34:00,757 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:34:00,758 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:34:00,759 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:34:00,759 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:34:00,762 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:34:00,763 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:34:00" (1/1) ... [2023-08-29 20:34:00,766 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@706cb2f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:34:00, skipping insertion in model container [2023-08-29 20:34:00,767 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:34:00" (1/1) ... [2023-08-29 20:34:00,773 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:34:00,820 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:34:00,944 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/rfi009_rmo.oepc.i[992,1005] [2023-08-29 20:34:01,160 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:34:01,176 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:34:01,189 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/rfi009_rmo.oepc.i[992,1005] [2023-08-29 20:34:01,232 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:34:01,274 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:34:01,274 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:34:01,279 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:34:01,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:34:01 WrapperNode [2023-08-29 20:34:01,279 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:34:01,280 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:34:01,281 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:34:01,281 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:34:01,286 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:34:01" (1/1) ... [2023-08-29 20:34:01,305 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:34:01" (1/1) ... [2023-08-29 20:34:01,325 INFO L138 Inliner]: procedures = 180, calls = 73, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 139 [2023-08-29 20:34:01,326 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:34:01,326 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:34:01,326 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:34:01,327 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:34:01,335 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:34:01" (1/1) ... [2023-08-29 20:34:01,335 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:34:01" (1/1) ... [2023-08-29 20:34:01,341 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:34:01" (1/1) ... [2023-08-29 20:34:01,345 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:34:01" (1/1) ... [2023-08-29 20:34:01,355 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:34:01" (1/1) ... [2023-08-29 20:34:01,370 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:34:01" (1/1) ... [2023-08-29 20:34:01,373 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:34:01" (1/1) ... [2023-08-29 20:34:01,386 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:34:01" (1/1) ... [2023-08-29 20:34:01,390 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:34:01,391 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:34:01,391 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:34:01,392 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:34:01,392 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:34:01" (1/1) ... [2023-08-29 20:34:01,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:34:01,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:34:01,425 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:34:01,449 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:34:01,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-08-29 20:34:01,470 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:34:01,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:34:01,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:34:01,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:34:01,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-29 20:34:01,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-29 20:34:01,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-08-29 20:34:01,471 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:34:01,471 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:34:01,471 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:34:01,471 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:34:01,471 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-29 20:34:01,471 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-29 20:34:01,471 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:34:01,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:34:01,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:34:01,473 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:34:01,637 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:34:01,638 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:34:02,236 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:34:02,721 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:34:02,721 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:34:02,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:34:02 BoogieIcfgContainer [2023-08-29 20:34:02,724 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:34:02,727 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:34:02,727 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:34:02,730 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:34:02,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:34:00" (1/3) ... [2023-08-29 20:34:02,731 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7685417e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:34:02, skipping insertion in model container [2023-08-29 20:34:02,731 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:34:01" (2/3) ... [2023-08-29 20:34:02,732 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7685417e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:34:02, skipping insertion in model container [2023-08-29 20:34:02,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:34:02" (3/3) ... [2023-08-29 20:34:02,734 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi009_rmo.oepc.i [2023-08-29 20:34:02,751 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:34:02,752 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2023-08-29 20:34:02,752 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:34:02,872 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:34:02,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 180 places, 172 transitions, 359 flow [2023-08-29 20:34:03,000 INFO L130 PetriNetUnfolder]: 2/169 cut-off events. [2023-08-29 20:34:03,000 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:34:03,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 169 events. 2/169 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 240 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 109. Up to 2 conditions per place. [2023-08-29 20:34:03,007 INFO L82 GeneralOperation]: Start removeDead. Operand has 180 places, 172 transitions, 359 flow [2023-08-29 20:34:03,016 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 177 places, 169 transitions, 347 flow [2023-08-29 20:34:03,019 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:34:03,041 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 169 transitions, 347 flow [2023-08-29 20:34:03,045 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 177 places, 169 transitions, 347 flow [2023-08-29 20:34:03,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 177 places, 169 transitions, 347 flow [2023-08-29 20:34:03,108 INFO L130 PetriNetUnfolder]: 2/169 cut-off events. [2023-08-29 20:34:03,108 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:34:03,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 169 events. 2/169 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 244 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 109. Up to 2 conditions per place. [2023-08-29 20:34:03,115 INFO L119 LiptonReduction]: Number of co-enabled transitions 6286 [2023-08-29 20:34:14,431 INFO L134 LiptonReduction]: Checked pairs total: 30266 [2023-08-29 20:34:14,432 INFO L136 LiptonReduction]: Total number of compositions: 146 [2023-08-29 20:34:14,443 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:34:14,448 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;@e38082d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:34:14,448 INFO L358 AbstractCegarLoop]: Starting to check reachability of 77 error locations. [2023-08-29 20:34:14,450 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-29 20:34:14,450 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:34:14,450 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:34:14,451 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:34:14,451 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-08-29 20:34:14,455 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:34:14,455 INFO L85 PathProgramCache]: Analyzing trace with hash 976, now seen corresponding path program 1 times [2023-08-29 20:34:14,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:34:14,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2041863733] [2023-08-29 20:34:14,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:34:14,467 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:34:14,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:34:14,469 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:34:14,472 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:34:14,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:34:14,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-29 20:34:14,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:34:14,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:34:14,571 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:34:14,571 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:34:14,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2041863733] [2023-08-29 20:34:14,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2041863733] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:34:14,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:34:14,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:34:14,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565359137] [2023-08-29 20:34:14,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:34:14,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:34:14,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:34:14,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:34:14,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:34:14,607 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 318 [2023-08-29 20:34:14,611 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 68 transitions, 145 flow. Second operand has 2 states, 2 states have (on average 127.5) internal successors, (255), 2 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:14,611 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:34:14,611 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 318 [2023-08-29 20:34:14,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:34:16,906 INFO L130 PetriNetUnfolder]: 11260/15878 cut-off events. [2023-08-29 20:34:16,907 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2023-08-29 20:34:16,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31821 conditions, 15878 events. 11260/15878 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 1262. Compared 99609 event pairs, 11260 based on Foata normal form. 0/7400 useless extension candidates. Maximal degree in co-relation 31810. Up to 15867 conditions per place. [2023-08-29 20:34:17,017 INFO L137 encePairwiseOnDemand]: 292/318 looper letters, 40 selfloop transitions, 0 changer transitions 0/42 dead transitions. [2023-08-29 20:34:17,017 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 42 transitions, 173 flow [2023-08-29 20:34:17,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:34:17,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:34:17,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 320 transitions. [2023-08-29 20:34:17,029 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5031446540880503 [2023-08-29 20:34:17,030 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 320 transitions. [2023-08-29 20:34:17,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 320 transitions. [2023-08-29 20:34:17,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:34:17,033 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 320 transitions. [2023-08-29 20:34:17,036 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 160.0) internal successors, (320), 2 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:17,041 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:17,042 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:17,044 INFO L175 Difference]: Start difference. First operand has 78 places, 68 transitions, 145 flow. Second operand 2 states and 320 transitions. [2023-08-29 20:34:17,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 42 transitions, 173 flow [2023-08-29 20:34:17,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 42 transitions, 170 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 20:34:17,050 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 90 flow [2023-08-29 20:34:17,052 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=90, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2023-08-29 20:34:17,054 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -28 predicate places. [2023-08-29 20:34:17,055 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 90 flow [2023-08-29 20:34:17,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 127.5) internal successors, (255), 2 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:17,055 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:34:17,055 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 20:34:17,064 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:34:17,264 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:34:17,270 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-08-29 20:34:17,271 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:34:17,279 INFO L85 PathProgramCache]: Analyzing trace with hash 964457, now seen corresponding path program 1 times [2023-08-29 20:34:17,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:34:17,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1417168702] [2023-08-29 20:34:17,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:34:17,280 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:34:17,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:34:17,285 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:34:17,289 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:34:17,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:34:17,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-29 20:34:17,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:34:17,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 20:34:17,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-29 20:34:17,504 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:34:17,504 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:34:17,504 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:34:17,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1417168702] [2023-08-29 20:34:17,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1417168702] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:34:17,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:34:17,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:34:17,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962057250] [2023-08-29 20:34:17,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:34:17,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:34:17,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:34:17,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:34:17,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:34:17,566 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 318 [2023-08-29 20:34:17,567 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:17,567 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:34:17,567 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 318 [2023-08-29 20:34:17,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:34:18,476 INFO L130 PetriNetUnfolder]: 4344/6247 cut-off events. [2023-08-29 20:34:18,476 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:34:18,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12537 conditions, 6247 events. 4344/6247 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 452. Compared 34883 event pairs, 4344 based on Foata normal form. 0/3773 useless extension candidates. Maximal degree in co-relation 12534. Up to 6237 conditions per place. [2023-08-29 20:34:18,514 INFO L137 encePairwiseOnDemand]: 310/318 looper letters, 32 selfloop transitions, 1 changer transitions 0/35 dead transitions. [2023-08-29 20:34:18,514 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 35 transitions, 142 flow [2023-08-29 20:34:18,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:34:18,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:34:18,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 418 transitions. [2023-08-29 20:34:18,520 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4381551362683438 [2023-08-29 20:34:18,520 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 418 transitions. [2023-08-29 20:34:18,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 418 transitions. [2023-08-29 20:34:18,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:34:18,520 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 418 transitions. [2023-08-29 20:34:18,523 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:34:18,526 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 318.0) internal successors, (1272), 4 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:18,527 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 318.0) internal successors, (1272), 4 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:18,527 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 90 flow. Second operand 3 states and 418 transitions. [2023-08-29 20:34:18,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 35 transitions, 142 flow [2023-08-29 20:34:18,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 35 transitions, 142 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:34:18,529 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 78 flow [2023-08-29 20:34:18,529 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2023-08-29 20:34:18,530 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -33 predicate places. [2023-08-29 20:34:18,530 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 78 flow [2023-08-29 20:34:18,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:18,531 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:34:18,531 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 20:34:18,543 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 (3)] Ended with exit code 0 [2023-08-29 20:34:18,740 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:34:18,741 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-08-29 20:34:18,743 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:34:18,744 INFO L85 PathProgramCache]: Analyzing trace with hash 964456, now seen corresponding path program 1 times [2023-08-29 20:34:18,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:34:18,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1981132658] [2023-08-29 20:34:18,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:34:18,746 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:34:18,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:34:18,747 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:34:18,782 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:34:18,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:34:18,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:34:18,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:34:18,868 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-29 20:34:18,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-08-29 20:34:18,914 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:34:18,914 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:34:18,914 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:34:18,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1981132658] [2023-08-29 20:34:18,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1981132658] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:34:18,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:34:18,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:34:18,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179277635] [2023-08-29 20:34:18,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:34:18,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:34:18,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:34:18,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:34:18,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:34:18,979 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 318 [2023-08-29 20:34:18,980 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:18,980 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:34:18,980 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 318 [2023-08-29 20:34:18,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:34:19,527 INFO L130 PetriNetUnfolder]: 1994/2944 cut-off events. [2023-08-29 20:34:19,527 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:34:19,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5917 conditions, 2944 events. 1994/2944 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 14854 event pairs, 1138 based on Foata normal form. 0/2164 useless extension candidates. Maximal degree in co-relation 5913. Up to 1817 conditions per place. [2023-08-29 20:34:19,541 INFO L137 encePairwiseOnDemand]: 309/318 looper letters, 37 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2023-08-29 20:34:19,541 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 41 transitions, 168 flow [2023-08-29 20:34:19,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:34:19,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:34:19,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 415 transitions. [2023-08-29 20:34:19,543 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4350104821802935 [2023-08-29 20:34:19,543 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 415 transitions. [2023-08-29 20:34:19,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 415 transitions. [2023-08-29 20:34:19,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:34:19,544 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 415 transitions. [2023-08-29 20:34:19,545 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:34:19,547 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 318.0) internal successors, (1272), 4 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:19,547 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 318.0) internal successors, (1272), 4 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:19,547 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 78 flow. Second operand 3 states and 415 transitions. [2023-08-29 20:34:19,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 41 transitions, 168 flow [2023-08-29 20:34:19,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 41 transitions, 167 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:34:19,549 INFO L231 Difference]: Finished difference. Result has 45 places, 33 transitions, 89 flow [2023-08-29 20:34:19,549 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=89, PETRI_PLACES=45, PETRI_TRANSITIONS=33} [2023-08-29 20:34:19,550 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -33 predicate places. [2023-08-29 20:34:19,550 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 33 transitions, 89 flow [2023-08-29 20:34:19,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:19,554 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:34:19,554 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:34:19,567 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:34:19,763 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:34:19,763 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-08-29 20:34:19,764 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:34:19,764 INFO L85 PathProgramCache]: Analyzing trace with hash -860426358, now seen corresponding path program 1 times [2023-08-29 20:34:19,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:34:19,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1054698331] [2023-08-29 20:34:19,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:34:19,765 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:34:19,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:34:19,766 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:34:19,768 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:34:19,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:34:19,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:34:19,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:34:19,896 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:34:19,897 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:34:19,897 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:34:19,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1054698331] [2023-08-29 20:34:19,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1054698331] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:34:19,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:34:19,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:34:19,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552036763] [2023-08-29 20:34:19,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:34:19,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:34:19,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:34:19,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:34:19,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:34:19,908 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 318 [2023-08-29 20:34:19,909 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 89 flow. Second operand has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:19,909 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:34:19,910 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 318 [2023-08-29 20:34:19,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:34:20,198 INFO L130 PetriNetUnfolder]: 860/1412 cut-off events. [2023-08-29 20:34:20,199 INFO L131 PetriNetUnfolder]: For 99/99 co-relation queries the response was YES. [2023-08-29 20:34:20,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3097 conditions, 1412 events. 860/1412 cut-off events. For 99/99 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 7060 event pairs, 303 based on Foata normal form. 18/1237 useless extension candidates. Maximal degree in co-relation 3092. Up to 1324 conditions per place. [2023-08-29 20:34:20,206 INFO L137 encePairwiseOnDemand]: 313/318 looper letters, 41 selfloop transitions, 4 changer transitions 0/47 dead transitions. [2023-08-29 20:34:20,206 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 47 transitions, 211 flow [2023-08-29 20:34:20,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:34:20,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:34:20,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 415 transitions. [2023-08-29 20:34:20,208 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4350104821802935 [2023-08-29 20:34:20,208 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 415 transitions. [2023-08-29 20:34:20,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 415 transitions. [2023-08-29 20:34:20,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:34:20,209 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 415 transitions. [2023-08-29 20:34:20,210 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:34:20,212 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 318.0) internal successors, (1272), 4 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:20,212 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 318.0) internal successors, (1272), 4 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:20,212 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 89 flow. Second operand 3 states and 415 transitions. [2023-08-29 20:34:20,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 47 transitions, 211 flow [2023-08-29 20:34:20,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 47 transitions, 207 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:34:20,215 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 111 flow [2023-08-29 20:34:20,215 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=111, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2023-08-29 20:34:20,215 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -32 predicate places. [2023-08-29 20:34:20,216 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 111 flow [2023-08-29 20:34:20,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:20,216 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:34:20,216 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:34:20,225 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:34:20,425 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:34:20,426 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-08-29 20:34:20,426 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:34:20,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1783455059, now seen corresponding path program 1 times [2023-08-29 20:34:20,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:34:20,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1516740958] [2023-08-29 20:34:20,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:34:20,427 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:34:20,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:34:20,427 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:34:20,428 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:34:20,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:34:20,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:34:20,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:34:20,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:34:20,572 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:34:20,572 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:34:20,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1516740958] [2023-08-29 20:34:20,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1516740958] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:34:20,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:34:20,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:34:20,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487696296] [2023-08-29 20:34:20,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:34:20,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:34:20,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:34:20,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:34:20,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:34:20,582 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 318 [2023-08-29 20:34:20,583 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 111 flow. Second operand has 4 states, 4 states have (on average 126.25) internal successors, (505), 4 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:20,583 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:34:20,583 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 318 [2023-08-29 20:34:20,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:34:20,804 INFO L130 PetriNetUnfolder]: 209/419 cut-off events. [2023-08-29 20:34:20,804 INFO L131 PetriNetUnfolder]: For 68/68 co-relation queries the response was YES. [2023-08-29 20:34:20,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1043 conditions, 419 events. 209/419 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1673 event pairs, 65 based on Foata normal form. 21/392 useless extension candidates. Maximal degree in co-relation 1037. Up to 239 conditions per place. [2023-08-29 20:34:20,806 INFO L137 encePairwiseOnDemand]: 313/318 looper letters, 49 selfloop transitions, 7 changer transitions 0/58 dead transitions. [2023-08-29 20:34:20,806 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 58 transitions, 279 flow [2023-08-29 20:34:20,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:34:20,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:34:20,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 549 transitions. [2023-08-29 20:34:20,809 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43160377358490565 [2023-08-29 20:34:20,809 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 549 transitions. [2023-08-29 20:34:20,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 549 transitions. [2023-08-29 20:34:20,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:34:20,810 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 549 transitions. [2023-08-29 20:34:20,811 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:34:20,814 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 318.0) internal successors, (1590), 5 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:20,815 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 318.0) internal successors, (1590), 5 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:20,815 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 111 flow. Second operand 4 states and 549 transitions. [2023-08-29 20:34:20,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 58 transitions, 279 flow [2023-08-29 20:34:20,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 58 transitions, 275 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:34:20,817 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 147 flow [2023-08-29 20:34:20,817 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=147, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2023-08-29 20:34:20,818 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -29 predicate places. [2023-08-29 20:34:20,818 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 147 flow [2023-08-29 20:34:20,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.25) internal successors, (505), 4 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:20,819 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:34:20,819 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:34:20,828 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:34:21,028 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:34:21,029 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-08-29 20:34:21,029 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:34:21,029 INFO L85 PathProgramCache]: Analyzing trace with hash -131224782, now seen corresponding path program 1 times [2023-08-29 20:34:21,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:34:21,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [671597160] [2023-08-29 20:34:21,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:34:21,030 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:34:21,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:34:21,032 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:34:21,035 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:34:21,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:34:21,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-29 20:34:21,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:34:21,201 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:34:21,201 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:34:21,202 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:34:21,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [671597160] [2023-08-29 20:34:21,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [671597160] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:34:21,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:34:21,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:34:21,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269552203] [2023-08-29 20:34:21,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:34:21,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:34:21,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:34:21,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:34:21,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:34:21,214 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 318 [2023-08-29 20:34:21,215 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 147 flow. Second operand has 5 states, 5 states have (on average 126.2) internal successors, (631), 5 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:21,215 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:34:21,215 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 318 [2023-08-29 20:34:21,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:34:21,511 INFO L130 PetriNetUnfolder]: 114/224 cut-off events. [2023-08-29 20:34:21,511 INFO L131 PetriNetUnfolder]: For 204/204 co-relation queries the response was YES. [2023-08-29 20:34:21,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 637 conditions, 224 events. 114/224 cut-off events. For 204/204 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 743 event pairs, 40 based on Foata normal form. 8/225 useless extension candidates. Maximal degree in co-relation 630. Up to 92 conditions per place. [2023-08-29 20:34:21,513 INFO L137 encePairwiseOnDemand]: 313/318 looper letters, 40 selfloop transitions, 10 changer transitions 1/53 dead transitions. [2023-08-29 20:34:21,513 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 53 transitions, 273 flow [2023-08-29 20:34:21,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:34:21,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:34:21,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 667 transitions. [2023-08-29 20:34:21,516 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41949685534591197 [2023-08-29 20:34:21,516 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 667 transitions. [2023-08-29 20:34:21,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 667 transitions. [2023-08-29 20:34:21,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:34:21,516 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 667 transitions. [2023-08-29 20:34:21,518 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.4) internal successors, (667), 5 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:21,521 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 318.0) internal successors, (1908), 6 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:21,521 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 318.0) internal successors, (1908), 6 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:21,522 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 147 flow. Second operand 5 states and 667 transitions. [2023-08-29 20:34:21,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 53 transitions, 273 flow [2023-08-29 20:34:21,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 53 transitions, 257 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-29 20:34:21,524 INFO L231 Difference]: Finished difference. Result has 46 places, 33 transitions, 137 flow [2023-08-29 20:34:21,524 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=137, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2023-08-29 20:34:21,525 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -32 predicate places. [2023-08-29 20:34:21,525 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 137 flow [2023-08-29 20:34:21,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.2) internal successors, (631), 5 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:21,526 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:34:21,526 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:34:21,538 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:34:21,735 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:34:21,736 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-08-29 20:34:21,736 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:34:21,736 INFO L85 PathProgramCache]: Analyzing trace with hash -387785208, now seen corresponding path program 1 times [2023-08-29 20:34:21,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:34:21,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1535474156] [2023-08-29 20:34:21,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:34:21,737 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:34:21,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:34:21,738 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:34:21,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 (8)] Waiting until timeout for monitored process [2023-08-29 20:34:21,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:34:21,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-29 20:34:21,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:34:22,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-08-29 20:34:22,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-08-29 20:34:22,601 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:34:22,602 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:34:22,602 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:34:22,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1535474156] [2023-08-29 20:34:22,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1535474156] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:34:22,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:34:22,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:34:22,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688480460] [2023-08-29 20:34:22,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:34:22,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:34:22,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:34:22,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:34:22,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:34:22,691 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 318 [2023-08-29 20:34:22,692 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 137 flow. Second operand has 5 states, 5 states have (on average 123.8) internal successors, (619), 5 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:22,692 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:34:22,692 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 318 [2023-08-29 20:34:22,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:34:22,855 INFO L130 PetriNetUnfolder]: 114/235 cut-off events. [2023-08-29 20:34:22,855 INFO L131 PetriNetUnfolder]: For 262/262 co-relation queries the response was YES. [2023-08-29 20:34:22,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 669 conditions, 235 events. 114/235 cut-off events. For 262/262 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 864 event pairs, 24 based on Foata normal form. 0/232 useless extension candidates. Maximal degree in co-relation 662. Up to 163 conditions per place. [2023-08-29 20:34:22,856 INFO L137 encePairwiseOnDemand]: 314/318 looper letters, 41 selfloop transitions, 3 changer transitions 0/46 dead transitions. [2023-08-29 20:34:22,856 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 46 transitions, 277 flow [2023-08-29 20:34:22,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:34:22,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:34:22,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 637 transitions. [2023-08-29 20:34:22,859 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4006289308176101 [2023-08-29 20:34:22,859 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 637 transitions. [2023-08-29 20:34:22,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 637 transitions. [2023-08-29 20:34:22,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:34:22,859 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 637 transitions. [2023-08-29 20:34:22,861 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.4) internal successors, (637), 5 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:22,863 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 318.0) internal successors, (1908), 6 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:22,863 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 318.0) internal successors, (1908), 6 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:22,863 INFO L175 Difference]: Start difference. First operand has 46 places, 33 transitions, 137 flow. Second operand 5 states and 637 transitions. [2023-08-29 20:34:22,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 46 transitions, 277 flow [2023-08-29 20:34:22,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 46 transitions, 245 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-08-29 20:34:22,866 INFO L231 Difference]: Finished difference. Result has 45 places, 32 transitions, 115 flow [2023-08-29 20:34:22,866 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=115, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2023-08-29 20:34:22,867 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -33 predicate places. [2023-08-29 20:34:22,867 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 32 transitions, 115 flow [2023-08-29 20:34:22,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 123.8) internal successors, (619), 5 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:22,867 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:34:22,867 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:34:22,880 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:34:23,068 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:34:23,068 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-08-29 20:34:23,068 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:34:23,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1561628593, now seen corresponding path program 1 times [2023-08-29 20:34:23,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:34:23,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1424444674] [2023-08-29 20:34:23,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:34:23,069 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:34:23,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:34:23,073 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:34:23,076 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:34:23,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:34:23,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:34:23,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:34:23,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-08-29 20:34:23,551 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:34:23,551 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:34:23,552 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:34:23,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1424444674] [2023-08-29 20:34:23,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1424444674] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:34:23,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:34:23,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:34:23,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141840399] [2023-08-29 20:34:23,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:34:23,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:34:23,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:34:23,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:34:23,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:34:23,648 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 318 [2023-08-29 20:34:23,648 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 32 transitions, 115 flow. Second operand has 5 states, 5 states have (on average 127.8) internal successors, (639), 5 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:23,649 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:34:23,649 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 318 [2023-08-29 20:34:23,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:34:23,819 INFO L130 PetriNetUnfolder]: 114/247 cut-off events. [2023-08-29 20:34:23,820 INFO L131 PetriNetUnfolder]: For 184/184 co-relation queries the response was YES. [2023-08-29 20:34:23,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 664 conditions, 247 events. 114/247 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 985 event pairs, 17 based on Foata normal form. 0/245 useless extension candidates. Maximal degree in co-relation 657. Up to 165 conditions per place. [2023-08-29 20:34:23,821 INFO L137 encePairwiseOnDemand]: 315/318 looper letters, 41 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2023-08-29 20:34:23,822 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 45 transitions, 247 flow [2023-08-29 20:34:23,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:34:23,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:34:23,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 532 transitions. [2023-08-29 20:34:23,824 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41823899371069184 [2023-08-29 20:34:23,824 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 532 transitions. [2023-08-29 20:34:23,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 532 transitions. [2023-08-29 20:34:23,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:34:23,825 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 532 transitions. [2023-08-29 20:34:23,826 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:23,827 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 318.0) internal successors, (1590), 5 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:23,828 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 318.0) internal successors, (1590), 5 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:23,828 INFO L175 Difference]: Start difference. First operand has 45 places, 32 transitions, 115 flow. Second operand 4 states and 532 transitions. [2023-08-29 20:34:23,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 45 transitions, 247 flow [2023-08-29 20:34:23,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 45 transitions, 242 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 20:34:23,830 INFO L231 Difference]: Finished difference. Result has 44 places, 31 transitions, 112 flow [2023-08-29 20:34:23,830 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=112, PETRI_PLACES=44, PETRI_TRANSITIONS=31} [2023-08-29 20:34:23,831 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -34 predicate places. [2023-08-29 20:34:23,831 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 112 flow [2023-08-29 20:34:23,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 127.8) internal successors, (639), 5 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:23,832 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:34:23,832 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:34:23,848 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:34:24,047 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:34:24,048 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-08-29 20:34:24,048 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:34:24,048 INFO L85 PathProgramCache]: Analyzing trace with hash -585793652, now seen corresponding path program 1 times [2023-08-29 20:34:24,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:34:24,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [125539507] [2023-08-29 20:34:24,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:34:24,049 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:34:24,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:34:24,053 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:34:24,054 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:34:24,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:34:24,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:34:24,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:34:24,229 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:34:24,229 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:34:24,229 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:34:24,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [125539507] [2023-08-29 20:34:24,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [125539507] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:34:24,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:34:24,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:34:24,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898761970] [2023-08-29 20:34:24,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:34:24,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:34:24,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:34:24,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:34:24,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:34:24,236 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 318 [2023-08-29 20:34:24,236 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 31 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:24,236 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:34:24,236 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 318 [2023-08-29 20:34:24,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:34:24,441 INFO L130 PetriNetUnfolder]: 205/413 cut-off events. [2023-08-29 20:34:24,441 INFO L131 PetriNetUnfolder]: For 222/222 co-relation queries the response was YES. [2023-08-29 20:34:24,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1127 conditions, 413 events. 205/413 cut-off events. For 222/222 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1752 event pairs, 26 based on Foata normal form. 0/412 useless extension candidates. Maximal degree in co-relation 1120. Up to 205 conditions per place. [2023-08-29 20:34:24,446 INFO L137 encePairwiseOnDemand]: 315/318 looper letters, 60 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2023-08-29 20:34:24,446 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 63 transitions, 359 flow [2023-08-29 20:34:24,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:34:24,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:34:24,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 541 transitions. [2023-08-29 20:34:24,448 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.425314465408805 [2023-08-29 20:34:24,448 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 541 transitions. [2023-08-29 20:34:24,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 541 transitions. [2023-08-29 20:34:24,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:34:24,449 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 541 transitions. [2023-08-29 20:34:24,450 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 135.25) internal successors, (541), 4 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:24,452 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 318.0) internal successors, (1590), 5 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:24,452 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 318.0) internal successors, (1590), 5 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:24,452 INFO L175 Difference]: Start difference. First operand has 44 places, 31 transitions, 112 flow. Second operand 4 states and 541 transitions. [2023-08-29 20:34:24,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 63 transitions, 359 flow [2023-08-29 20:34:24,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 63 transitions, 355 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:34:24,455 INFO L231 Difference]: Finished difference. Result has 47 places, 32 transitions, 122 flow [2023-08-29 20:34:24,455 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=47, PETRI_TRANSITIONS=32} [2023-08-29 20:34:24,456 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -31 predicate places. [2023-08-29 20:34:24,456 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 32 transitions, 122 flow [2023-08-29 20:34:24,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:24,457 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:34:24,457 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:34:24,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-08-29 20:34:24,667 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:34:24,667 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-08-29 20:34:24,668 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:34:24,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1782544878, now seen corresponding path program 2 times [2023-08-29 20:34:24,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:34:24,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [442902597] [2023-08-29 20:34:24,668 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 20:34:24,668 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:34:24,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:34:24,669 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:34:24,673 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:34:24,802 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-29 20:34:24,802 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:34:24,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-29 20:34:24,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:34:24,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-29 20:34:24,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-08-29 20:34:25,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 99 [2023-08-29 20:34:25,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-08-29 20:34:25,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-08-29 20:34:25,329 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:34:25,329 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:34:25,329 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:34:25,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [442902597] [2023-08-29 20:34:25,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [442902597] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:34:25,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:34:25,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:34:25,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189718616] [2023-08-29 20:34:25,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:34:25,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:34:25,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:34:25,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:34:25,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:34:25,626 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 318 [2023-08-29 20:34:25,626 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 32 transitions, 122 flow. Second operand has 6 states, 6 states have (on average 118.16666666666667) internal successors, (709), 6 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:25,627 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:34:25,627 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 318 [2023-08-29 20:34:25,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:34:25,964 INFO L130 PetriNetUnfolder]: 238/519 cut-off events. [2023-08-29 20:34:25,964 INFO L131 PetriNetUnfolder]: For 521/521 co-relation queries the response was YES. [2023-08-29 20:34:25,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1584 conditions, 519 events. 238/519 cut-off events. For 521/521 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2587 event pairs, 98 based on Foata normal form. 1/507 useless extension candidates. Maximal degree in co-relation 1575. Up to 280 conditions per place. [2023-08-29 20:34:25,968 INFO L137 encePairwiseOnDemand]: 312/318 looper letters, 66 selfloop transitions, 7 changer transitions 0/76 dead transitions. [2023-08-29 20:34:25,968 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 76 transitions, 470 flow [2023-08-29 20:34:25,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:34:25,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:34:25,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 740 transitions. [2023-08-29 20:34:25,972 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38784067085953877 [2023-08-29 20:34:25,972 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 740 transitions. [2023-08-29 20:34:25,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 740 transitions. [2023-08-29 20:34:25,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:34:25,973 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 740 transitions. [2023-08-29 20:34:25,975 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 123.33333333333333) internal successors, (740), 6 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:25,977 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 318.0) internal successors, (2226), 7 states have internal predecessors, (2226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:25,978 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 318.0) internal successors, (2226), 7 states have internal predecessors, (2226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:25,978 INFO L175 Difference]: Start difference. First operand has 47 places, 32 transitions, 122 flow. Second operand 6 states and 740 transitions. [2023-08-29 20:34:25,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 76 transitions, 470 flow [2023-08-29 20:34:25,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 76 transitions, 468 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:34:25,983 INFO L231 Difference]: Finished difference. Result has 54 places, 37 transitions, 166 flow [2023-08-29 20:34:25,983 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=166, PETRI_PLACES=54, PETRI_TRANSITIONS=37} [2023-08-29 20:34:25,985 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -24 predicate places. [2023-08-29 20:34:25,985 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 37 transitions, 166 flow [2023-08-29 20:34:25,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 118.16666666666667) internal successors, (709), 6 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:34:25,985 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:34:25,986 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:34:25,996 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:34:26,196 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:34:26,196 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-08-29 20:34:26,196 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:34:26,197 INFO L85 PathProgramCache]: Analyzing trace with hash 126121350, now seen corresponding path program 3 times [2023-08-29 20:34:26,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:34:26,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [751151870] [2023-08-29 20:34:26,197 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-29 20:34:26,197 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:34:26,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:34:26,199 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:34:26,202 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:34:26,376 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-29 20:34:26,376 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-29 20:34:26,376 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:34:26,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:34:26,546 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-29 20:34:26,546 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:34:26,547 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (76 of 77 remaining) [2023-08-29 20:34:26,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 77 remaining) [2023-08-29 20:34:26,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 77 remaining) [2023-08-29 20:34:26,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 77 remaining) [2023-08-29 20:34:26,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 77 remaining) [2023-08-29 20:34:26,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 77 remaining) [2023-08-29 20:34:26,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 77 remaining) [2023-08-29 20:34:26,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 77 remaining) [2023-08-29 20:34:26,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 77 remaining) [2023-08-29 20:34:26,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 77 remaining) [2023-08-29 20:34:26,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 77 remaining) [2023-08-29 20:34:26,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 77 remaining) [2023-08-29 20:34:26,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 77 remaining) [2023-08-29 20:34:26,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 77 remaining) [2023-08-29 20:34:26,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 77 remaining) [2023-08-29 20:34:26,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 77 remaining) [2023-08-29 20:34:26,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 77 remaining) [2023-08-29 20:34:26,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 77 remaining) [2023-08-29 20:34:26,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 77 remaining) [2023-08-29 20:34:26,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 77 remaining) [2023-08-29 20:34:26,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 77 remaining) [2023-08-29 20:34:26,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 77 remaining) [2023-08-29 20:34:26,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 77 remaining) [2023-08-29 20:34:26,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 77 remaining) [2023-08-29 20:34:26,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 77 remaining) [2023-08-29 20:34:26,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 77 remaining) [2023-08-29 20:34:26,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 77 remaining) [2023-08-29 20:34:26,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 77 remaining) [2023-08-29 20:34:26,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 77 remaining) [2023-08-29 20:34:26,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 77 remaining) [2023-08-29 20:34:26,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 77 remaining) [2023-08-29 20:34:26,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 77 remaining) [2023-08-29 20:34:26,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 77 remaining) [2023-08-29 20:34:26,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 77 remaining) [2023-08-29 20:34:26,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 77 remaining) [2023-08-29 20:34:26,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 77 remaining) [2023-08-29 20:34:26,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 77 remaining) [2023-08-29 20:34:26,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 77 remaining) [2023-08-29 20:34:26,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 77 remaining) [2023-08-29 20:34:26,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 77 remaining) [2023-08-29 20:34:26,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 77 remaining) [2023-08-29 20:34:26,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 77 remaining) [2023-08-29 20:34:26,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 77 remaining) [2023-08-29 20:34:26,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (33 of 77 remaining) [2023-08-29 20:34:26,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (32 of 77 remaining) [2023-08-29 20:34:26,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 77 remaining) [2023-08-29 20:34:26,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 77 remaining) [2023-08-29 20:34:26,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 77 remaining) [2023-08-29 20:34:26,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 77 remaining) [2023-08-29 20:34:26,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 77 remaining) [2023-08-29 20:34:26,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 77 remaining) [2023-08-29 20:34:26,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 77 remaining) [2023-08-29 20:34:26,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 77 remaining) [2023-08-29 20:34:26,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 77 remaining) [2023-08-29 20:34:26,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 77 remaining) [2023-08-29 20:34:26,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 77 remaining) [2023-08-29 20:34:26,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 77 remaining) [2023-08-29 20:34:26,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 77 remaining) [2023-08-29 20:34:26,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 77 remaining) [2023-08-29 20:34:26,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 77 remaining) [2023-08-29 20:34:26,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 77 remaining) [2023-08-29 20:34:26,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 77 remaining) [2023-08-29 20:34:26,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 77 remaining) [2023-08-29 20:34:26,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 77 remaining) [2023-08-29 20:34:26,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 77 remaining) [2023-08-29 20:34:26,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 77 remaining) [2023-08-29 20:34:26,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 77 remaining) [2023-08-29 20:34:26,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 77 remaining) [2023-08-29 20:34:26,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 77 remaining) [2023-08-29 20:34:26,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 77 remaining) [2023-08-29 20:34:26,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 77 remaining) [2023-08-29 20:34:26,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 77 remaining) [2023-08-29 20:34:26,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 77 remaining) [2023-08-29 20:34:26,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 77 remaining) [2023-08-29 20:34:26,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 77 remaining) [2023-08-29 20:34:26,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 77 remaining) [2023-08-29 20:34:26,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 77 remaining) [2023-08-29 20:34:26,575 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:34:26,770 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:34:26,771 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:34:26,776 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:34:26,777 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:34:26,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:34:26 BasicIcfg [2023-08-29 20:34:26,875 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:34:26,876 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:34:26,876 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:34:26,876 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:34:26,877 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:34:02" (3/4) ... [2023-08-29 20:34:26,879 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:34:26,879 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:34:26,880 INFO L158 Benchmark]: Toolchain (without parser) took 26121.72ms. Allocated memory was 69.2MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 44.8MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 275.7MB. Max. memory is 16.1GB. [2023-08-29 20:34:26,880 INFO L158 Benchmark]: CDTParser took 0.91ms. Allocated memory is still 69.2MB. Free memory is still 46.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:34:26,881 INFO L158 Benchmark]: CACSL2BoogieTranslator took 521.08ms. Allocated memory was 69.2MB in the beginning and 94.4MB in the end (delta: 25.2MB). Free memory was 44.6MB in the beginning and 62.2MB in the end (delta: -17.6MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. [2023-08-29 20:34:26,881 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.35ms. Allocated memory is still 94.4MB. Free memory was 62.2MB in the beginning and 59.4MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-29 20:34:26,882 INFO L158 Benchmark]: Boogie Preprocessor took 64.39ms. Allocated memory is still 94.4MB. Free memory was 59.4MB in the beginning and 57.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:34:26,882 INFO L158 Benchmark]: RCFGBuilder took 1332.89ms. Allocated memory was 94.4MB in the beginning and 117.4MB in the end (delta: 23.1MB). Free memory was 56.8MB in the beginning and 50.1MB in the end (delta: 6.7MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. [2023-08-29 20:34:26,883 INFO L158 Benchmark]: TraceAbstraction took 24148.57ms. Allocated memory was 117.4MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 49.1MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 228.6MB. Max. memory is 16.1GB. [2023-08-29 20:34:26,883 INFO L158 Benchmark]: Witness Printer took 3.08ms. Allocated memory is still 1.9GB. Free memory is still 1.6GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:34:26,885 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.91ms. Allocated memory is still 69.2MB. Free memory is still 46.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 521.08ms. Allocated memory was 69.2MB in the beginning and 94.4MB in the end (delta: 25.2MB). Free memory was 44.6MB in the beginning and 62.2MB in the end (delta: -17.6MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.35ms. Allocated memory is still 94.4MB. Free memory was 62.2MB in the beginning and 59.4MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.39ms. Allocated memory is still 94.4MB. Free memory was 59.4MB in the beginning and 57.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1332.89ms. Allocated memory was 94.4MB in the beginning and 117.4MB in the end (delta: 23.1MB). Free memory was 56.8MB in the beginning and 50.1MB in the end (delta: 6.7MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. * TraceAbstraction took 24148.57ms. Allocated memory was 117.4MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 49.1MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 228.6MB. Max. memory is 16.1GB. * Witness Printer took 3.08ms. Allocated memory is still 1.9GB. Free memory is still 1.6GB. 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: 11.4s, 177 PlacesBefore, 78 PlacesAfterwards, 169 TransitionsBefore, 68 TransitionsAfterwards, 6286 CoEnabledTransitionPairs, 7 FixpointIterations, 68 TrivialSequentialCompositions, 72 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 146 TotalNumberOfCompositions, 30266 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 11437, independent: 10874, independent conditional: 0, independent unconditional: 10874, dependent: 563, dependent conditional: 0, dependent unconditional: 563, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2631, independent: 2554, independent conditional: 0, independent unconditional: 2554, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 11437, independent: 8320, independent conditional: 0, independent unconditional: 8320, dependent: 486, dependent conditional: 0, dependent unconditional: 486, unknown: 2631, unknown conditional: 0, unknown unconditional: 2631] , Statistics on independence cache: Total cache size (in pairs): 432, Positive cache size: 393, Positive conditional cache size: 0, Positive unconditional cache size: 393, Negative cache size: 39, Negative conditional cache size: 0, Negative unconditional cache size: 39, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p1_EAX = 0; [L734] 0 int __unbuffered_p1_EBX = 0; [L735] 0 _Bool main$tmp_guard0; [L736] 0 _Bool main$tmp_guard1; [L738] 0 int x = 0; [L739] 0 _Bool x$flush_delayed; [L740] 0 int x$mem_tmp; [L741] 0 _Bool x$r_buff0_thd0; [L742] 0 _Bool x$r_buff0_thd1; [L743] 0 _Bool x$r_buff0_thd2; [L744] 0 _Bool x$r_buff0_thd3; [L745] 0 _Bool x$r_buff1_thd0; [L746] 0 _Bool x$r_buff1_thd1; [L747] 0 _Bool x$r_buff1_thd2; [L748] 0 _Bool x$r_buff1_thd3; [L749] 0 _Bool x$read_delayed; [L750] 0 int *x$read_delayed_var; [L751] 0 int x$w_buff0; [L752] 0 _Bool x$w_buff0_used; [L753] 0 int x$w_buff1; [L754] 0 _Bool x$w_buff1_used; [L756] 0 int y = 0; [L757] 0 _Bool weak$$choice0; [L758] 0 _Bool weak$$choice1; [L759] 0 _Bool weak$$choice2; [L849] 0 pthread_t t1749; [L850] FCALL, FORK 0 pthread_create(&t1749, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1749, ((void *)0), P0, ((void *)0))=0, t1749={15:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L851] 0 pthread_t t1750; [L763] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 1 x$flush_delayed = weak$$choice2 [L766] EXPR 1 \read(x) [L766] 1 x$mem_tmp = x [L767] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L767] EXPR 1 \read(x) [L767] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L767] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L769] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L770] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L771] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L773] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L774] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L775] 1 __unbuffered_p0_EAX$read_delayed_var = &x [L776] EXPR 1 \read(x) [L776] 1 __unbuffered_p0_EAX = x [L777] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L777] EXPR 1 \read(x) [L777] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L777] 1 x = x$flush_delayed ? x$mem_tmp : x [L778] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L781] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L786] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L788] 1 return 0; [L852] FCALL, FORK 0 pthread_create(&t1750, ((void *)0), P1, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1750, ((void *)0), P1, ((void *)0))=1, t1749={15:0}, t1750={5:0}, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L853] 0 pthread_t t1751; [L793] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L796] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L799] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L800] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L801] 2 x$flush_delayed = weak$$choice2 [L802] EXPR 2 \read(x) [L802] 2 x$mem_tmp = x [L803] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L803] EXPR 2 \read(x) [L803] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L803] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L804] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L805] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L806] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L807] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L808] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L809] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L810] EXPR 2 \read(x) [L810] 2 __unbuffered_p1_EBX = x [L811] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L811] EXPR 2 \read(x) [L811] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L811] 2 x = x$flush_delayed ? x$mem_tmp : x [L812] 2 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L854] FCALL, FORK 0 pthread_create(&t1751, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1751, ((void *)0), P2, ((void *)0))=2, t1749={15:0}, t1750={5:0}, t1751={7:0}, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L817] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L819] 2 return 0; [L824] 3 x = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L827] EXPR 3 \read(x) [L827] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L836] 3 return 0; [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L858] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L858] RET 0 assume_abort_if_not(main$tmp_guard0) [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 \read(x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, 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, t1749={15:0}, t1750={5:0}, t1751={7:0}, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L867] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L868] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L868] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L868] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L868] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L868] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L868] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L869] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L871] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=2, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] - 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: -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: -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: -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: -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: -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: 847]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 852]: 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: 850]: 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: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 226 locations, 77 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: 23.9s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 680 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 455 mSDsluCounter, 248 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 157 mSDsCounter, 92 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1245 IncrementalHoareTripleChecker+Invalid, 1337 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 92 mSolverCounterUnsat, 91 mSDtfsCounter, 1245 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 131 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=166occurred in iteration=10, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 154 NumberOfCodeBlocks, 154 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 123 ConstructedInterpolants, 0 QuantifiedInterpolants, 783 SizeOfPredicates, 36 NumberOfNonLiveVariables, 1416 ConjunctsInSsa, 65 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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:34:26,928 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