./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --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/weaver/bench-exp2x3.wvr.c -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 ebb6bba6491ab996b2a2d1f88baf86906cd5ba5ce7e0ad4dc20017ded9089a97 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-09-01 01:13:25,728 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 01:13:25,730 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 01:13:25,765 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 01:13:25,765 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 01:13:25,766 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 01:13:25,767 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 01:13:25,768 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 01:13:25,770 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 01:13:25,770 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 01:13:25,771 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 01:13:25,774 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 01:13:25,776 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 01:13:25,778 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 01:13:25,778 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 01:13:25,781 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 01:13:25,782 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 01:13:25,789 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 01:13:25,790 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 01:13:25,791 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 01:13:25,792 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 01:13:25,793 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 01:13:25,794 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 01:13:25,794 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 01:13:25,797 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 01:13:25,800 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 01:13:25,800 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 01:13:25,801 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 01:13:25,802 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 01:13:25,803 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 01:13:25,804 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 01:13:25,805 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 01:13:25,806 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 01:13:25,807 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 01:13:25,808 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 01:13:25,808 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 01:13:25,809 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 01:13:25,810 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 01:13:25,810 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 01:13:25,810 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 01:13:25,811 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 01:13:25,812 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-09-01 01:13:25,831 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 01:13:25,832 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 01:13:25,832 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 01:13:25,833 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 01:13:25,833 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 01:13:25,833 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 01:13:25,834 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 01:13:25,834 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 01:13:25,834 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 01:13:25,834 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 01:13:25,835 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 01:13:25,835 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-09-01 01:13:25,835 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 01:13:25,836 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 01:13:25,836 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 01:13:25,836 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-09-01 01:13:25,836 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-09-01 01:13:25,836 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-09-01 01:13:25,836 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 01:13:25,837 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-09-01 01:13:25,837 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 01:13:25,837 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 01:13:25,837 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 01:13:25,837 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 01:13:25,837 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 01:13:25,838 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 01:13:25,838 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 01:13:25,838 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 01:13:25,838 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-01 01:13:25,838 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-01 01:13:25,839 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 01:13:25,839 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 01:13:25,839 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 01:13:25,839 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 01:13:25,839 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 -> ebb6bba6491ab996b2a2d1f88baf86906cd5ba5ce7e0ad4dc20017ded9089a97 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 -> BEFORE [2023-09-01 01:13:26,101 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 01:13:26,118 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 01:13:26,120 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 01:13:26,121 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 01:13:26,121 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 01:13:26,122 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c [2023-09-01 01:13:27,043 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 01:13:27,216 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 01:13:27,216 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c [2023-09-01 01:13:27,220 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48449678a/4000e5a385ac4d31b300812c9d691353/FLAG442e86cf3 [2023-09-01 01:13:27,232 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48449678a/4000e5a385ac4d31b300812c9d691353 [2023-09-01 01:13:27,234 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 01:13:27,235 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 01:13:27,236 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 01:13:27,236 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 01:13:27,238 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 01:13:27,238 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 01:13:27" (1/1) ... [2023-09-01 01:13:27,239 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44806c7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:13:27, skipping insertion in model container [2023-09-01 01:13:27,240 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 01:13:27" (1/1) ... [2023-09-01 01:13:27,245 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 01:13:27,255 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 01:13:27,385 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c[2237,2250] [2023-09-01 01:13:27,391 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 01:13:27,399 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 01:13:27,433 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c[2237,2250] [2023-09-01 01:13:27,434 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 01:13:27,444 INFO L208 MainTranslator]: Completed translation [2023-09-01 01:13:27,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:13:27 WrapperNode [2023-09-01 01:13:27,445 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 01:13:27,446 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 01:13:27,446 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 01:13:27,446 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 01:13:27,451 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:13:27" (1/1) ... [2023-09-01 01:13:27,463 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:13:27" (1/1) ... [2023-09-01 01:13:27,485 INFO L138 Inliner]: procedures = 20, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 96 [2023-09-01 01:13:27,485 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 01:13:27,486 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 01:13:27,486 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 01:13:27,486 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 01:13:27,492 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:13:27" (1/1) ... [2023-09-01 01:13:27,492 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:13:27" (1/1) ... [2023-09-01 01:13:27,499 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:13:27" (1/1) ... [2023-09-01 01:13:27,499 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:13:27" (1/1) ... [2023-09-01 01:13:27,513 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:13:27" (1/1) ... [2023-09-01 01:13:27,517 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:13:27" (1/1) ... [2023-09-01 01:13:27,519 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:13:27" (1/1) ... [2023-09-01 01:13:27,523 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:13:27" (1/1) ... [2023-09-01 01:13:27,524 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 01:13:27,526 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 01:13:27,526 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 01:13:27,526 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 01:13:27,527 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:13:27" (1/1) ... [2023-09-01 01:13:27,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 01:13:27,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 01:13:27,547 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-09-01 01:13:27,560 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-09-01 01:13:27,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 01:13:27,572 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-09-01 01:13:27,573 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-09-01 01:13:27,573 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-09-01 01:13:27,573 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-09-01 01:13:27,573 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-09-01 01:13:27,576 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-09-01 01:13:27,576 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-09-01 01:13:27,576 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-09-01 01:13:27,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-01 01:13:27,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 01:13:27,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-01 01:13:27,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 01:13:27,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 01:13:27,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-01 01:13:27,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 01:13:27,578 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-01 01:13:27,652 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 01:13:27,654 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 01:13:27,952 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 01:13:27,960 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 01:13:27,961 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-09-01 01:13:27,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 01:13:27 BoogieIcfgContainer [2023-09-01 01:13:27,962 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 01:13:27,964 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 01:13:27,964 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 01:13:27,966 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 01:13:27,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 01:13:27" (1/3) ... [2023-09-01 01:13:27,967 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dcf513c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 01:13:27, skipping insertion in model container [2023-09-01 01:13:27,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:13:27" (2/3) ... [2023-09-01 01:13:27,967 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dcf513c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 01:13:27, skipping insertion in model container [2023-09-01 01:13:27,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 01:13:27" (3/3) ... [2023-09-01 01:13:27,968 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x3.wvr.c [2023-09-01 01:13:27,980 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 01:13:27,980 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2023-09-01 01:13:27,980 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 01:13:28,077 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-09-01 01:13:28,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 146 places, 143 transitions, 318 flow [2023-09-01 01:13:28,172 INFO L130 PetriNetUnfolder]: 10/139 cut-off events. [2023-09-01 01:13:28,173 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-09-01 01:13:28,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 139 events. 10/139 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 94 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2023-09-01 01:13:28,177 INFO L82 GeneralOperation]: Start removeDead. Operand has 146 places, 143 transitions, 318 flow [2023-09-01 01:13:28,183 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 135 transitions, 294 flow [2023-09-01 01:13:28,185 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 01:13:28,201 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 135 transitions, 294 flow [2023-09-01 01:13:28,204 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 135 transitions, 294 flow [2023-09-01 01:13:28,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 135 transitions, 294 flow [2023-09-01 01:13:28,243 INFO L130 PetriNetUnfolder]: 10/135 cut-off events. [2023-09-01 01:13:28,244 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-09-01 01:13:28,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 135 events. 10/135 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 93 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2023-09-01 01:13:28,247 INFO L119 LiptonReduction]: Number of co-enabled transitions 1608 [2023-09-01 01:13:32,069 INFO L134 LiptonReduction]: Checked pairs total: 2066 [2023-09-01 01:13:32,069 INFO L136 LiptonReduction]: Total number of compositions: 130 [2023-09-01 01:13:32,079 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 01:13:32,082 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;@5eb1244, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 01:13:32,083 INFO L358 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2023-09-01 01:13:32,084 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-09-01 01:13:32,084 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 01:13:32,084 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:13:32,085 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-09-01 01:13:32,085 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 01:13:32,088 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:13:32,088 INFO L85 PathProgramCache]: Analyzing trace with hash 516, now seen corresponding path program 1 times [2023-09-01 01:13:32,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:13:32,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996165906] [2023-09-01 01:13:32,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:13:32,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:13:32,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:13:32,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:13:32,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:13:32,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996165906] [2023-09-01 01:13:32,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996165906] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 01:13:32,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 01:13:32,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-09-01 01:13:32,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414677117] [2023-09-01 01:13:32,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 01:13:32,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-09-01 01:13:32,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:13:32,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-09-01 01:13:32,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-09-01 01:13:32,177 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 273 [2023-09-01 01:13:32,178 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 108 flow. Second operand has 2 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:32,178 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:13:32,179 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 273 [2023-09-01 01:13:32,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:13:32,293 INFO L130 PetriNetUnfolder]: 513/692 cut-off events. [2023-09-01 01:13:32,294 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2023-09-01 01:13:32,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1435 conditions, 692 events. 513/692 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1648 event pairs, 249 based on Foata normal form. 0/340 useless extension candidates. Maximal degree in co-relation 1020. Up to 693 conditions per place. [2023-09-01 01:13:32,301 INFO L137 encePairwiseOnDemand]: 270/273 looper letters, 39 selfloop transitions, 0 changer transitions 0/39 dead transitions. [2023-09-01 01:13:32,301 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 39 transitions, 180 flow [2023-09-01 01:13:32,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-01 01:13:32,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-09-01 01:13:32,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 298 transitions. [2023-09-01 01:13:32,315 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5457875457875457 [2023-09-01 01:13:32,315 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 298 transitions. [2023-09-01 01:13:32,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 298 transitions. [2023-09-01 01:13:32,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:13:32,320 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 298 transitions. [2023-09-01 01:13:32,324 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 149.0) internal successors, (298), 2 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:32,327 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 273.0) internal successors, (819), 3 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:32,327 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 273.0) internal successors, (819), 3 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:32,328 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 108 flow. Second operand 2 states and 298 transitions. [2023-09-01 01:13:32,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 39 transitions, 180 flow [2023-09-01 01:13:32,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 39 transitions, 164 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-09-01 01:13:32,333 INFO L231 Difference]: Finished difference. Result has 41 places, 39 transitions, 86 flow [2023-09-01 01:13:32,334 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=86, PETRI_PLACES=41, PETRI_TRANSITIONS=39} [2023-09-01 01:13:32,337 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -10 predicate places. [2023-09-01 01:13:32,337 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 39 transitions, 86 flow [2023-09-01 01:13:32,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:32,337 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:13:32,337 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-09-01 01:13:32,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-01 01:13:32,339 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 01:13:32,345 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:13:32,347 INFO L85 PathProgramCache]: Analyzing trace with hash 505234, now seen corresponding path program 1 times [2023-09-01 01:13:32,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:13:32,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152081070] [2023-09-01 01:13:32,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:13:32,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:13:32,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:13:32,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:13:32,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:13:32,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152081070] [2023-09-01 01:13:32,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152081070] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 01:13:32,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 01:13:32,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 01:13:32,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598042900] [2023-09-01 01:13:32,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 01:13:32,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 01:13:32,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:13:32,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 01:13:32,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 01:13:32,684 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 273 [2023-09-01 01:13:32,684 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 39 transitions, 86 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-09-01 01:13:32,685 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:13:32,685 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 273 [2023-09-01 01:13:32,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:13:32,757 INFO L130 PetriNetUnfolder]: 487/656 cut-off events. [2023-09-01 01:13:32,757 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 01:13:32,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1330 conditions, 656 events. 487/656 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1532 event pairs, 236 based on Foata normal form. 0/327 useless extension candidates. Maximal degree in co-relation 1327. Up to 656 conditions per place. [2023-09-01 01:13:32,760 INFO L137 encePairwiseOnDemand]: 270/273 looper letters, 36 selfloop transitions, 1 changer transitions 0/37 dead transitions. [2023-09-01 01:13:32,760 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 37 transitions, 156 flow [2023-09-01 01:13:32,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 01:13:32,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 01:13:32,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 408 transitions. [2023-09-01 01:13:32,762 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4981684981684982 [2023-09-01 01:13:32,762 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 408 transitions. [2023-09-01 01:13:32,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 408 transitions. [2023-09-01 01:13:32,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:13:32,762 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 408 transitions. [2023-09-01 01:13:32,763 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:32,764 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:32,765 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:32,765 INFO L175 Difference]: Start difference. First operand has 41 places, 39 transitions, 86 flow. Second operand 3 states and 408 transitions. [2023-09-01 01:13:32,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 37 transitions, 156 flow [2023-09-01 01:13:32,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 37 transitions, 156 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-09-01 01:13:32,766 INFO L231 Difference]: Finished difference. Result has 41 places, 37 transitions, 84 flow [2023-09-01 01:13:32,766 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=41, PETRI_TRANSITIONS=37} [2023-09-01 01:13:32,767 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -10 predicate places. [2023-09-01 01:13:32,767 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 37 transitions, 84 flow [2023-09-01 01:13:32,767 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-09-01 01:13:32,767 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:13:32,768 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-09-01 01:13:32,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-01 01:13:32,768 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 01:13:32,768 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:13:32,768 INFO L85 PathProgramCache]: Analyzing trace with hash 505233, now seen corresponding path program 1 times [2023-09-01 01:13:32,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:13:32,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76962839] [2023-09-01 01:13:32,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:13:32,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:13:32,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:13:32,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:13:32,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:13:32,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76962839] [2023-09-01 01:13:32,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76962839] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 01:13:32,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 01:13:32,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 01:13:32,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027398722] [2023-09-01 01:13:32,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 01:13:32,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 01:13:32,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:13:32,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 01:13:32,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 01:13:32,915 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 273 [2023-09-01 01:13:32,915 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 37 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:32,916 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:13:32,916 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 273 [2023-09-01 01:13:32,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:13:32,978 INFO L130 PetriNetUnfolder]: 461/620 cut-off events. [2023-09-01 01:13:32,979 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 01:13:32,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1260 conditions, 620 events. 461/620 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1430 event pairs, 223 based on Foata normal form. 0/314 useless extension candidates. Maximal degree in co-relation 1256. Up to 620 conditions per place. [2023-09-01 01:13:32,981 INFO L137 encePairwiseOnDemand]: 270/273 looper letters, 34 selfloop transitions, 1 changer transitions 0/35 dead transitions. [2023-09-01 01:13:32,981 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 35 transitions, 150 flow [2023-09-01 01:13:32,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 01:13:32,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 01:13:32,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2023-09-01 01:13:32,983 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47374847374847373 [2023-09-01 01:13:32,983 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 388 transitions. [2023-09-01 01:13:32,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 388 transitions. [2023-09-01 01:13:32,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:13:32,983 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 388 transitions. [2023-09-01 01:13:32,984 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:32,986 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:32,986 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:32,986 INFO L175 Difference]: Start difference. First operand has 41 places, 37 transitions, 84 flow. Second operand 3 states and 388 transitions. [2023-09-01 01:13:32,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 35 transitions, 150 flow [2023-09-01 01:13:32,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 35 transitions, 149 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 01:13:32,988 INFO L231 Difference]: Finished difference. Result has 40 places, 35 transitions, 81 flow [2023-09-01 01:13:32,988 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=38, 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=81, PETRI_PLACES=40, PETRI_TRANSITIONS=35} [2023-09-01 01:13:32,989 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -11 predicate places. [2023-09-01 01:13:32,991 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 35 transitions, 81 flow [2023-09-01 01:13:32,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:32,992 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:13:32,992 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-09-01 01:13:32,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-01 01:13:32,993 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 01:13:32,993 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:13:32,993 INFO L85 PathProgramCache]: Analyzing trace with hash 485539115, now seen corresponding path program 1 times [2023-09-01 01:13:32,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:13:32,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831403972] [2023-09-01 01:13:32,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:13:32,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:13:33,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:13:33,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:13:33,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:13:33,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831403972] [2023-09-01 01:13:33,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831403972] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 01:13:33,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 01:13:33,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 01:13:33,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683369197] [2023-09-01 01:13:33,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 01:13:33,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 01:13:33,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:13:33,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 01:13:33,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 01:13:33,123 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 273 [2023-09-01 01:13:33,123 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 81 flow. Second operand has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:33,123 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:13:33,123 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 273 [2023-09-01 01:13:33,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:13:33,175 INFO L130 PetriNetUnfolder]: 445/596 cut-off events. [2023-09-01 01:13:33,176 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 01:13:33,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1213 conditions, 596 events. 445/596 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1370 event pairs, 215 based on Foata normal form. 0/306 useless extension candidates. Maximal degree in co-relation 1209. Up to 596 conditions per place. [2023-09-01 01:13:33,178 INFO L137 encePairwiseOnDemand]: 270/273 looper letters, 32 selfloop transitions, 1 changer transitions 0/33 dead transitions. [2023-09-01 01:13:33,178 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 33 transitions, 143 flow [2023-09-01 01:13:33,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 01:13:33,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 01:13:33,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 404 transitions. [2023-09-01 01:13:33,180 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4932844932844933 [2023-09-01 01:13:33,180 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 404 transitions. [2023-09-01 01:13:33,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 404 transitions. [2023-09-01 01:13:33,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:13:33,180 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 404 transitions. [2023-09-01 01:13:33,181 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:33,182 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:33,182 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:33,183 INFO L175 Difference]: Start difference. First operand has 40 places, 35 transitions, 81 flow. Second operand 3 states and 404 transitions. [2023-09-01 01:13:33,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 33 transitions, 143 flow [2023-09-01 01:13:33,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 33 transitions, 142 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 01:13:33,184 INFO L231 Difference]: Finished difference. Result has 39 places, 33 transitions, 78 flow [2023-09-01 01:13:33,184 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=39, PETRI_TRANSITIONS=33} [2023-09-01 01:13:33,184 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -12 predicate places. [2023-09-01 01:13:33,184 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 33 transitions, 78 flow [2023-09-01 01:13:33,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:33,185 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:13:33,185 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-09-01 01:13:33,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-09-01 01:13:33,185 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 01:13:33,186 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:13:33,186 INFO L85 PathProgramCache]: Analyzing trace with hash 485539113, now seen corresponding path program 1 times [2023-09-01 01:13:33,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:13:33,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849002832] [2023-09-01 01:13:33,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:13:33,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:13:33,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:13:33,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-09-01 01:13:33,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:13:33,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849002832] [2023-09-01 01:13:33,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849002832] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 01:13:33,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 01:13:33,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 01:13:33,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064560011] [2023-09-01 01:13:33,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 01:13:33,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 01:13:33,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:13:33,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 01:13:33,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 01:13:33,296 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 273 [2023-09-01 01:13:33,296 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:33,297 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:13:33,297 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 273 [2023-09-01 01:13:33,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:13:33,345 INFO L130 PetriNetUnfolder]: 429/572 cut-off events. [2023-09-01 01:13:33,345 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 01:13:33,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1166 conditions, 572 events. 429/572 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1295 event pairs, 207 based on Foata normal form. 0/298 useless extension candidates. Maximal degree in co-relation 1162. Up to 572 conditions per place. [2023-09-01 01:13:33,348 INFO L137 encePairwiseOnDemand]: 270/273 looper letters, 30 selfloop transitions, 1 changer transitions 0/31 dead transitions. [2023-09-01 01:13:33,348 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 31 transitions, 136 flow [2023-09-01 01:13:33,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 01:13:33,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 01:13:33,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 384 transitions. [2023-09-01 01:13:33,349 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46886446886446886 [2023-09-01 01:13:33,349 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 384 transitions. [2023-09-01 01:13:33,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 384 transitions. [2023-09-01 01:13:33,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:13:33,350 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 384 transitions. [2023-09-01 01:13:33,351 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:33,352 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:33,352 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:33,352 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 78 flow. Second operand 3 states and 384 transitions. [2023-09-01 01:13:33,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 31 transitions, 136 flow [2023-09-01 01:13:33,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 31 transitions, 135 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 01:13:33,353 INFO L231 Difference]: Finished difference. Result has 38 places, 31 transitions, 75 flow [2023-09-01 01:13:33,353 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=75, PETRI_PLACES=38, PETRI_TRANSITIONS=31} [2023-09-01 01:13:33,354 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -13 predicate places. [2023-09-01 01:13:33,354 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 31 transitions, 75 flow [2023-09-01 01:13:33,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:33,354 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:13:33,355 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-09-01 01:13:33,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-09-01 01:13:33,355 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 01:13:33,355 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:13:33,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1548335376, now seen corresponding path program 1 times [2023-09-01 01:13:33,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:13:33,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952024212] [2023-09-01 01:13:33,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:13:33,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:13:33,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:13:33,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:13:33,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:13:33,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952024212] [2023-09-01 01:13:33,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952024212] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 01:13:33,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 01:13:33,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 01:13:33,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167523991] [2023-09-01 01:13:33,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 01:13:33,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 01:13:33,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:13:33,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 01:13:33,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 01:13:33,428 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 273 [2023-09-01 01:13:33,429 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 31 transitions, 75 flow. Second operand has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:33,429 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:13:33,429 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 273 [2023-09-01 01:13:33,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:13:33,473 INFO L130 PetriNetUnfolder]: 403/536 cut-off events. [2023-09-01 01:13:33,473 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 01:13:33,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1095 conditions, 536 events. 403/536 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1185 event pairs, 194 based on Foata normal form. 0/285 useless extension candidates. Maximal degree in co-relation 1091. Up to 536 conditions per place. [2023-09-01 01:13:33,475 INFO L137 encePairwiseOnDemand]: 270/273 looper letters, 28 selfloop transitions, 1 changer transitions 0/29 dead transitions. [2023-09-01 01:13:33,476 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 29 transitions, 129 flow [2023-09-01 01:13:33,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 01:13:33,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 01:13:33,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 400 transitions. [2023-09-01 01:13:33,477 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4884004884004884 [2023-09-01 01:13:33,477 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 400 transitions. [2023-09-01 01:13:33,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 400 transitions. [2023-09-01 01:13:33,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:13:33,478 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 400 transitions. [2023-09-01 01:13:33,478 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:33,479 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:33,480 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:33,480 INFO L175 Difference]: Start difference. First operand has 38 places, 31 transitions, 75 flow. Second operand 3 states and 400 transitions. [2023-09-01 01:13:33,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 29 transitions, 129 flow [2023-09-01 01:13:33,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 29 transitions, 128 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 01:13:33,481 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 72 flow [2023-09-01 01:13:33,481 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2023-09-01 01:13:33,481 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -14 predicate places. [2023-09-01 01:13:33,482 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 72 flow [2023-09-01 01:13:33,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:33,482 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:13:33,482 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-09-01 01:13:33,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-09-01 01:13:33,482 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 01:13:33,483 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:13:33,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1548335375, now seen corresponding path program 1 times [2023-09-01 01:13:33,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:13:33,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001470478] [2023-09-01 01:13:33,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:13:33,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:13:33,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:13:33,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:13:33,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:13:33,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001470478] [2023-09-01 01:13:33,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001470478] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 01:13:33,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 01:13:33,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 01:13:33,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584528225] [2023-09-01 01:13:33,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 01:13:33,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 01:13:33,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:13:33,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 01:13:33,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 01:13:33,562 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 273 [2023-09-01 01:13:33,563 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:33,563 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:13:33,563 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 273 [2023-09-01 01:13:33,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:13:33,605 INFO L130 PetriNetUnfolder]: 377/500 cut-off events. [2023-09-01 01:13:33,605 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 01:13:33,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1024 conditions, 500 events. 377/500 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1076 event pairs, 181 based on Foata normal form. 0/272 useless extension candidates. Maximal degree in co-relation 1020. Up to 500 conditions per place. [2023-09-01 01:13:33,607 INFO L137 encePairwiseOnDemand]: 270/273 looper letters, 26 selfloop transitions, 1 changer transitions 0/27 dead transitions. [2023-09-01 01:13:33,607 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 27 transitions, 122 flow [2023-09-01 01:13:33,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 01:13:33,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 01:13:33,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 380 transitions. [2023-09-01 01:13:33,609 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.463980463980464 [2023-09-01 01:13:33,609 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 380 transitions. [2023-09-01 01:13:33,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 380 transitions. [2023-09-01 01:13:33,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:13:33,609 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 380 transitions. [2023-09-01 01:13:33,610 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-09-01 01:13:33,611 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:33,611 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:33,611 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 72 flow. Second operand 3 states and 380 transitions. [2023-09-01 01:13:33,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 27 transitions, 122 flow [2023-09-01 01:13:33,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 27 transitions, 121 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 01:13:33,612 INFO L231 Difference]: Finished difference. Result has 36 places, 27 transitions, 69 flow [2023-09-01 01:13:33,612 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=69, PETRI_PLACES=36, PETRI_TRANSITIONS=27} [2023-09-01 01:13:33,613 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -15 predicate places. [2023-09-01 01:13:33,613 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 27 transitions, 69 flow [2023-09-01 01:13:33,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:33,613 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:13:33,613 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 01:13:33,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-09-01 01:13:33,614 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 01:13:33,614 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:13:33,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1891601682, now seen corresponding path program 1 times [2023-09-01 01:13:33,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:13:33,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399642881] [2023-09-01 01:13:33,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:13:33,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:13:33,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:13:33,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:13:33,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:13:33,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399642881] [2023-09-01 01:13:33,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399642881] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 01:13:33,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 01:13:33,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 01:13:33,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008087063] [2023-09-01 01:13:33,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 01:13:33,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 01:13:33,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:13:33,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 01:13:33,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 01:13:33,829 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 273 [2023-09-01 01:13:33,830 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 69 flow. Second operand has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:33,830 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:13:33,830 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 273 [2023-09-01 01:13:33,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:13:33,871 INFO L130 PetriNetUnfolder]: 313/420 cut-off events. [2023-09-01 01:13:33,872 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 01:13:33,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 865 conditions, 420 events. 313/420 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 852 event pairs, 149 based on Foata normal form. 0/240 useless extension candidates. Maximal degree in co-relation 861. Up to 420 conditions per place. [2023-09-01 01:13:33,873 INFO L137 encePairwiseOnDemand]: 271/273 looper letters, 25 selfloop transitions, 1 changer transitions 0/26 dead transitions. [2023-09-01 01:13:33,874 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 26 transitions, 119 flow [2023-09-01 01:13:33,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 01:13:33,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 01:13:33,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 396 transitions. [2023-09-01 01:13:33,875 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4835164835164835 [2023-09-01 01:13:33,875 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 396 transitions. [2023-09-01 01:13:33,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 396 transitions. [2023-09-01 01:13:33,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:13:33,875 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 396 transitions. [2023-09-01 01:13:33,876 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:33,877 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:33,877 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:33,877 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 69 flow. Second operand 3 states and 396 transitions. [2023-09-01 01:13:33,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 26 transitions, 119 flow [2023-09-01 01:13:33,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 26 transitions, 118 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 01:13:33,878 INFO L231 Difference]: Finished difference. Result has 36 places, 26 transitions, 68 flow [2023-09-01 01:13:33,879 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=36, PETRI_TRANSITIONS=26} [2023-09-01 01:13:33,879 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -15 predicate places. [2023-09-01 01:13:33,879 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 26 transitions, 68 flow [2023-09-01 01:13:33,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:33,879 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:13:33,880 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 01:13:33,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-09-01 01:13:33,880 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 01:13:33,880 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:13:33,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1891601683, now seen corresponding path program 1 times [2023-09-01 01:13:33,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:13:33,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004957591] [2023-09-01 01:13:33,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:13:33,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:13:33,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:13:34,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:13:34,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:13:34,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004957591] [2023-09-01 01:13:34,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004957591] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 01:13:34,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 01:13:34,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 01:13:34,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178685679] [2023-09-01 01:13:34,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 01:13:34,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 01:13:34,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:13:34,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 01:13:34,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-09-01 01:13:34,098 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 273 [2023-09-01 01:13:34,098 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 26 transitions, 68 flow. Second operand has 6 states, 6 states have (on average 106.5) internal successors, (639), 6 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-09-01 01:13:34,099 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:13:34,099 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 273 [2023-09-01 01:13:34,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:13:34,140 INFO L130 PetriNetUnfolder]: 249/340 cut-off events. [2023-09-01 01:13:34,140 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 01:13:34,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 706 conditions, 340 events. 249/340 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 644 event pairs, 117 based on Foata normal form. 0/208 useless extension candidates. Maximal degree in co-relation 702. Up to 340 conditions per place. [2023-09-01 01:13:34,142 INFO L137 encePairwiseOnDemand]: 271/273 looper letters, 24 selfloop transitions, 1 changer transitions 0/25 dead transitions. [2023-09-01 01:13:34,142 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 25 transitions, 116 flow [2023-09-01 01:13:34,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 01:13:34,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 01:13:34,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 341 transitions. [2023-09-01 01:13:34,146 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4163614163614164 [2023-09-01 01:13:34,146 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 341 transitions. [2023-09-01 01:13:34,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 341 transitions. [2023-09-01 01:13:34,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:13:34,146 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 341 transitions. [2023-09-01 01:13:34,147 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:34,148 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:34,148 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:34,148 INFO L175 Difference]: Start difference. First operand has 36 places, 26 transitions, 68 flow. Second operand 3 states and 341 transitions. [2023-09-01 01:13:34,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 25 transitions, 116 flow [2023-09-01 01:13:34,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 25 transitions, 115 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 01:13:34,149 INFO L231 Difference]: Finished difference. Result has 36 places, 25 transitions, 67 flow [2023-09-01 01:13:34,149 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=67, PETRI_PLACES=36, PETRI_TRANSITIONS=25} [2023-09-01 01:13:34,150 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -15 predicate places. [2023-09-01 01:13:34,150 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 25 transitions, 67 flow [2023-09-01 01:13:34,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 106.5) internal successors, (639), 6 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-09-01 01:13:34,150 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:13:34,150 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-09-01 01:13:34,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-09-01 01:13:34,151 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 01:13:34,151 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:13:34,151 INFO L85 PathProgramCache]: Analyzing trace with hash 235458399, now seen corresponding path program 1 times [2023-09-01 01:13:34,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:13:34,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455830838] [2023-09-01 01:13:34,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:13:34,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:13:34,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:13:34,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:13:34,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:13:34,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455830838] [2023-09-01 01:13:34,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455830838] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 01:13:34,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 01:13:34,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 01:13:34,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441852360] [2023-09-01 01:13:34,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 01:13:34,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 01:13:34,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:13:34,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 01:13:34,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 01:13:34,426 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 273 [2023-09-01 01:13:34,426 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 25 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:34,426 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:13:34,426 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 273 [2023-09-01 01:13:34,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:13:34,498 INFO L130 PetriNetUnfolder]: 497/677 cut-off events. [2023-09-01 01:13:34,498 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2023-09-01 01:13:34,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1395 conditions, 677 events. 497/677 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1784 event pairs, 117 based on Foata normal form. 1/414 useless extension candidates. Maximal degree in co-relation 1391. Up to 471 conditions per place. [2023-09-01 01:13:34,501 INFO L137 encePairwiseOnDemand]: 267/273 looper letters, 41 selfloop transitions, 5 changer transitions 1/47 dead transitions. [2023-09-01 01:13:34,501 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 47 transitions, 212 flow [2023-09-01 01:13:34,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 01:13:34,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 01:13:34,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 396 transitions. [2023-09-01 01:13:34,502 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4835164835164835 [2023-09-01 01:13:34,503 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 396 transitions. [2023-09-01 01:13:34,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 396 transitions. [2023-09-01 01:13:34,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:13:34,503 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 396 transitions. [2023-09-01 01:13:34,504 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:34,505 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:34,505 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:34,505 INFO L175 Difference]: Start difference. First operand has 36 places, 25 transitions, 67 flow. Second operand 3 states and 396 transitions. [2023-09-01 01:13:34,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 47 transitions, 212 flow [2023-09-01 01:13:34,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 47 transitions, 211 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 01:13:34,506 INFO L231 Difference]: Finished difference. Result has 38 places, 29 transitions, 99 flow [2023-09-01 01:13:34,507 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=38, PETRI_TRANSITIONS=29} [2023-09-01 01:13:34,508 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -13 predicate places. [2023-09-01 01:13:34,508 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 29 transitions, 99 flow [2023-09-01 01:13:34,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:34,508 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:13:34,508 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 01:13:34,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-09-01 01:13:34,509 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 01:13:34,509 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:13:34,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1175869988, now seen corresponding path program 1 times [2023-09-01 01:13:34,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:13:34,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296045249] [2023-09-01 01:13:34,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:13:34,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:13:34,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:13:34,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:13:34,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:13:34,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296045249] [2023-09-01 01:13:34,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296045249] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 01:13:34,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 01:13:34,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 01:13:34,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160859141] [2023-09-01 01:13:34,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 01:13:34,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 01:13:34,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:13:34,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 01:13:34,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 01:13:34,667 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 273 [2023-09-01 01:13:34,668 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 99 flow. Second operand has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:34,668 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:13:34,668 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 273 [2023-09-01 01:13:34,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:13:34,804 INFO L130 PetriNetUnfolder]: 693/951 cut-off events. [2023-09-01 01:13:34,805 INFO L131 PetriNetUnfolder]: For 342/342 co-relation queries the response was YES. [2023-09-01 01:13:34,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2425 conditions, 951 events. 693/951 cut-off events. For 342/342 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2804 event pairs, 67 based on Foata normal form. 32/983 useless extension candidates. Maximal degree in co-relation 2420. Up to 371 conditions per place. [2023-09-01 01:13:34,809 INFO L137 encePairwiseOnDemand]: 268/273 looper letters, 68 selfloop transitions, 10 changer transitions 0/78 dead transitions. [2023-09-01 01:13:34,809 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 78 transitions, 395 flow [2023-09-01 01:13:34,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 01:13:34,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 01:13:34,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 652 transitions. [2023-09-01 01:13:34,811 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4776556776556777 [2023-09-01 01:13:34,811 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 652 transitions. [2023-09-01 01:13:34,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 652 transitions. [2023-09-01 01:13:34,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:13:34,812 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 652 transitions. [2023-09-01 01:13:34,813 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.4) internal successors, (652), 5 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:34,814 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:34,814 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:34,815 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 99 flow. Second operand 5 states and 652 transitions. [2023-09-01 01:13:34,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 78 transitions, 395 flow [2023-09-01 01:13:34,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 78 transitions, 387 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 01:13:34,817 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 159 flow [2023-09-01 01:13:34,817 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=159, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2023-09-01 01:13:34,817 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -8 predicate places. [2023-09-01 01:13:34,817 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 159 flow [2023-09-01 01:13:34,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:34,818 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:13:34,818 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 01:13:34,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-09-01 01:13:34,818 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 01:13:34,818 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:13:34,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1244741241, now seen corresponding path program 1 times [2023-09-01 01:13:34,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:13:34,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608710809] [2023-09-01 01:13:34,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:13:34,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:13:34,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:13:34,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:13:34,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:13:34,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608710809] [2023-09-01 01:13:34,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608710809] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 01:13:34,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553752465] [2023-09-01 01:13:34,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:13:34,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 01:13:34,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 01:13:34,931 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 01:13:34,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-09-01 01:13:35,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:13:35,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 7 conjunts are in the unsatisfiable core [2023-09-01 01:13:35,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 01:13:35,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:13:35,227 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 01:13:35,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:13:35,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553752465] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 01:13:35,276 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 01:13:35,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-09-01 01:13:35,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491959272] [2023-09-01 01:13:35,276 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 01:13:35,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 01:13:35,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:13:35,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 01:13:35,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-09-01 01:13:35,365 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 273 [2023-09-01 01:13:35,366 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 159 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-09-01 01:13:35,366 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:13:35,366 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 273 [2023-09-01 01:13:35,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:13:35,625 INFO L130 PetriNetUnfolder]: 1309/1809 cut-off events. [2023-09-01 01:13:35,625 INFO L131 PetriNetUnfolder]: For 1985/1985 co-relation queries the response was YES. [2023-09-01 01:13:35,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5617 conditions, 1809 events. 1309/1809 cut-off events. For 1985/1985 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6336 event pairs, 291 based on Foata normal form. 68/1877 useless extension candidates. Maximal degree in co-relation 5610. Up to 757 conditions per place. [2023-09-01 01:13:35,635 INFO L137 encePairwiseOnDemand]: 268/273 looper letters, 98 selfloop transitions, 8 changer transitions 0/106 dead transitions. [2023-09-01 01:13:35,635 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 106 transitions, 649 flow [2023-09-01 01:13:35,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 01:13:35,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 01:13:35,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 662 transitions. [2023-09-01 01:13:35,637 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.484981684981685 [2023-09-01 01:13:35,637 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 662 transitions. [2023-09-01 01:13:35,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 662 transitions. [2023-09-01 01:13:35,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:13:35,638 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 662 transitions. [2023-09-01 01:13:35,639 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.4) internal successors, (662), 5 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:35,640 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:35,640 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:35,640 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 159 flow. Second operand 5 states and 662 transitions. [2023-09-01 01:13:35,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 106 transitions, 649 flow [2023-09-01 01:13:35,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 106 transitions, 649 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-09-01 01:13:35,644 INFO L231 Difference]: Finished difference. Result has 50 places, 41 transitions, 214 flow [2023-09-01 01:13:35,644 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=214, PETRI_PLACES=50, PETRI_TRANSITIONS=41} [2023-09-01 01:13:35,645 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -1 predicate places. [2023-09-01 01:13:35,645 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 214 flow [2023-09-01 01:13:35,645 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-09-01 01:13:35,645 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:13:35,645 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 01:13:35,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-09-01 01:13:35,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-09-01 01:13:35,851 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 01:13:35,851 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:13:35,851 INFO L85 PathProgramCache]: Analyzing trace with hash -898378087, now seen corresponding path program 1 times [2023-09-01 01:13:35,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:13:35,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53434633] [2023-09-01 01:13:35,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:13:35,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:13:35,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:13:35,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:13:35,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:13:35,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53434633] [2023-09-01 01:13:35,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53434633] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 01:13:35,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 01:13:35,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 01:13:35,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035679716] [2023-09-01 01:13:35,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 01:13:35,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 01:13:35,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:13:35,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 01:13:35,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 01:13:36,029 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 273 [2023-09-01 01:13:36,030 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 214 flow. Second operand has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:36,030 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:13:36,030 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 273 [2023-09-01 01:13:36,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:13:36,215 INFO L130 PetriNetUnfolder]: 1267/1767 cut-off events. [2023-09-01 01:13:36,215 INFO L131 PetriNetUnfolder]: For 3216/3216 co-relation queries the response was YES. [2023-09-01 01:13:36,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6452 conditions, 1767 events. 1267/1767 cut-off events. For 3216/3216 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 6486 event pairs, 121 based on Foata normal form. 42/1809 useless extension candidates. Maximal degree in co-relation 6441. Up to 676 conditions per place. [2023-09-01 01:13:36,225 INFO L137 encePairwiseOnDemand]: 268/273 looper letters, 96 selfloop transitions, 10 changer transitions 0/106 dead transitions. [2023-09-01 01:13:36,225 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 106 transitions, 713 flow [2023-09-01 01:13:36,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 01:13:36,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 01:13:36,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 656 transitions. [2023-09-01 01:13:36,227 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4805860805860806 [2023-09-01 01:13:36,227 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 656 transitions. [2023-09-01 01:13:36,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 656 transitions. [2023-09-01 01:13:36,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:13:36,227 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 656 transitions. [2023-09-01 01:13:36,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 131.2) internal successors, (656), 5 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:36,230 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:36,230 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:36,230 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 214 flow. Second operand 5 states and 656 transitions. [2023-09-01 01:13:36,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 106 transitions, 713 flow [2023-09-01 01:13:36,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 106 transitions, 713 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-09-01 01:13:36,236 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 277 flow [2023-09-01 01:13:36,237 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=277, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2023-09-01 01:13:36,237 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 4 predicate places. [2023-09-01 01:13:36,237 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 277 flow [2023-09-01 01:13:36,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:36,238 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:13:36,238 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 01:13:36,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-09-01 01:13:36,238 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 01:13:36,238 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:13:36,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1636193355, now seen corresponding path program 1 times [2023-09-01 01:13:36,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:13:36,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655202506] [2023-09-01 01:13:36,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:13:36,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:13:36,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:13:36,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:13:36,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:13:36,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655202506] [2023-09-01 01:13:36,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655202506] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 01:13:36,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838703292] [2023-09-01 01:13:36,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:13:36,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 01:13:36,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 01:13:36,350 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 01:13:36,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-09-01 01:13:36,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:13:36,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 7 conjunts are in the unsatisfiable core [2023-09-01 01:13:36,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 01:13:36,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:13:36,509 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 01:13:36,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:13:36,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838703292] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 01:13:36,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 01:13:36,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-09-01 01:13:36,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089230763] [2023-09-01 01:13:36,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 01:13:36,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 01:13:36,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:13:36,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 01:13:36,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-09-01 01:13:36,599 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 273 [2023-09-01 01:13:36,600 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 277 flow. Second operand has 6 states, 6 states have (on average 121.66666666666667) internal successors, (730), 6 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:36,600 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:13:36,600 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 273 [2023-09-01 01:13:36,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:13:36,816 INFO L130 PetriNetUnfolder]: 1677/2363 cut-off events. [2023-09-01 01:13:36,816 INFO L131 PetriNetUnfolder]: For 4871/4871 co-relation queries the response was YES. [2023-09-01 01:13:36,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9238 conditions, 2363 events. 1677/2363 cut-off events. For 4871/4871 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 9118 event pairs, 347 based on Foata normal form. 90/2453 useless extension candidates. Maximal degree in co-relation 9225. Up to 957 conditions per place. [2023-09-01 01:13:36,829 INFO L137 encePairwiseOnDemand]: 268/273 looper letters, 104 selfloop transitions, 10 changer transitions 0/114 dead transitions. [2023-09-01 01:13:36,829 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 114 transitions, 879 flow [2023-09-01 01:13:36,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 01:13:36,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 01:13:36,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 654 transitions. [2023-09-01 01:13:36,831 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47912087912087914 [2023-09-01 01:13:36,831 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 654 transitions. [2023-09-01 01:13:36,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 654 transitions. [2023-09-01 01:13:36,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:13:36,831 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 654 transitions. [2023-09-01 01:13:36,832 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.8) internal successors, (654), 5 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:36,834 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:36,834 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:36,834 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 277 flow. Second operand 5 states and 654 transitions. [2023-09-01 01:13:36,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 114 transitions, 879 flow [2023-09-01 01:13:36,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 114 transitions, 834 flow, removed 16 selfloop flow, removed 1 redundant places. [2023-09-01 01:13:36,840 INFO L231 Difference]: Finished difference. Result has 60 places, 49 transitions, 318 flow [2023-09-01 01:13:36,840 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=318, PETRI_PLACES=60, PETRI_TRANSITIONS=49} [2023-09-01 01:13:36,841 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 9 predicate places. [2023-09-01 01:13:36,841 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 49 transitions, 318 flow [2023-09-01 01:13:36,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.66666666666667) internal successors, (730), 6 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:36,841 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:13:36,841 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 01:13:36,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-09-01 01:13:37,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-09-01 01:13:37,046 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 01:13:37,047 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:13:37,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1653076919, now seen corresponding path program 2 times [2023-09-01 01:13:37,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:13:37,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828573322] [2023-09-01 01:13:37,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:13:37,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:13:37,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:13:37,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:13:37,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:13:37,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828573322] [2023-09-01 01:13:37,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828573322] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 01:13:37,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 01:13:37,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 01:13:37,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135738627] [2023-09-01 01:13:37,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 01:13:37,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 01:13:37,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:13:37,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 01:13:37,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 01:13:37,172 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 273 [2023-09-01 01:13:37,173 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 49 transitions, 318 flow. Second operand has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:37,173 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:13:37,173 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 273 [2023-09-01 01:13:37,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:13:37,379 INFO L130 PetriNetUnfolder]: 1475/2065 cut-off events. [2023-09-01 01:13:37,379 INFO L131 PetriNetUnfolder]: For 4844/4844 co-relation queries the response was YES. [2023-09-01 01:13:37,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8746 conditions, 2065 events. 1475/2065 cut-off events. For 4844/4844 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7808 event pairs, 77 based on Foata normal form. 42/2107 useless extension candidates. Maximal degree in co-relation 8730. Up to 818 conditions per place. [2023-09-01 01:13:37,399 INFO L137 encePairwiseOnDemand]: 268/273 looper letters, 100 selfloop transitions, 9 changer transitions 2/111 dead transitions. [2023-09-01 01:13:37,399 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 111 transitions, 849 flow [2023-09-01 01:13:37,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 01:13:37,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 01:13:37,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 651 transitions. [2023-09-01 01:13:37,401 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47692307692307695 [2023-09-01 01:13:37,401 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 651 transitions. [2023-09-01 01:13:37,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 651 transitions. [2023-09-01 01:13:37,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:13:37,402 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 651 transitions. [2023-09-01 01:13:37,404 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.2) internal successors, (651), 5 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:37,406 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:37,406 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:37,406 INFO L175 Difference]: Start difference. First operand has 60 places, 49 transitions, 318 flow. Second operand 5 states and 651 transitions. [2023-09-01 01:13:37,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 111 transitions, 849 flow [2023-09-01 01:13:37,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 111 transitions, 840 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-09-01 01:13:37,421 INFO L231 Difference]: Finished difference. Result has 64 places, 48 transitions, 322 flow [2023-09-01 01:13:37,421 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=322, PETRI_PLACES=64, PETRI_TRANSITIONS=48} [2023-09-01 01:13:37,422 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 13 predicate places. [2023-09-01 01:13:37,422 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 48 transitions, 322 flow [2023-09-01 01:13:37,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:37,422 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:13:37,422 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 01:13:37,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-09-01 01:13:37,423 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 01:13:37,423 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:13:37,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1099899322, now seen corresponding path program 2 times [2023-09-01 01:13:37,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:13:37,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329943177] [2023-09-01 01:13:37,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:13:37,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:13:37,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:13:37,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:13:37,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:13:37,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329943177] [2023-09-01 01:13:37,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329943177] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 01:13:37,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971336183] [2023-09-01 01:13:37,530 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-01 01:13:37,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 01:13:37,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 01:13:37,537 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 01:13:37,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-09-01 01:13:37,642 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-01 01:13:37,642 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 01:13:37,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 7 conjunts are in the unsatisfiable core [2023-09-01 01:13:37,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 01:13:37,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:13:37,749 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 01:13:37,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:13:37,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [971336183] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 01:13:37,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 01:13:37,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-09-01 01:13:37,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166230476] [2023-09-01 01:13:37,811 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 01:13:37,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 01:13:37,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:13:37,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 01:13:37,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-09-01 01:13:37,877 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 273 [2023-09-01 01:13:37,878 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 48 transitions, 322 flow. Second operand has 6 states, 6 states have (on average 122.66666666666667) internal successors, (736), 6 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:37,878 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:13:37,878 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 273 [2023-09-01 01:13:37,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:13:38,132 INFO L130 PetriNetUnfolder]: 1719/2393 cut-off events. [2023-09-01 01:13:38,132 INFO L131 PetriNetUnfolder]: For 5907/5907 co-relation queries the response was YES. [2023-09-01 01:13:38,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10668 conditions, 2393 events. 1719/2393 cut-off events. For 5907/5907 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 8942 event pairs, 311 based on Foata normal form. 84/2477 useless extension candidates. Maximal degree in co-relation 10651. Up to 1357 conditions per place. [2023-09-01 01:13:38,143 INFO L137 encePairwiseOnDemand]: 268/273 looper letters, 101 selfloop transitions, 8 changer transitions 0/109 dead transitions. [2023-09-01 01:13:38,144 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 109 transitions, 869 flow [2023-09-01 01:13:38,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 01:13:38,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 01:13:38,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 648 transitions. [2023-09-01 01:13:38,145 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4747252747252747 [2023-09-01 01:13:38,145 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 648 transitions. [2023-09-01 01:13:38,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 648 transitions. [2023-09-01 01:13:38,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:13:38,146 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 648 transitions. [2023-09-01 01:13:38,147 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.6) internal successors, (648), 5 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:38,149 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:38,149 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:38,149 INFO L175 Difference]: Start difference. First operand has 64 places, 48 transitions, 322 flow. Second operand 5 states and 648 transitions. [2023-09-01 01:13:38,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 109 transitions, 869 flow [2023-09-01 01:13:38,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 109 transitions, 862 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 01:13:38,155 INFO L231 Difference]: Finished difference. Result has 69 places, 51 transitions, 369 flow [2023-09-01 01:13:38,156 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=369, PETRI_PLACES=69, PETRI_TRANSITIONS=51} [2023-09-01 01:13:38,156 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 18 predicate places. [2023-09-01 01:13:38,156 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 51 transitions, 369 flow [2023-09-01 01:13:38,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.66666666666667) internal successors, (736), 6 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:38,157 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:13:38,157 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 01:13:38,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-09-01 01:13:38,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 01:13:38,363 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 01:13:38,363 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:13:38,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1775166833, now seen corresponding path program 2 times [2023-09-01 01:13:38,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:13:38,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570044842] [2023-09-01 01:13:38,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:13:38,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:13:38,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:13:38,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:13:38,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:13:38,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570044842] [2023-09-01 01:13:38,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570044842] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 01:13:38,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 01:13:38,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 01:13:38,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573739380] [2023-09-01 01:13:38,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 01:13:38,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 01:13:38,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:13:38,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 01:13:38,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 01:13:38,483 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 273 [2023-09-01 01:13:38,484 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 51 transitions, 369 flow. Second operand has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:38,484 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:13:38,484 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 273 [2023-09-01 01:13:38,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:13:38,692 INFO L130 PetriNetUnfolder]: 1441/1985 cut-off events. [2023-09-01 01:13:38,692 INFO L131 PetriNetUnfolder]: For 8603/8603 co-relation queries the response was YES. [2023-09-01 01:13:38,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9491 conditions, 1985 events. 1441/1985 cut-off events. For 8603/8603 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 7363 event pairs, 61 based on Foata normal form. 34/2019 useless extension candidates. Maximal degree in co-relation 9471. Up to 818 conditions per place. [2023-09-01 01:13:38,701 INFO L137 encePairwiseOnDemand]: 268/273 looper letters, 114 selfloop transitions, 9 changer transitions 4/127 dead transitions. [2023-09-01 01:13:38,701 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 127 transitions, 1146 flow [2023-09-01 01:13:38,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 01:13:38,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 01:13:38,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 655 transitions. [2023-09-01 01:13:38,704 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47985347985347987 [2023-09-01 01:13:38,704 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 655 transitions. [2023-09-01 01:13:38,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 655 transitions. [2023-09-01 01:13:38,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:13:38,704 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 655 transitions. [2023-09-01 01:13:38,705 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 131.0) internal successors, (655), 5 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:38,707 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:38,707 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:38,707 INFO L175 Difference]: Start difference. First operand has 69 places, 51 transitions, 369 flow. Second operand 5 states and 655 transitions. [2023-09-01 01:13:38,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 127 transitions, 1146 flow [2023-09-01 01:13:38,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 127 transitions, 1089 flow, removed 24 selfloop flow, removed 1 redundant places. [2023-09-01 01:13:38,714 INFO L231 Difference]: Finished difference. Result has 73 places, 50 transitions, 367 flow [2023-09-01 01:13:38,714 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=367, PETRI_PLACES=73, PETRI_TRANSITIONS=50} [2023-09-01 01:13:38,714 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 22 predicate places. [2023-09-01 01:13:38,715 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 50 transitions, 367 flow [2023-09-01 01:13:38,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:38,715 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:13:38,715 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 01:13:38,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-09-01 01:13:38,715 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 01:13:38,716 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:13:38,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1772330553, now seen corresponding path program 2 times [2023-09-01 01:13:38,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:13:38,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315956454] [2023-09-01 01:13:38,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:13:38,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:13:38,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:13:38,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:13:38,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:13:38,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315956454] [2023-09-01 01:13:38,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315956454] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 01:13:38,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908349412] [2023-09-01 01:13:38,824 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-01 01:13:38,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 01:13:38,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 01:13:38,825 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 01:13:38,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-09-01 01:13:38,908 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-01 01:13:38,908 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 01:13:38,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 7 conjunts are in the unsatisfiable core [2023-09-01 01:13:38,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 01:13:38,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:13:38,982 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 01:13:39,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:13:39,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908349412] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 01:13:39,022 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 01:13:39,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-09-01 01:13:39,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770694126] [2023-09-01 01:13:39,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 01:13:39,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 01:13:39,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:13:39,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 01:13:39,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-09-01 01:13:39,071 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 273 [2023-09-01 01:13:39,072 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 50 transitions, 367 flow. Second operand has 6 states, 6 states have (on average 122.0) internal successors, (732), 6 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:39,072 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:13:39,072 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 273 [2023-09-01 01:13:39,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:13:39,307 INFO L130 PetriNetUnfolder]: 1657/2269 cut-off events. [2023-09-01 01:13:39,307 INFO L131 PetriNetUnfolder]: For 8079/8079 co-relation queries the response was YES. [2023-09-01 01:13:39,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10979 conditions, 2269 events. 1657/2269 cut-off events. For 8079/8079 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 8115 event pairs, 481 based on Foata normal form. 68/2337 useless extension candidates. Maximal degree in co-relation 10958. Up to 1331 conditions per place. [2023-09-01 01:13:39,319 INFO L137 encePairwiseOnDemand]: 268/273 looper letters, 117 selfloop transitions, 8 changer transitions 0/125 dead transitions. [2023-09-01 01:13:39,319 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 125 transitions, 1114 flow [2023-09-01 01:13:39,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 01:13:39,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 01:13:39,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 652 transitions. [2023-09-01 01:13:39,321 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4776556776556777 [2023-09-01 01:13:39,321 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 652 transitions. [2023-09-01 01:13:39,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 652 transitions. [2023-09-01 01:13:39,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:13:39,322 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 652 transitions. [2023-09-01 01:13:39,323 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.4) internal successors, (652), 5 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:39,324 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:39,324 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:39,324 INFO L175 Difference]: Start difference. First operand has 73 places, 50 transitions, 367 flow. Second operand 5 states and 652 transitions. [2023-09-01 01:13:39,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 125 transitions, 1114 flow [2023-09-01 01:13:39,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 125 transitions, 1105 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-09-01 01:13:39,331 INFO L231 Difference]: Finished difference. Result has 78 places, 53 transitions, 408 flow [2023-09-01 01:13:39,331 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=408, PETRI_PLACES=78, PETRI_TRANSITIONS=53} [2023-09-01 01:13:39,332 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 27 predicate places. [2023-09-01 01:13:39,332 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 53 transitions, 408 flow [2023-09-01 01:13:39,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.0) internal successors, (732), 6 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:39,333 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:13:39,333 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 01:13:39,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-09-01 01:13:39,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-09-01 01:13:39,538 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 01:13:39,538 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:13:39,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1296094535, now seen corresponding path program 1 times [2023-09-01 01:13:39,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:13:39,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191161884] [2023-09-01 01:13:39,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:13:39,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:13:39,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:13:39,910 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:13:39,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:13:39,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191161884] [2023-09-01 01:13:39,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191161884] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 01:13:39,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741607532] [2023-09-01 01:13:39,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:13:39,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 01:13:39,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 01:13:39,912 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 01:13:39,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-09-01 01:13:40,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:13:40,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 17 conjunts are in the unsatisfiable core [2023-09-01 01:13:40,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 01:14:02,966 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:14:02,966 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 01:14:17,737 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:14:17,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741607532] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 01:14:17,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 01:14:17,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2023-09-01 01:14:17,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020763618] [2023-09-01 01:14:17,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 01:14:17,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-09-01 01:14:17,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:14:17,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-09-01 01:14:17,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=167, Unknown=13, NotChecked=0, Total=240 [2023-09-01 01:14:19,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:14:22,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:14:26,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:14:28,635 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:14:30,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:14:32,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:14:32,972 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 273 [2023-09-01 01:14:32,973 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 53 transitions, 408 flow. Second operand has 16 states, 16 states have (on average 107.8125) internal successors, (1725), 16 states have internal predecessors, (1725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:14:32,973 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:14:32,973 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 273 [2023-09-01 01:14:32,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:14:35,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:15:14,359 WARN L222 SmtUtils]: Spent 33.73s on a formula simplification. DAG size of input: 70 DAG size of output: 57 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 01:15:16,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:15:18,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:15:36,001 WARN L222 SmtUtils]: Spent 14.81s on a formula simplification. DAG size of input: 69 DAG size of output: 54 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 01:15:41,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:15:47,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:15:49,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:15:52,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:15:54,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:15:56,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:15:58,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:16:00,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:16:03,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:16:05,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:16:06,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:16:09,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:16:12,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:16:15,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:16:17,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:16:19,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:16:22,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:16:25,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:16:29,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:16:30,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:16:33,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:16:35,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:16:37,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:16:39,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:16:42,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:16:43,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:16:46,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:16:48,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:16:52,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:16:53,558 INFO L130 PetriNetUnfolder]: 2361/3279 cut-off events. [2023-09-01 01:16:53,558 INFO L131 PetriNetUnfolder]: For 10995/10995 co-relation queries the response was YES. [2023-09-01 01:16:53,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16372 conditions, 3279 events. 2361/3279 cut-off events. For 10995/10995 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 13319 event pairs, 205 based on Foata normal form. 24/3303 useless extension candidates. Maximal degree in co-relation 16348. Up to 2153 conditions per place. [2023-09-01 01:16:53,580 INFO L137 encePairwiseOnDemand]: 265/273 looper letters, 167 selfloop transitions, 44 changer transitions 17/228 dead transitions. [2023-09-01 01:16:53,580 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 228 transitions, 1816 flow [2023-09-01 01:16:53,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-09-01 01:16:53,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-09-01 01:16:53,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1318 transitions. [2023-09-01 01:16:53,583 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4388944388944389 [2023-09-01 01:16:53,583 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1318 transitions. [2023-09-01 01:16:53,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1318 transitions. [2023-09-01 01:16:53,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:16:53,584 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1318 transitions. [2023-09-01 01:16:53,586 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 119.81818181818181) internal successors, (1318), 11 states have internal predecessors, (1318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:16:53,589 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 273.0) internal successors, (3276), 12 states have internal predecessors, (3276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:16:53,589 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 273.0) internal successors, (3276), 12 states have internal predecessors, (3276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:16:53,589 INFO L175 Difference]: Start difference. First operand has 78 places, 53 transitions, 408 flow. Second operand 11 states and 1318 transitions. [2023-09-01 01:16:53,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 228 transitions, 1816 flow [2023-09-01 01:16:53,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 228 transitions, 1770 flow, removed 18 selfloop flow, removed 2 redundant places. [2023-09-01 01:16:53,603 INFO L231 Difference]: Finished difference. Result has 93 places, 92 transitions, 933 flow [2023-09-01 01:16:53,603 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=933, PETRI_PLACES=93, PETRI_TRANSITIONS=92} [2023-09-01 01:16:53,604 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 42 predicate places. [2023-09-01 01:16:53,604 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 92 transitions, 933 flow [2023-09-01 01:16:53,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 107.8125) internal successors, (1725), 16 states have internal predecessors, (1725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:16:53,605 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:16:53,605 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 01:16:53,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-09-01 01:16:53,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 01:16:53,811 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 01:16:53,811 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:16:53,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1939873210, now seen corresponding path program 1 times [2023-09-01 01:16:53,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:16:53,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902479518] [2023-09-01 01:16:53,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:16:53,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:16:53,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:16:54,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:16:54,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:16:54,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902479518] [2023-09-01 01:16:54,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902479518] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 01:16:54,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526332492] [2023-09-01 01:16:54,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:16:54,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 01:16:54,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 01:16:54,185 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 01:16:54,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-09-01 01:16:54,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:16:54,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 17 conjunts are in the unsatisfiable core [2023-09-01 01:16:54,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 01:17:02,831 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:17:02,831 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 01:17:09,727 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:17:09,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526332492] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 01:17:09,727 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 01:17:09,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2023-09-01 01:17:09,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356612537] [2023-09-01 01:17:09,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 01:17:09,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-09-01 01:17:09,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:17:09,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-09-01 01:17:09,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=167, Unknown=3, NotChecked=0, Total=240 [2023-09-01 01:17:10,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:17:13,225 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:17:15,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:17:19,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:17:20,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:17:23,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:17:26,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:17:29,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:17:29,581 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 273 [2023-09-01 01:17:29,583 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 92 transitions, 933 flow. Second operand has 16 states, 16 states have (on average 108.0625) internal successors, (1729), 16 states have internal predecessors, (1729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:17:29,583 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:17:29,583 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 273 [2023-09-01 01:17:29,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:17:31,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:17:36,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:17:39,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:17:41,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:17:43,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:17:49,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:17:52,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:17:55,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:17:59,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:18:05,268 INFO L130 PetriNetUnfolder]: 3765/5241 cut-off events. [2023-09-01 01:18:05,268 INFO L131 PetriNetUnfolder]: For 22597/22597 co-relation queries the response was YES. [2023-09-01 01:18:05,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29048 conditions, 5241 events. 3765/5241 cut-off events. For 22597/22597 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 23356 event pairs, 305 based on Foata normal form. 19/5260 useless extension candidates. Maximal degree in co-relation 29017. Up to 3319 conditions per place. [2023-09-01 01:18:05,296 INFO L137 encePairwiseOnDemand]: 258/273 looper letters, 244 selfloop transitions, 95 changer transitions 28/367 dead transitions. [2023-09-01 01:18:05,297 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 367 transitions, 3438 flow [2023-09-01 01:18:05,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-09-01 01:18:05,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-09-01 01:18:05,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2017 transitions. [2023-09-01 01:18:05,302 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4346046110751993 [2023-09-01 01:18:05,302 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2017 transitions. [2023-09-01 01:18:05,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2017 transitions. [2023-09-01 01:18:05,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:18:05,303 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2017 transitions. [2023-09-01 01:18:05,305 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 118.6470588235294) internal successors, (2017), 17 states have internal predecessors, (2017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:18:05,309 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 273.0) internal successors, (4914), 18 states have internal predecessors, (4914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:18:05,310 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 273.0) internal successors, (4914), 18 states have internal predecessors, (4914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:18:05,310 INFO L175 Difference]: Start difference. First operand has 93 places, 92 transitions, 933 flow. Second operand 17 states and 2017 transitions. [2023-09-01 01:18:05,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 367 transitions, 3438 flow [2023-09-01 01:18:05,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 367 transitions, 3379 flow, removed 27 selfloop flow, removed 1 redundant places. [2023-09-01 01:18:05,352 INFO L231 Difference]: Finished difference. Result has 119 places, 185 transitions, 2194 flow [2023-09-01 01:18:05,352 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=874, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=2194, PETRI_PLACES=119, PETRI_TRANSITIONS=185} [2023-09-01 01:18:05,352 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 68 predicate places. [2023-09-01 01:18:05,352 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 185 transitions, 2194 flow [2023-09-01 01:18:05,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 108.0625) internal successors, (1729), 16 states have internal predecessors, (1729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:18:05,353 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:18:05,353 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 01:18:05,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-09-01 01:18:05,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 01:18:05,565 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 01:18:05,566 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:18:05,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1059591424, now seen corresponding path program 2 times [2023-09-01 01:18:05,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:18:05,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049161209] [2023-09-01 01:18:05,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:18:05,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:18:05,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:18:05,927 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:18:05,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:18:05,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049161209] [2023-09-01 01:18:05,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049161209] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 01:18:05,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671534107] [2023-09-01 01:18:05,927 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-01 01:18:05,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 01:18:05,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 01:18:05,929 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 01:18:05,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-09-01 01:18:06,161 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-01 01:18:06,162 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 01:18:06,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 17 conjunts are in the unsatisfiable core [2023-09-01 01:18:06,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 01:18:16,108 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:18:16,109 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 01:18:19,049 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:18:19,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671534107] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 01:18:19,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 01:18:19,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2023-09-01 01:18:19,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498911645] [2023-09-01 01:18:19,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 01:18:19,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-09-01 01:18:19,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:18:19,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-09-01 01:18:19,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=154, Unknown=1, NotChecked=0, Total=240 [2023-09-01 01:18:20,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:18:24,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:18:27,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:18:27,643 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 273 [2023-09-01 01:18:27,644 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 185 transitions, 2194 flow. Second operand has 16 states, 16 states have (on average 108.0625) internal successors, (1729), 16 states have internal predecessors, (1729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:18:27,644 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:18:27,644 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 273 [2023-09-01 01:18:27,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:18:29,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:18:32,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:18:35,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:18:38,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:18:40,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:18:42,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:18:44,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:18:46,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:18:48,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:18:51,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:18:53,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:19:03,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:19:03,935 INFO L130 PetriNetUnfolder]: 4911/6845 cut-off events. [2023-09-01 01:19:03,935 INFO L131 PetriNetUnfolder]: For 49194/49194 co-relation queries the response was YES. [2023-09-01 01:19:03,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45542 conditions, 6845 events. 4911/6845 cut-off events. For 49194/49194 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 31998 event pairs, 279 based on Foata normal form. 32/6877 useless extension candidates. Maximal degree in co-relation 45499. Up to 4849 conditions per place. [2023-09-01 01:19:04,016 INFO L137 encePairwiseOnDemand]: 265/273 looper letters, 302 selfloop transitions, 111 changer transitions 17/430 dead transitions. [2023-09-01 01:19:04,016 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 430 transitions, 5174 flow [2023-09-01 01:19:04,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-09-01 01:19:04,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-09-01 01:19:04,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1550 transitions. [2023-09-01 01:19:04,032 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4367427444350521 [2023-09-01 01:19:04,033 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1550 transitions. [2023-09-01 01:19:04,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1550 transitions. [2023-09-01 01:19:04,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:19:04,034 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1550 transitions. [2023-09-01 01:19:04,037 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 119.23076923076923) internal successors, (1550), 13 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:19:04,040 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 273.0) internal successors, (3822), 14 states have internal predecessors, (3822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:19:04,040 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 273.0) internal successors, (3822), 14 states have internal predecessors, (3822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:19:04,040 INFO L175 Difference]: Start difference. First operand has 119 places, 185 transitions, 2194 flow. Second operand 13 states and 1550 transitions. [2023-09-01 01:19:04,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 430 transitions, 5174 flow [2023-09-01 01:19:04,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 430 transitions, 4767 flow, removed 201 selfloop flow, removed 1 redundant places. [2023-09-01 01:19:04,354 INFO L231 Difference]: Finished difference. Result has 138 places, 266 transitions, 3275 flow [2023-09-01 01:19:04,354 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=1821, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3275, PETRI_PLACES=138, PETRI_TRANSITIONS=266} [2023-09-01 01:19:04,355 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 87 predicate places. [2023-09-01 01:19:04,355 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 266 transitions, 3275 flow [2023-09-01 01:19:04,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 108.0625) internal successors, (1729), 16 states have internal predecessors, (1729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:19:04,355 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:19:04,355 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 01:19:04,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-09-01 01:19:04,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 01:19:04,561 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 01:19:04,561 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:19:04,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1412101817, now seen corresponding path program 2 times [2023-09-01 01:19:04,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:19:04,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849303925] [2023-09-01 01:19:04,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:19:04,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:19:04,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:19:05,923 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:19:05,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:19:05,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849303925] [2023-09-01 01:19:05,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849303925] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 01:19:05,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432131472] [2023-09-01 01:19:05,923 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-01 01:19:05,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 01:19:05,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 01:19:05,925 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 01:19:05,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-09-01 01:19:06,164 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-01 01:19:06,164 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 01:19:06,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 18 conjunts are in the unsatisfiable core [2023-09-01 01:19:06,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 01:19:26,483 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:19:26,483 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 01:20:43,965 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:20:43,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432131472] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 01:20:43,966 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 01:20:43,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2023-09-01 01:20:43,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884501065] [2023-09-01 01:20:43,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 01:20:43,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-09-01 01:20:43,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:20:43,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-09-01 01:20:43,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=160, Unknown=16, NotChecked=0, Total=240 [2023-09-01 01:20:45,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:20:47,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:20:50,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:20:52,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:20:54,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:20:54,805 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 273 [2023-09-01 01:20:54,806 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 266 transitions, 3275 flow. Second operand has 16 states, 16 states have (on average 107.8125) internal successors, (1725), 16 states have internal predecessors, (1725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:20:54,806 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:20:54,806 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 273 [2023-09-01 01:20:54,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:20:56,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:20:59,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:21:06,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:21:07,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:21:09,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:21:20,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:21:22,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:21:24,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:21:26,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:22:01,026 WARN L222 SmtUtils]: Spent 28.23s on a formula simplification. DAG size of input: 83 DAG size of output: 24 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 01:22:03,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:22:05,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:22:07,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:22:09,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:22:11,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:22:13,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:22:16,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:22:18,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:22:20,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:22:48,791 WARN L222 SmtUtils]: Spent 23.48s on a formula simplification. DAG size of input: 95 DAG size of output: 30 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 01:22:50,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:22:53,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:22:55,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:22:57,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:23:07,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:23:10,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:23:12,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:23:14,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:23:19,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:23:21,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:23:53,039 WARN L222 SmtUtils]: Spent 14.95s on a formula simplification. DAG size of input: 54 DAG size of output: 28 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 01:23:55,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:23:57,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:23:59,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:24:01,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:24:04,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:24:06,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:24:08,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:24:10,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:24:12,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:24:14,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:24:16,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:24:17,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:24:19,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:24:25,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:24:28,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:24:30,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:24:32,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:24:34,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:24:36,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:24:38,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:24:40,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:24:42,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:24:44,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:24:47,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:24:49,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:24:51,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:24:53,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:24:56,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:24:57,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:24:59,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:25:02,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:25:04,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:25:07,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:25:09,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:25:12,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:25:14,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:25:16,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:25:18,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:25:21,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:25:23,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:25:25,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:25:28,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:25:30,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:25:32,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:25:34,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:25:37,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:25:39,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:25:44,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:25:46,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:25:48,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:25:51,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:25:52,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:25:55,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:25:57,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:25:59,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:25:59,460 INFO L130 PetriNetUnfolder]: 7757/10948 cut-off events. [2023-09-01 01:25:59,461 INFO L131 PetriNetUnfolder]: For 123611/123611 co-relation queries the response was YES. [2023-09-01 01:25:59,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75761 conditions, 10948 events. 7757/10948 cut-off events. For 123611/123611 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 57073 event pairs, 167 based on Foata normal form. 41/10989 useless extension candidates. Maximal degree in co-relation 75709. Up to 6081 conditions per place. [2023-09-01 01:25:59,549 INFO L137 encePairwiseOnDemand]: 258/273 looper letters, 431 selfloop transitions, 200 changer transitions 36/667 dead transitions. [2023-09-01 01:25:59,549 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 667 transitions, 8206 flow [2023-09-01 01:25:59,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-09-01 01:25:59,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-09-01 01:25:59,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2246 transitions. [2023-09-01 01:25:59,553 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43300559090032775 [2023-09-01 01:25:59,553 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2246 transitions. [2023-09-01 01:25:59,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2246 transitions. [2023-09-01 01:25:59,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:25:59,554 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2246 transitions. [2023-09-01 01:25:59,556 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 118.21052631578948) internal successors, (2246), 19 states have internal predecessors, (2246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:25:59,577 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 273.0) internal successors, (5460), 20 states have internal predecessors, (5460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:25:59,578 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 273.0) internal successors, (5460), 20 states have internal predecessors, (5460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:25:59,578 INFO L175 Difference]: Start difference. First operand has 138 places, 266 transitions, 3275 flow. Second operand 19 states and 2246 transitions. [2023-09-01 01:25:59,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 667 transitions, 8206 flow [2023-09-01 01:26:00,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 667 transitions, 7589 flow, removed 305 selfloop flow, removed 1 redundant places. [2023-09-01 01:26:00,163 INFO L231 Difference]: Finished difference. Result has 167 places, 430 transitions, 5750 flow [2023-09-01 01:26:00,163 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=2926, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=5750, PETRI_PLACES=167, PETRI_TRANSITIONS=430} [2023-09-01 01:26:00,163 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 116 predicate places. [2023-09-01 01:26:00,164 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 430 transitions, 5750 flow [2023-09-01 01:26:00,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 107.8125) internal successors, (1725), 16 states have internal predecessors, (1725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:26:00,164 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:26:00,164 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 01:26:00,179 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-09-01 01:26:00,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-09-01 01:26:00,369 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 01:26:00,369 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:26:00,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1299470521, now seen corresponding path program 3 times [2023-09-01 01:26:00,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:26:00,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191595920] [2023-09-01 01:26:00,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:26:00,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:26:00,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:26:00,492 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:26:00,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:26:00,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191595920] [2023-09-01 01:26:00,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191595920] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 01:26:00,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1179641180] [2023-09-01 01:26:00,493 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-09-01 01:26:00,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 01:26:00,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 01:26:00,494 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 01:26:00,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-09-01 01:26:18,109 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-09-01 01:26:18,109 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 01:26:18,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 21 conjunts are in the unsatisfiable core [2023-09-01 01:26:18,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 01:26:27,416 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:26:27,416 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 01:27:00,602 WARN L222 SmtUtils]: Spent 13.06s on a formula simplification. DAG size of input: 1023 DAG size of output: 1016 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) Killed by 15