./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/weaver/mult-dist.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/mult-dist.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 c22a326532494b0b5126a81d8882f3e958ed0a5a46e6da0f77df1a4da18ba846 --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 02:02:49,639 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 02:02:49,641 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 02:02:49,685 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 02:02:49,687 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 02:02:49,690 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 02:02:49,692 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 02:02:49,694 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 02:02:49,696 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 02:02:49,700 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 02:02:49,701 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 02:02:49,704 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 02:02:49,704 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 02:02:49,706 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 02:02:49,707 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 02:02:49,713 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 02:02:49,714 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 02:02:49,715 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 02:02:49,717 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 02:02:49,719 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 02:02:49,723 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 02:02:49,736 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 02:02:49,737 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 02:02:49,738 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 02:02:49,748 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 02:02:49,749 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 02:02:49,750 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 02:02:49,751 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 02:02:49,752 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 02:02:49,752 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 02:02:49,753 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 02:02:49,758 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 02:02:49,759 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 02:02:49,760 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 02:02:49,761 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 02:02:49,762 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 02:02:49,762 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 02:02:49,762 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 02:02:49,763 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 02:02:49,763 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 02:02:49,764 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 02:02:49,765 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-09-01 02:02:49,799 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 02:02:49,799 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 02:02:49,800 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 02:02:49,800 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 02:02:49,801 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 02:02:49,801 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 02:02:49,802 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 02:02:49,802 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 02:02:49,802 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 02:02:49,802 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 02:02:49,803 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 02:02:49,804 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-09-01 02:02:49,804 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 02:02:49,804 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 02:02:49,804 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 02:02:49,804 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-09-01 02:02:49,804 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-09-01 02:02:49,805 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-09-01 02:02:49,805 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 02:02:49,805 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-09-01 02:02:49,805 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 02:02:49,805 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 02:02:49,806 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 02:02:49,806 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 02:02:49,806 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 02:02:49,806 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 02:02:49,806 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 02:02:49,807 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 02:02:49,807 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-01 02:02:49,807 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-01 02:02:49,807 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 02:02:49,807 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 02:02:49,808 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 02:02:49,808 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 02:02:49,808 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 -> c22a326532494b0b5126a81d8882f3e958ed0a5a46e6da0f77df1a4da18ba846 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 02:02:50,094 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 02:02:50,110 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 02:02:50,112 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 02:02:50,113 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 02:02:50,113 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 02:02:50,114 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/mult-dist.wvr.c [2023-09-01 02:02:51,347 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 02:02:51,576 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 02:02:51,577 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/mult-dist.wvr.c [2023-09-01 02:02:51,583 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e55e89116/50dc42028a9e4a078f05cb6d0c85af71/FLAGa2fd716ec [2023-09-01 02:02:51,606 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e55e89116/50dc42028a9e4a078f05cb6d0c85af71 [2023-09-01 02:02:51,608 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 02:02:51,609 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 02:02:51,611 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 02:02:51,612 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 02:02:51,615 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 02:02:51,615 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 02:02:51" (1/1) ... [2023-09-01 02:02:51,616 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63cbb21e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:02:51, skipping insertion in model container [2023-09-01 02:02:51,616 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 02:02:51" (1/1) ... [2023-09-01 02:02:51,622 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 02:02:51,640 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 02:02:51,808 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/mult-dist.wvr.c[2116,2129] [2023-09-01 02:02:51,816 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 02:02:51,827 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 02:02:51,858 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/mult-dist.wvr.c[2116,2129] [2023-09-01 02:02:51,864 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 02:02:51,876 INFO L208 MainTranslator]: Completed translation [2023-09-01 02:02:51,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:02:51 WrapperNode [2023-09-01 02:02:51,878 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 02:02:51,879 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 02:02:51,879 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 02:02:51,879 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 02:02:51,885 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:02:51" (1/1) ... [2023-09-01 02:02:51,899 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:02:51" (1/1) ... [2023-09-01 02:02:51,923 INFO L138 Inliner]: procedures = 22, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 73 [2023-09-01 02:02:51,924 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 02:02:51,925 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 02:02:51,925 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 02:02:51,925 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 02:02:51,933 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:02:51" (1/1) ... [2023-09-01 02:02:51,934 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:02:51" (1/1) ... [2023-09-01 02:02:51,938 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:02:51" (1/1) ... [2023-09-01 02:02:51,939 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:02:51" (1/1) ... [2023-09-01 02:02:51,943 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:02:51" (1/1) ... [2023-09-01 02:02:51,946 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:02:51" (1/1) ... [2023-09-01 02:02:51,950 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:02:51" (1/1) ... [2023-09-01 02:02:51,954 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:02:51" (1/1) ... [2023-09-01 02:02:51,957 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 02:02:51,960 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 02:02:51,960 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 02:02:51,960 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 02:02:51,961 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:02:51" (1/1) ... [2023-09-01 02:02:51,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 02:02:51,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 02:02:51,990 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 02:02:52,019 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 02:02:52,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 02:02:52,032 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-09-01 02:02:52,032 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-09-01 02:02:52,033 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-09-01 02:02:52,033 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-09-01 02:02:52,033 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-09-01 02:02:52,033 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-09-01 02:02:52,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-01 02:02:52,034 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 02:02:52,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-01 02:02:52,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 02:02:52,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 02:02:52,034 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-01 02:02:52,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 02:02:52,036 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 02:02:52,120 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 02:02:52,121 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 02:02:52,336 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 02:02:52,344 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 02:02:52,344 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-09-01 02:02:52,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 02:02:52 BoogieIcfgContainer [2023-09-01 02:02:52,346 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 02:02:52,362 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 02:02:52,363 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 02:02:52,369 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 02:02:52,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 02:02:51" (1/3) ... [2023-09-01 02:02:52,370 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cf4ef1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 02:02:52, skipping insertion in model container [2023-09-01 02:02:52,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:02:51" (2/3) ... [2023-09-01 02:02:52,370 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cf4ef1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 02:02:52, skipping insertion in model container [2023-09-01 02:02:52,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 02:02:52" (3/3) ... [2023-09-01 02:02:52,381 INFO L112 eAbstractionObserver]: Analyzing ICFG mult-dist.wvr.c [2023-09-01 02:02:52,395 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 02:02:52,395 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2023-09-01 02:02:52,396 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 02:02:52,515 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-09-01 02:02:52,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 121 transitions, 266 flow [2023-09-01 02:02:52,633 INFO L130 PetriNetUnfolder]: 7/118 cut-off events. [2023-09-01 02:02:52,635 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-09-01 02:02:52,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 118 events. 7/118 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 110 event pairs, 0 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2023-09-01 02:02:52,640 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 121 transitions, 266 flow [2023-09-01 02:02:52,647 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 114 transitions, 246 flow [2023-09-01 02:02:52,650 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 02:02:52,661 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 114 transitions, 246 flow [2023-09-01 02:02:52,667 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 114 transitions, 246 flow [2023-09-01 02:02:52,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 114 transitions, 246 flow [2023-09-01 02:02:52,722 INFO L130 PetriNetUnfolder]: 7/114 cut-off events. [2023-09-01 02:02:52,723 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-09-01 02:02:52,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 114 events. 7/114 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 111 event pairs, 0 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2023-09-01 02:02:52,725 INFO L119 LiptonReduction]: Number of co-enabled transitions 1680 [2023-09-01 02:02:56,060 INFO L134 LiptonReduction]: Checked pairs total: 1766 [2023-09-01 02:02:56,061 INFO L136 LiptonReduction]: Total number of compositions: 111 [2023-09-01 02:02:56,072 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 02:02:56,077 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;@3390b89a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 02:02:56,077 INFO L358 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2023-09-01 02:02:56,078 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-09-01 02:02:56,078 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 02:02:56,078 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:02:56,079 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-09-01 02:02:56,079 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:02:56,083 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:02:56,083 INFO L85 PathProgramCache]: Analyzing trace with hash 449, now seen corresponding path program 1 times [2023-09-01 02:02:56,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:02:56,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333137254] [2023-09-01 02:02:56,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:02:56,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:02:56,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:02:56,159 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 02:02:56,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:02:56,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333137254] [2023-09-01 02:02:56,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333137254] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:02:56,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:02:56,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-09-01 02:02:56,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278373904] [2023-09-01 02:02:56,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:02:56,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-09-01 02:02:56,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:02:56,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-09-01 02:02:56,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-09-01 02:02:56,190 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 232 [2023-09-01 02:02:56,192 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 88 flow. Second operand has 2 states, 2 states have (on average 110.5) internal successors, (221), 2 states have internal predecessors, (221), 0 states have call successors, (0), 0 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 02:02:56,192 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:02:56,192 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 232 [2023-09-01 02:02:56,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:02:56,293 INFO L130 PetriNetUnfolder]: 556/763 cut-off events. [2023-09-01 02:02:56,294 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2023-09-01 02:02:56,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1558 conditions, 763 events. 556/763 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 2742 event pairs, 252 based on Foata normal form. 0/352 useless extension candidates. Maximal degree in co-relation 1210. Up to 752 conditions per place. [2023-09-01 02:02:56,301 INFO L137 encePairwiseOnDemand]: 229/232 looper letters, 29 selfloop transitions, 0 changer transitions 0/32 dead transitions. [2023-09-01 02:02:56,301 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 32 transitions, 140 flow [2023-09-01 02:02:56,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-01 02:02:56,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-09-01 02:02:56,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 252 transitions. [2023-09-01 02:02:56,312 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5431034482758621 [2023-09-01 02:02:56,313 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 252 transitions. [2023-09-01 02:02:56,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 252 transitions. [2023-09-01 02:02:56,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:02:56,316 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 252 transitions. [2023-09-01 02:02:56,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 126.0) internal successors, (252), 2 states have internal predecessors, (252), 0 states have call successors, (0), 0 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 02:02:56,322 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:02:56,323 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:02:56,324 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 88 flow. Second operand 2 states and 252 transitions. [2023-09-01 02:02:56,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 32 transitions, 140 flow [2023-09-01 02:02:56,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 32 transitions, 128 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-09-01 02:02:56,328 INFO L231 Difference]: Finished difference. Result has 34 places, 32 transitions, 70 flow [2023-09-01 02:02:56,330 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=70, PETRI_PLACES=34, PETRI_TRANSITIONS=32} [2023-09-01 02:02:56,332 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -8 predicate places. [2023-09-01 02:02:56,333 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 32 transitions, 70 flow [2023-09-01 02:02:56,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 110.5) internal successors, (221), 2 states have internal predecessors, (221), 0 states have call successors, (0), 0 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 02:02:56,333 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:02:56,333 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-09-01 02:02:56,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-01 02:02:56,334 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:02:56,334 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:02:56,334 INFO L85 PathProgramCache]: Analyzing trace with hash 440291, now seen corresponding path program 1 times [2023-09-01 02:02:56,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:02:56,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621386681] [2023-09-01 02:02:56,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:02:56,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:02:56,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:02:56,579 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 02:02:56,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:02:56,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621386681] [2023-09-01 02:02:56,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621386681] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:02:56,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:02:56,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 02:02:56,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711106361] [2023-09-01 02:02:56,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:02:56,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 02:02:56,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:02:56,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 02:02:56,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 02:02:56,632 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 232 [2023-09-01 02:02:56,633 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 32 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 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 02:02:56,633 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:02:56,633 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 232 [2023-09-01 02:02:56,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:02:56,711 INFO L130 PetriNetUnfolder]: 529/724 cut-off events. [2023-09-01 02:02:56,711 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-09-01 02:02:56,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1452 conditions, 724 events. 529/724 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2568 event pairs, 239 based on Foata normal form. 0/339 useless extension candidates. Maximal degree in co-relation 1449. Up to 712 conditions per place. [2023-09-01 02:02:56,716 INFO L137 encePairwiseOnDemand]: 229/232 looper letters, 26 selfloop transitions, 1 changer transitions 0/30 dead transitions. [2023-09-01 02:02:56,716 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 30 transitions, 120 flow [2023-09-01 02:02:56,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 02:02:56,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 02:02:56,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 329 transitions. [2023-09-01 02:02:56,718 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47270114942528735 [2023-09-01 02:02:56,719 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 329 transitions. [2023-09-01 02:02:56,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 329 transitions. [2023-09-01 02:02:56,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:02:56,719 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 329 transitions. [2023-09-01 02:02:56,721 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 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 02:02:56,722 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 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 02:02:56,723 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 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 02:02:56,723 INFO L175 Difference]: Start difference. First operand has 34 places, 32 transitions, 70 flow. Second operand 3 states and 329 transitions. [2023-09-01 02:02:56,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 30 transitions, 120 flow [2023-09-01 02:02:56,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 30 transitions, 120 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-09-01 02:02:56,724 INFO L231 Difference]: Finished difference. Result has 34 places, 30 transitions, 68 flow [2023-09-01 02:02:56,725 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=34, PETRI_TRANSITIONS=30} [2023-09-01 02:02:56,725 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -8 predicate places. [2023-09-01 02:02:56,725 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 30 transitions, 68 flow [2023-09-01 02:02:56,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 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 02:02:56,726 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:02:56,726 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-09-01 02:02:56,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-01 02:02:56,726 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:02:56,727 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:02:56,727 INFO L85 PathProgramCache]: Analyzing trace with hash 440290, now seen corresponding path program 1 times [2023-09-01 02:02:56,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:02:56,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756640528] [2023-09-01 02:02:56,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:02:56,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:02:56,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:02:56,873 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 02:02:56,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:02:56,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756640528] [2023-09-01 02:02:56,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756640528] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:02:56,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:02:56,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 02:02:56,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412617415] [2023-09-01 02:02:56,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:02:56,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 02:02:56,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:02:56,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 02:02:56,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 02:02:56,910 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 232 [2023-09-01 02:02:56,911 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 30 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:02:56,911 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:02:56,911 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 232 [2023-09-01 02:02:56,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:02:56,973 INFO L130 PetriNetUnfolder]: 502/685 cut-off events. [2023-09-01 02:02:56,973 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-09-01 02:02:56,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1376 conditions, 685 events. 502/685 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2367 event pairs, 226 based on Foata normal form. 0/326 useless extension candidates. Maximal degree in co-relation 1372. Up to 673 conditions per place. [2023-09-01 02:02:56,977 INFO L137 encePairwiseOnDemand]: 229/232 looper letters, 24 selfloop transitions, 1 changer transitions 0/28 dead transitions. [2023-09-01 02:02:56,977 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 28 transitions, 114 flow [2023-09-01 02:02:56,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 02:02:56,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 02:02:56,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 342 transitions. [2023-09-01 02:02:56,979 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49137931034482757 [2023-09-01 02:02:56,979 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 342 transitions. [2023-09-01 02:02:56,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 342 transitions. [2023-09-01 02:02:56,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:02:56,980 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 342 transitions. [2023-09-01 02:02:56,981 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 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 02:02:56,983 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 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 02:02:56,983 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 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 02:02:56,983 INFO L175 Difference]: Start difference. First operand has 34 places, 30 transitions, 68 flow. Second operand 3 states and 342 transitions. [2023-09-01 02:02:56,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 28 transitions, 114 flow [2023-09-01 02:02:56,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 28 transitions, 113 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 02:02:56,985 INFO L231 Difference]: Finished difference. Result has 33 places, 28 transitions, 65 flow [2023-09-01 02:02:56,985 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=65, PETRI_PLACES=33, PETRI_TRANSITIONS=28} [2023-09-01 02:02:56,986 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -9 predicate places. [2023-09-01 02:02:56,986 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 28 transitions, 65 flow [2023-09-01 02:02:56,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:02:56,986 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:02:56,986 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-09-01 02:02:56,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-01 02:02:56,987 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:02:56,987 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:02:56,987 INFO L85 PathProgramCache]: Analyzing trace with hash 423127422, now seen corresponding path program 1 times [2023-09-01 02:02:56,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:02:56,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739136370] [2023-09-01 02:02:56,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:02:56,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:02:56,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:02:57,063 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 02:02:57,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:02:57,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739136370] [2023-09-01 02:02:57,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739136370] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:02:57,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:02:57,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 02:02:57,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904186434] [2023-09-01 02:02:57,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:02:57,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 02:02:57,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:02:57,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 02:02:57,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 02:02:57,095 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 232 [2023-09-01 02:02:57,096 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 28 transitions, 65 flow. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 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 02:02:57,096 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:02:57,096 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 232 [2023-09-01 02:02:57,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:02:57,171 INFO L130 PetriNetUnfolder]: 476/647 cut-off events. [2023-09-01 02:02:57,171 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-09-01 02:02:57,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1301 conditions, 647 events. 476/647 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2206 event pairs, 214 based on Foata normal form. 0/312 useless extension candidates. Maximal degree in co-relation 1297. Up to 635 conditions per place. [2023-09-01 02:02:57,175 INFO L137 encePairwiseOnDemand]: 229/232 looper letters, 22 selfloop transitions, 1 changer transitions 0/26 dead transitions. [2023-09-01 02:02:57,175 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 26 transitions, 107 flow [2023-09-01 02:02:57,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 02:02:57,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 02:02:57,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 328 transitions. [2023-09-01 02:02:57,177 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47126436781609193 [2023-09-01 02:02:57,177 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 328 transitions. [2023-09-01 02:02:57,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 328 transitions. [2023-09-01 02:02:57,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:02:57,178 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 328 transitions. [2023-09-01 02:02:57,179 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 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 02:02:57,180 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 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 02:02:57,181 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 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 02:02:57,181 INFO L175 Difference]: Start difference. First operand has 33 places, 28 transitions, 65 flow. Second operand 3 states and 328 transitions. [2023-09-01 02:02:57,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 26 transitions, 107 flow [2023-09-01 02:02:57,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 26 transitions, 106 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 02:02:57,182 INFO L231 Difference]: Finished difference. Result has 32 places, 26 transitions, 62 flow [2023-09-01 02:02:57,182 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=30, 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=62, PETRI_PLACES=32, PETRI_TRANSITIONS=26} [2023-09-01 02:02:57,183 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -10 predicate places. [2023-09-01 02:02:57,183 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 62 flow [2023-09-01 02:02:57,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 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 02:02:57,184 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:02:57,184 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-09-01 02:02:57,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-09-01 02:02:57,184 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:02:57,185 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:02:57,185 INFO L85 PathProgramCache]: Analyzing trace with hash 423127421, now seen corresponding path program 1 times [2023-09-01 02:02:57,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:02:57,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005524182] [2023-09-01 02:02:57,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:02:57,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:02:57,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:02:57,221 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 02:02:57,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:02:57,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005524182] [2023-09-01 02:02:57,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005524182] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:02:57,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:02:57,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 02:02:57,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027317772] [2023-09-01 02:02:57,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:02:57,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 02:02:57,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:02:57,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 02:02:57,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 02:02:57,256 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 232 [2023-09-01 02:02:57,257 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 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 02:02:57,257 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:02:57,257 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 232 [2023-09-01 02:02:57,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:02:57,316 INFO L130 PetriNetUnfolder]: 450/609 cut-off events. [2023-09-01 02:02:57,316 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-09-01 02:02:57,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1226 conditions, 609 events. 450/609 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2039 event pairs, 202 based on Foata normal form. 0/298 useless extension candidates. Maximal degree in co-relation 1222. Up to 597 conditions per place. [2023-09-01 02:02:57,319 INFO L137 encePairwiseOnDemand]: 229/232 looper letters, 20 selfloop transitions, 1 changer transitions 0/24 dead transitions. [2023-09-01 02:02:57,319 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 24 transitions, 100 flow [2023-09-01 02:02:57,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 02:02:57,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 02:02:57,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 323 transitions. [2023-09-01 02:02:57,322 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4640804597701149 [2023-09-01 02:02:57,322 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 323 transitions. [2023-09-01 02:02:57,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 323 transitions. [2023-09-01 02:02:57,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:02:57,322 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 323 transitions. [2023-09-01 02:02:57,323 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 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 02:02:57,325 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 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 02:02:57,325 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 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 02:02:57,325 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 62 flow. Second operand 3 states and 323 transitions. [2023-09-01 02:02:57,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 24 transitions, 100 flow [2023-09-01 02:02:57,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 24 transitions, 99 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 02:02:57,326 INFO L231 Difference]: Finished difference. Result has 31 places, 24 transitions, 59 flow [2023-09-01 02:02:57,327 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=57, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=59, PETRI_PLACES=31, PETRI_TRANSITIONS=24} [2023-09-01 02:02:57,327 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -11 predicate places. [2023-09-01 02:02:57,327 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 24 transitions, 59 flow [2023-09-01 02:02:57,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 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 02:02:57,328 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:02:57,328 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-09-01 02:02:57,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-09-01 02:02:57,328 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:02:57,329 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:02:57,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1396432710, now seen corresponding path program 1 times [2023-09-01 02:02:57,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:02:57,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653335604] [2023-09-01 02:02:57,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:02:57,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:02:57,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:02:57,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:02:57,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:02:57,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653335604] [2023-09-01 02:02:57,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653335604] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:02:57,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:02:57,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 02:02:57,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688613375] [2023-09-01 02:02:57,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:02:57,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 02:02:57,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:02:57,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 02:02:57,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 02:02:57,390 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 232 [2023-09-01 02:02:57,391 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 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 02:02:57,391 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:02:57,391 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 232 [2023-09-01 02:02:57,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:02:57,449 INFO L130 PetriNetUnfolder]: 351/483 cut-off events. [2023-09-01 02:02:57,449 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-09-01 02:02:57,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 975 conditions, 483 events. 351/483 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1558 event pairs, 157 based on Foata normal form. 0/253 useless extension candidates. Maximal degree in co-relation 971. Up to 471 conditions per place. [2023-09-01 02:02:57,452 INFO L137 encePairwiseOnDemand]: 230/232 looper letters, 19 selfloop transitions, 1 changer transitions 0/23 dead transitions. [2023-09-01 02:02:57,452 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 23 transitions, 97 flow [2023-09-01 02:02:57,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 02:02:57,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 02:02:57,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 324 transitions. [2023-09-01 02:02:57,454 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46551724137931033 [2023-09-01 02:02:57,454 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 324 transitions. [2023-09-01 02:02:57,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 324 transitions. [2023-09-01 02:02:57,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:02:57,455 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 324 transitions. [2023-09-01 02:02:57,456 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 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 02:02:57,457 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 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 02:02:57,457 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 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 02:02:57,458 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 59 flow. Second operand 3 states and 324 transitions. [2023-09-01 02:02:57,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 23 transitions, 97 flow [2023-09-01 02:02:57,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 23 transitions, 96 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 02:02:57,459 INFO L231 Difference]: Finished difference. Result has 31 places, 23 transitions, 58 flow [2023-09-01 02:02:57,459 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=31, PETRI_TRANSITIONS=23} [2023-09-01 02:02:57,461 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -11 predicate places. [2023-09-01 02:02:57,461 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 23 transitions, 58 flow [2023-09-01 02:02:57,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 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 02:02:57,463 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:02:57,463 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-09-01 02:02:57,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-09-01 02:02:57,464 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:02:57,464 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:02:57,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1396432712, now seen corresponding path program 1 times [2023-09-01 02:02:57,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:02:57,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445668557] [2023-09-01 02:02:57,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:02:57,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:02:57,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:02:57,599 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 02:02:57,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:02:57,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445668557] [2023-09-01 02:02:57,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445668557] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:02:57,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:02:57,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 02:02:57,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749752471] [2023-09-01 02:02:57,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:02:57,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 02:02:57,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:02:57,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 02:02:57,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-09-01 02:02:57,690 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 232 [2023-09-01 02:02:57,691 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 23 transitions, 58 flow. Second operand has 5 states, 5 states have (on average 93.4) internal successors, (467), 5 states have internal predecessors, (467), 0 states have call successors, (0), 0 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 02:02:57,691 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:02:57,692 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 232 [2023-09-01 02:02:57,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:02:57,737 INFO L130 PetriNetUnfolder]: 252/357 cut-off events. [2023-09-01 02:02:57,737 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-09-01 02:02:57,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 724 conditions, 357 events. 252/357 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1098 event pairs, 112 based on Foata normal form. 0/208 useless extension candidates. Maximal degree in co-relation 720. Up to 345 conditions per place. [2023-09-01 02:02:57,739 INFO L137 encePairwiseOnDemand]: 230/232 looper letters, 18 selfloop transitions, 1 changer transitions 0/22 dead transitions. [2023-09-01 02:02:57,739 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 22 transitions, 94 flow [2023-09-01 02:02:57,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 02:02:57,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 02:02:57,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 296 transitions. [2023-09-01 02:02:57,741 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42528735632183906 [2023-09-01 02:02:57,741 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 296 transitions. [2023-09-01 02:02:57,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 296 transitions. [2023-09-01 02:02:57,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:02:57,741 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 296 transitions. [2023-09-01 02:02:57,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 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 02:02:57,743 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 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 02:02:57,744 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 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 02:02:57,744 INFO L175 Difference]: Start difference. First operand has 31 places, 23 transitions, 58 flow. Second operand 3 states and 296 transitions. [2023-09-01 02:02:57,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 22 transitions, 94 flow [2023-09-01 02:02:57,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 22 transitions, 93 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 02:02:57,745 INFO L231 Difference]: Finished difference. Result has 31 places, 22 transitions, 57 flow [2023-09-01 02:02:57,745 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=55, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=57, PETRI_PLACES=31, PETRI_TRANSITIONS=22} [2023-09-01 02:02:57,746 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -11 predicate places. [2023-09-01 02:02:57,746 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 22 transitions, 57 flow [2023-09-01 02:02:57,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 93.4) internal successors, (467), 5 states have internal predecessors, (467), 0 states have call successors, (0), 0 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 02:02:57,746 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:02:57,747 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 02:02:57,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-09-01 02:02:57,747 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:02:57,747 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:02:57,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1966083998, now seen corresponding path program 1 times [2023-09-01 02:02:57,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:02:57,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710223352] [2023-09-01 02:02:57,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:02:57,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:02:57,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:02:58,014 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 02:02:58,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:02:58,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710223352] [2023-09-01 02:02:58,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710223352] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:02:58,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:02:58,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 02:02:58,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683942739] [2023-09-01 02:02:58,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:02:58,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 02:02:58,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:02:58,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 02:02:58,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 02:02:58,028 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 232 [2023-09-01 02:02:58,029 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 57 flow. Second operand has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 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 02:02:58,029 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:02:58,029 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 232 [2023-09-01 02:02:58,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:02:58,094 INFO L130 PetriNetUnfolder]: 359/506 cut-off events. [2023-09-01 02:02:58,094 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2023-09-01 02:02:58,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1032 conditions, 506 events. 359/506 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1628 event pairs, 39 based on Foata normal form. 1/306 useless extension candidates. Maximal degree in co-relation 1028. Up to 421 conditions per place. [2023-09-01 02:02:58,097 INFO L137 encePairwiseOnDemand]: 227/232 looper letters, 30 selfloop transitions, 4 changer transitions 1/38 dead transitions. [2023-09-01 02:02:58,097 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 38 transitions, 164 flow [2023-09-01 02:02:58,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 02:02:58,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 02:02:58,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 357 transitions. [2023-09-01 02:02:58,099 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5129310344827587 [2023-09-01 02:02:58,099 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 357 transitions. [2023-09-01 02:02:58,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 357 transitions. [2023-09-01 02:02:58,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:02:58,099 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 357 transitions. [2023-09-01 02:02:58,100 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 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 02:02:58,102 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 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 02:02:58,102 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 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 02:02:58,102 INFO L175 Difference]: Start difference. First operand has 31 places, 22 transitions, 57 flow. Second operand 3 states and 357 transitions. [2023-09-01 02:02:58,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 38 transitions, 164 flow [2023-09-01 02:02:58,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 38 transitions, 163 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 02:02:58,103 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 82 flow [2023-09-01 02:02:58,104 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2023-09-01 02:02:58,104 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -9 predicate places. [2023-09-01 02:02:58,104 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 82 flow [2023-09-01 02:02:58,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 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 02:02:58,105 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:02:58,105 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 02:02:58,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-09-01 02:02:58,105 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:02:58,106 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:02:58,106 INFO L85 PathProgramCache]: Analyzing trace with hash -451109797, now seen corresponding path program 1 times [2023-09-01 02:02:58,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:02:58,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634656223] [2023-09-01 02:02:58,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:02:58,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:02:58,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:02:58,324 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 02:02:58,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:02:58,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634656223] [2023-09-01 02:02:58,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634656223] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:02:58,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:02:58,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-09-01 02:02:58,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959403634] [2023-09-01 02:02:58,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:02:58,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 02:02:58,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:02:58,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 02:02:58,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-09-01 02:02:58,399 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 232 [2023-09-01 02:02:58,400 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 82 flow. Second operand has 7 states, 7 states have (on average 98.85714285714286) internal successors, (692), 7 states have internal predecessors, (692), 0 states have call successors, (0), 0 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 02:02:58,400 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:02:58,400 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 232 [2023-09-01 02:02:58,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:02:58,639 INFO L130 PetriNetUnfolder]: 638/974 cut-off events. [2023-09-01 02:02:58,640 INFO L131 PetriNetUnfolder]: For 190/190 co-relation queries the response was YES. [2023-09-01 02:02:58,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2348 conditions, 974 events. 638/974 cut-off events. For 190/190 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3838 event pairs, 158 based on Foata normal form. 18/992 useless extension candidates. Maximal degree in co-relation 2343. Up to 394 conditions per place. [2023-09-01 02:02:58,645 INFO L137 encePairwiseOnDemand]: 224/232 looper letters, 71 selfloop transitions, 8 changer transitions 10/89 dead transitions. [2023-09-01 02:02:58,645 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 89 transitions, 440 flow [2023-09-01 02:02:58,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 02:02:58,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 02:02:58,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 754 transitions. [2023-09-01 02:02:58,647 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2023-09-01 02:02:58,647 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 754 transitions. [2023-09-01 02:02:58,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 754 transitions. [2023-09-01 02:02:58,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:02:58,648 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 754 transitions. [2023-09-01 02:02:58,650 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 107.71428571428571) internal successors, (754), 7 states have internal predecessors, (754), 0 states have call successors, (0), 0 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 02:02:58,652 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 232.0) internal successors, (1856), 8 states have internal predecessors, (1856), 0 states have call successors, (0), 0 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 02:02:58,652 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 232.0) internal successors, (1856), 8 states have internal predecessors, (1856), 0 states have call successors, (0), 0 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 02:02:58,652 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 82 flow. Second operand 7 states and 754 transitions. [2023-09-01 02:02:58,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 89 transitions, 440 flow [2023-09-01 02:02:58,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 89 transitions, 430 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 02:02:58,656 INFO L231 Difference]: Finished difference. Result has 43 places, 31 transitions, 145 flow [2023-09-01 02:02:58,656 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=145, PETRI_PLACES=43, PETRI_TRANSITIONS=31} [2023-09-01 02:02:58,657 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 1 predicate places. [2023-09-01 02:02:58,657 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 31 transitions, 145 flow [2023-09-01 02:02:58,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 98.85714285714286) internal successors, (692), 7 states have internal predecessors, (692), 0 states have call successors, (0), 0 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 02:02:58,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:02:58,658 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 02:02:58,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-09-01 02:02:58,658 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:02:58,658 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:02:58,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1630608704, now seen corresponding path program 1 times [2023-09-01 02:02:58,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:02:58,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962161618] [2023-09-01 02:02:58,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:02:58,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:02:58,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:02:58,916 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 02:02:58,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:02:58,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962161618] [2023-09-01 02:02:58,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962161618] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 02:02:58,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813741626] [2023-09-01 02:02:58,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:02:58,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 02:02:58,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 02:02:58,922 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 02:02:58,945 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 02:02:59,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:02:59,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 11 conjunts are in the unsatisfiable core [2023-09-01 02:02:59,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 02:02:59,172 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 02:02:59,172 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 02:02:59,298 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 02:02:59,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813741626] provided 1 perfect and 1 imperfect interpolant sequences [2023-09-01 02:02:59,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-09-01 02:02:59,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 7] total 9 [2023-09-01 02:02:59,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047187027] [2023-09-01 02:02:59,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:02:59,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 02:02:59,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:02:59,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 02:02:59,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-09-01 02:02:59,355 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 232 [2023-09-01 02:02:59,356 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 145 flow. Second operand has 6 states, 6 states have (on average 101.16666666666667) internal successors, (607), 6 states have internal predecessors, (607), 0 states have call successors, (0), 0 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 02:02:59,356 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:02:59,356 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 232 [2023-09-01 02:02:59,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:02:59,688 INFO L130 PetriNetUnfolder]: 815/1235 cut-off events. [2023-09-01 02:02:59,689 INFO L131 PetriNetUnfolder]: For 1371/1417 co-relation queries the response was YES. [2023-09-01 02:02:59,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3879 conditions, 1235 events. 815/1235 cut-off events. For 1371/1417 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 5260 event pairs, 193 based on Foata normal form. 47/1265 useless extension candidates. Maximal degree in co-relation 3869. Up to 398 conditions per place. [2023-09-01 02:02:59,697 INFO L137 encePairwiseOnDemand]: 225/232 looper letters, 94 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2023-09-01 02:02:59,697 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 112 transitions, 668 flow [2023-09-01 02:02:59,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-01 02:02:59,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-09-01 02:02:59,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 887 transitions. [2023-09-01 02:02:59,700 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47790948275862066 [2023-09-01 02:02:59,700 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 887 transitions. [2023-09-01 02:02:59,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 887 transitions. [2023-09-01 02:02:59,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:02:59,701 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 887 transitions. [2023-09-01 02:02:59,703 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 110.875) internal successors, (887), 8 states have internal predecessors, (887), 0 states have call successors, (0), 0 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 02:02:59,705 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 232.0) internal successors, (2088), 9 states have internal predecessors, (2088), 0 states have call successors, (0), 0 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 02:02:59,705 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 232.0) internal successors, (2088), 9 states have internal predecessors, (2088), 0 states have call successors, (0), 0 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 02:02:59,706 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 145 flow. Second operand 8 states and 887 transitions. [2023-09-01 02:02:59,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 112 transitions, 668 flow [2023-09-01 02:02:59,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 112 transitions, 640 flow, removed 9 selfloop flow, removed 2 redundant places. [2023-09-01 02:02:59,711 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 270 flow [2023-09-01 02:02:59,711 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=270, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2023-09-01 02:02:59,711 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 12 predicate places. [2023-09-01 02:02:59,712 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 270 flow [2023-09-01 02:02:59,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.16666666666667) internal successors, (607), 6 states have internal predecessors, (607), 0 states have call successors, (0), 0 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 02:02:59,712 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:02:59,712 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 02:02:59,721 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 02:02:59,918 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,SelfDestructingSolverStorable9 [2023-09-01 02:02:59,919 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:02:59,919 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:02:59,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1885073951, now seen corresponding path program 1 times [2023-09-01 02:02:59,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:02:59,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407290218] [2023-09-01 02:02:59,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:02:59,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:02:59,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:03:00,088 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 02:03:00,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:03:00,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407290218] [2023-09-01 02:03:00,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407290218] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:03:00,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:03:00,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-09-01 02:03:00,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221484458] [2023-09-01 02:03:00,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:03:00,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 02:03:00,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:03:00,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 02:03:00,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-09-01 02:03:00,146 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 232 [2023-09-01 02:03:00,147 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 270 flow. Second operand has 7 states, 7 states have (on average 97.85714285714286) internal successors, (685), 7 states have internal predecessors, (685), 0 states have call successors, (0), 0 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 02:03:00,147 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:03:00,147 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 232 [2023-09-01 02:03:00,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:03:00,507 INFO L130 PetriNetUnfolder]: 1126/1709 cut-off events. [2023-09-01 02:03:00,508 INFO L131 PetriNetUnfolder]: For 4606/4606 co-relation queries the response was YES. [2023-09-01 02:03:00,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6513 conditions, 1709 events. 1126/1709 cut-off events. For 4606/4606 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 7472 event pairs, 276 based on Foata normal form. 20/1729 useless extension candidates. Maximal degree in co-relation 6498. Up to 728 conditions per place. [2023-09-01 02:03:00,519 INFO L137 encePairwiseOnDemand]: 223/232 looper letters, 99 selfloop transitions, 29 changer transitions 13/141 dead transitions. [2023-09-01 02:03:00,519 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 141 transitions, 1066 flow [2023-09-01 02:03:00,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-09-01 02:03:00,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-09-01 02:03:00,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1057 transitions. [2023-09-01 02:03:00,522 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4556034482758621 [2023-09-01 02:03:00,522 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1057 transitions. [2023-09-01 02:03:00,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1057 transitions. [2023-09-01 02:03:00,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:03:00,523 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1057 transitions. [2023-09-01 02:03:00,525 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 105.7) internal successors, (1057), 10 states have internal predecessors, (1057), 0 states have call successors, (0), 0 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 02:03:00,529 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 232.0) internal successors, (2552), 11 states have internal predecessors, (2552), 0 states have call successors, (0), 0 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 02:03:00,530 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 232.0) internal successors, (2552), 11 states have internal predecessors, (2552), 0 states have call successors, (0), 0 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 02:03:00,530 INFO L175 Difference]: Start difference. First operand has 54 places, 43 transitions, 270 flow. Second operand 10 states and 1057 transitions. [2023-09-01 02:03:00,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 141 transitions, 1066 flow [2023-09-01 02:03:00,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 141 transitions, 1052 flow, removed 7 selfloop flow, removed 0 redundant places. [2023-09-01 02:03:00,544 INFO L231 Difference]: Finished difference. Result has 70 places, 59 transitions, 511 flow [2023-09-01 02:03:00,544 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=511, PETRI_PLACES=70, PETRI_TRANSITIONS=59} [2023-09-01 02:03:00,545 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 28 predicate places. [2023-09-01 02:03:00,545 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 59 transitions, 511 flow [2023-09-01 02:03:00,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 97.85714285714286) internal successors, (685), 7 states have internal predecessors, (685), 0 states have call successors, (0), 0 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 02:03:00,546 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:03:00,546 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 02:03:00,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-09-01 02:03:00,546 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:03:00,546 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:03:00,547 INFO L85 PathProgramCache]: Analyzing trace with hash -2144658137, now seen corresponding path program 2 times [2023-09-01 02:03:00,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:03:00,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863798809] [2023-09-01 02:03:00,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:03:00,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:03:00,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:03:00,732 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 02:03:00,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:03:00,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863798809] [2023-09-01 02:03:00,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863798809] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 02:03:00,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826000421] [2023-09-01 02:03:00,733 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-01 02:03:00,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 02:03:00,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 02:03:00,734 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 02:03:00,761 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 02:03:00,842 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-01 02:03:00,842 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 02:03:00,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 12 conjunts are in the unsatisfiable core [2023-09-01 02:03:00,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 02:03:00,957 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 02:03:00,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 02:03:01,078 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 02:03:01,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826000421] provided 1 perfect and 1 imperfect interpolant sequences [2023-09-01 02:03:01,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-09-01 02:03:01,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 7] total 11 [2023-09-01 02:03:01,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990147675] [2023-09-01 02:03:01,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:03:01,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 02:03:01,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:03:01,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 02:03:01,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-09-01 02:03:01,131 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 232 [2023-09-01 02:03:01,132 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 59 transitions, 511 flow. Second operand has 6 states, 6 states have (on average 101.16666666666667) internal successors, (607), 6 states have internal predecessors, (607), 0 states have call successors, (0), 0 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 02:03:01,132 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:03:01,132 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 232 [2023-09-01 02:03:01,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:03:01,623 INFO L130 PetriNetUnfolder]: 1482/2209 cut-off events. [2023-09-01 02:03:01,623 INFO L131 PetriNetUnfolder]: For 9998/10096 co-relation queries the response was YES. [2023-09-01 02:03:01,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10489 conditions, 2209 events. 1482/2209 cut-off events. For 9998/10096 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 9945 event pairs, 356 based on Foata normal form. 102/2295 useless extension candidates. Maximal degree in co-relation 10466. Up to 755 conditions per place. [2023-09-01 02:03:01,643 INFO L137 encePairwiseOnDemand]: 225/232 looper letters, 117 selfloop transitions, 26 changer transitions 3/148 dead transitions. [2023-09-01 02:03:01,643 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 148 transitions, 1303 flow [2023-09-01 02:03:01,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-01 02:03:01,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-09-01 02:03:01,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 889 transitions. [2023-09-01 02:03:01,646 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47898706896551724 [2023-09-01 02:03:01,646 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 889 transitions. [2023-09-01 02:03:01,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 889 transitions. [2023-09-01 02:03:01,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:03:01,647 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 889 transitions. [2023-09-01 02:03:01,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 111.125) internal successors, (889), 8 states have internal predecessors, (889), 0 states have call successors, (0), 0 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 02:03:01,651 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 232.0) internal successors, (2088), 9 states have internal predecessors, (2088), 0 states have call successors, (0), 0 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 02:03:01,652 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 232.0) internal successors, (2088), 9 states have internal predecessors, (2088), 0 states have call successors, (0), 0 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 02:03:01,652 INFO L175 Difference]: Start difference. First operand has 70 places, 59 transitions, 511 flow. Second operand 8 states and 889 transitions. [2023-09-01 02:03:01,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 148 transitions, 1303 flow [2023-09-01 02:03:01,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 148 transitions, 1221 flow, removed 19 selfloop flow, removed 4 redundant places. [2023-09-01 02:03:01,671 INFO L231 Difference]: Finished difference. Result has 77 places, 72 transitions, 683 flow [2023-09-01 02:03:01,672 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=683, PETRI_PLACES=77, PETRI_TRANSITIONS=72} [2023-09-01 02:03:01,672 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 35 predicate places. [2023-09-01 02:03:01,672 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 72 transitions, 683 flow [2023-09-01 02:03:01,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.16666666666667) internal successors, (607), 6 states have internal predecessors, (607), 0 states have call successors, (0), 0 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 02:03:01,673 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:03:01,673 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 02:03:01,680 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 02:03:01,877 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,SelfDestructingSolverStorable11 [2023-09-01 02:03:01,877 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:03:01,877 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:03:01,877 INFO L85 PathProgramCache]: Analyzing trace with hash -127297912, now seen corresponding path program 2 times [2023-09-01 02:03:01,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:03:01,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696902080] [2023-09-01 02:03:01,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:03:01,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:03:01,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:03:02,042 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 02:03:02,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:03:02,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696902080] [2023-09-01 02:03:02,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696902080] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 02:03:02,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917446253] [2023-09-01 02:03:02,043 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-01 02:03:02,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 02:03:02,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 02:03:02,045 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 02:03:02,065 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 02:03:02,181 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-01 02:03:02,181 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 02:03:02,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 14 conjunts are in the unsatisfiable core [2023-09-01 02:03:02,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 02:03:02,313 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 02:03:02,313 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 02:03:03,135 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 02:03:03,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917446253] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 02:03:03,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 02:03:03,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 14 [2023-09-01 02:03:03,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201406035] [2023-09-01 02:03:03,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 02:03:03,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-09-01 02:03:03,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:03:03,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-09-01 02:03:03,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-09-01 02:03:03,268 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 232 [2023-09-01 02:03:03,270 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 72 transitions, 683 flow. Second operand has 14 states, 14 states have (on average 96.28571428571429) internal successors, (1348), 14 states have internal predecessors, (1348), 0 states have call successors, (0), 0 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 02:03:03,270 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:03:03,270 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 232 [2023-09-01 02:03:03,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:03:04,648 INFO L130 PetriNetUnfolder]: 2313/3566 cut-off events. [2023-09-01 02:03:04,648 INFO L131 PetriNetUnfolder]: For 21403/21403 co-relation queries the response was YES. [2023-09-01 02:03:04,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17805 conditions, 3566 events. 2313/3566 cut-off events. For 21403/21403 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 18289 event pairs, 384 based on Foata normal form. 56/3622 useless extension candidates. Maximal degree in co-relation 17778. Up to 1292 conditions per place. [2023-09-01 02:03:04,687 INFO L137 encePairwiseOnDemand]: 222/232 looper letters, 226 selfloop transitions, 76 changer transitions 1/303 dead transitions. [2023-09-01 02:03:04,688 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 303 transitions, 2854 flow [2023-09-01 02:03:04,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-09-01 02:03:04,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-09-01 02:03:04,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2106 transitions. [2023-09-01 02:03:04,697 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4538793103448276 [2023-09-01 02:03:04,697 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 2106 transitions. [2023-09-01 02:03:04,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 2106 transitions. [2023-09-01 02:03:04,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:03:04,698 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 2106 transitions. [2023-09-01 02:03:04,702 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 105.3) internal successors, (2106), 20 states have internal predecessors, (2106), 0 states have call successors, (0), 0 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 02:03:04,708 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 232.0) internal successors, (4872), 21 states have internal predecessors, (4872), 0 states have call successors, (0), 0 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 02:03:04,709 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 232.0) internal successors, (4872), 21 states have internal predecessors, (4872), 0 states have call successors, (0), 0 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 02:03:04,709 INFO L175 Difference]: Start difference. First operand has 77 places, 72 transitions, 683 flow. Second operand 20 states and 2106 transitions. [2023-09-01 02:03:04,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 303 transitions, 2854 flow [2023-09-01 02:03:04,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 303 transitions, 2784 flow, removed 35 selfloop flow, removed 0 redundant places. [2023-09-01 02:03:04,771 INFO L231 Difference]: Finished difference. Result has 111 places, 133 transitions, 1643 flow [2023-09-01 02:03:04,772 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=631, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1643, PETRI_PLACES=111, PETRI_TRANSITIONS=133} [2023-09-01 02:03:04,773 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 69 predicate places. [2023-09-01 02:03:04,773 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 133 transitions, 1643 flow [2023-09-01 02:03:04,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 96.28571428571429) internal successors, (1348), 14 states have internal predecessors, (1348), 0 states have call successors, (0), 0 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 02:03:04,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:03:04,774 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 02:03:04,783 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 02:03:04,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 02:03:04,980 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:03:04,981 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:03:04,981 INFO L85 PathProgramCache]: Analyzing trace with hash 985135421, now seen corresponding path program 3 times [2023-09-01 02:03:04,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:03:04,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860267578] [2023-09-01 02:03:04,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:03:04,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:03:05,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:03:05,140 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 02:03:05,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:03:05,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860267578] [2023-09-01 02:03:05,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860267578] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 02:03:05,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348392774] [2023-09-01 02:03:05,141 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-09-01 02:03:05,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 02:03:05,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 02:03:05,143 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 02:03:05,159 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 02:03:05,244 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-09-01 02:03:05,244 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 02:03:05,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 12 conjunts are in the unsatisfiable core [2023-09-01 02:03:05,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 02:03:05,312 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 02:03:05,313 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 02:03:05,419 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 02:03:05,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1348392774] provided 1 perfect and 1 imperfect interpolant sequences [2023-09-01 02:03:05,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-09-01 02:03:05,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 7] total 9 [2023-09-01 02:03:05,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047821266] [2023-09-01 02:03:05,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:03:05,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 02:03:05,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:03:05,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 02:03:05,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-09-01 02:03:05,461 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 232 [2023-09-01 02:03:05,462 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 133 transitions, 1643 flow. Second operand has 6 states, 6 states have (on average 101.16666666666667) internal successors, (607), 6 states have internal predecessors, (607), 0 states have call successors, (0), 0 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 02:03:05,462 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:03:05,462 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 232 [2023-09-01 02:03:05,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:03:06,255 INFO L130 PetriNetUnfolder]: 2593/3980 cut-off events. [2023-09-01 02:03:06,255 INFO L131 PetriNetUnfolder]: For 51122/51289 co-relation queries the response was YES. [2023-09-01 02:03:06,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25874 conditions, 3980 events. 2593/3980 cut-off events. For 51122/51289 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 20741 event pairs, 608 based on Foata normal form. 145/4106 useless extension candidates. Maximal degree in co-relation 25831. Up to 1410 conditions per place. [2023-09-01 02:03:06,299 INFO L137 encePairwiseOnDemand]: 225/232 looper letters, 164 selfloop transitions, 61 changer transitions 0/228 dead transitions. [2023-09-01 02:03:06,299 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 228 transitions, 2877 flow [2023-09-01 02:03:06,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-01 02:03:06,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-09-01 02:03:06,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 889 transitions. [2023-09-01 02:03:06,302 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47898706896551724 [2023-09-01 02:03:06,303 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 889 transitions. [2023-09-01 02:03:06,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 889 transitions. [2023-09-01 02:03:06,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:03:06,303 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 889 transitions. [2023-09-01 02:03:06,305 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 111.125) internal successors, (889), 8 states have internal predecessors, (889), 0 states have call successors, (0), 0 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 02:03:06,308 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 232.0) internal successors, (2088), 9 states have internal predecessors, (2088), 0 states have call successors, (0), 0 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 02:03:06,309 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 232.0) internal successors, (2088), 9 states have internal predecessors, (2088), 0 states have call successors, (0), 0 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 02:03:06,309 INFO L175 Difference]: Start difference. First operand has 111 places, 133 transitions, 1643 flow. Second operand 8 states and 889 transitions. [2023-09-01 02:03:06,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 228 transitions, 2877 flow [2023-09-01 02:03:06,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 228 transitions, 2659 flow, removed 109 selfloop flow, removed 0 redundant places. [2023-09-01 02:03:06,454 INFO L231 Difference]: Finished difference. Result has 122 places, 151 transitions, 1936 flow [2023-09-01 02:03:06,454 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=1461, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1936, PETRI_PLACES=122, PETRI_TRANSITIONS=151} [2023-09-01 02:03:06,455 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 80 predicate places. [2023-09-01 02:03:06,455 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 151 transitions, 1936 flow [2023-09-01 02:03:06,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.16666666666667) internal successors, (607), 6 states have internal predecessors, (607), 0 states have call successors, (0), 0 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 02:03:06,455 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:03:06,455 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 02:03:06,467 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 02:03:06,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 02:03:06,668 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:03:06,668 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:03:06,668 INFO L85 PathProgramCache]: Analyzing trace with hash -457190798, now seen corresponding path program 3 times [2023-09-01 02:03:06,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:03:06,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831807268] [2023-09-01 02:03:06,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:03:06,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:03:06,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:03:06,883 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 02:03:06,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:03:06,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831807268] [2023-09-01 02:03:06,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831807268] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:03:06,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:03:06,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-09-01 02:03:06,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550862426] [2023-09-01 02:03:06,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:03:06,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 02:03:06,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:03:06,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 02:03:06,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-09-01 02:03:06,939 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 232 [2023-09-01 02:03:06,940 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 151 transitions, 1936 flow. Second operand has 7 states, 7 states have (on average 97.85714285714286) internal successors, (685), 7 states have internal predecessors, (685), 0 states have call successors, (0), 0 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 02:03:06,940 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:03:06,940 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 232 [2023-09-01 02:03:06,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:03:07,750 INFO L130 PetriNetUnfolder]: 2671/4113 cut-off events. [2023-09-01 02:03:07,751 INFO L131 PetriNetUnfolder]: For 61193/61193 co-relation queries the response was YES. [2023-09-01 02:03:07,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27204 conditions, 4113 events. 2671/4113 cut-off events. For 61193/61193 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 21506 event pairs, 936 based on Foata normal form. 4/4117 useless extension candidates. Maximal degree in co-relation 27156. Up to 2106 conditions per place. [2023-09-01 02:03:07,788 INFO L137 encePairwiseOnDemand]: 223/232 looper letters, 171 selfloop transitions, 38 changer transitions 12/221 dead transitions. [2023-09-01 02:03:07,788 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 221 transitions, 2992 flow [2023-09-01 02:03:07,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-01 02:03:07,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-09-01 02:03:07,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 848 transitions. [2023-09-01 02:03:07,791 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45689655172413796 [2023-09-01 02:03:07,791 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 848 transitions. [2023-09-01 02:03:07,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 848 transitions. [2023-09-01 02:03:07,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:03:07,792 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 848 transitions. [2023-09-01 02:03:07,793 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 106.0) internal successors, (848), 8 states have internal predecessors, (848), 0 states have call successors, (0), 0 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 02:03:07,795 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 232.0) internal successors, (2088), 9 states have internal predecessors, (2088), 0 states have call successors, (0), 0 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 02:03:07,796 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 232.0) internal successors, (2088), 9 states have internal predecessors, (2088), 0 states have call successors, (0), 0 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 02:03:07,796 INFO L175 Difference]: Start difference. First operand has 122 places, 151 transitions, 1936 flow. Second operand 8 states and 848 transitions. [2023-09-01 02:03:07,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 221 transitions, 2992 flow [2023-09-01 02:03:07,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 221 transitions, 2898 flow, removed 34 selfloop flow, removed 1 redundant places. [2023-09-01 02:03:07,985 INFO L231 Difference]: Finished difference. Result has 130 places, 154 transitions, 2003 flow [2023-09-01 02:03:07,986 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=1855, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2003, PETRI_PLACES=130, PETRI_TRANSITIONS=154} [2023-09-01 02:03:07,986 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 88 predicate places. [2023-09-01 02:03:07,986 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 154 transitions, 2003 flow [2023-09-01 02:03:07,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 97.85714285714286) internal successors, (685), 7 states have internal predecessors, (685), 0 states have call successors, (0), 0 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 02:03:07,987 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:03:07,987 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 02:03:07,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-09-01 02:03:07,987 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:03:07,987 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:03:07,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1252591096, now seen corresponding path program 4 times [2023-09-01 02:03:07,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:03:07,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085635397] [2023-09-01 02:03:07,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:03:07,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:03:08,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:03:08,128 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 02:03:08,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:03:08,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085635397] [2023-09-01 02:03:08,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085635397] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 02:03:08,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622012108] [2023-09-01 02:03:08,129 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-09-01 02:03:08,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 02:03:08,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 02:03:08,131 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 02:03:08,171 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 02:03:08,282 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-09-01 02:03:08,282 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 02:03:08,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 12 conjunts are in the unsatisfiable core [2023-09-01 02:03:08,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 02:03:08,388 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 02:03:08,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 02:03:12,653 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 02:03:12,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1622012108] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 02:03:12,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 02:03:12,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 15 [2023-09-01 02:03:12,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354077646] [2023-09-01 02:03:12,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 02:03:12,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-09-01 02:03:12,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:03:12,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-09-01 02:03:12,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=160, Unknown=1, NotChecked=0, Total=210 [2023-09-01 02:03:14,681 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 [1] [2023-09-01 02:03:16,688 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 [1] [2023-09-01 02:03:18,701 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 [1] [2023-09-01 02:03:20,708 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 [1] [2023-09-01 02:03:23,645 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 [1] [2023-09-01 02:03:25,849 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 [1] [2023-09-01 02:03:27,857 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 [1] [2023-09-01 02:03:29,875 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 [1] [2023-09-01 02:03:31,896 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 [1] [2023-09-01 02:03:33,905 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 [1] [2023-09-01 02:03:35,928 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 [1] [2023-09-01 02:03:37,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 [1] [2023-09-01 02:03:39,942 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 [1] [2023-09-01 02:03:41,952 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 [1] [2023-09-01 02:03:44,032 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 [1] [2023-09-01 02:03:44,711 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 232 [2023-09-01 02:03:44,712 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 154 transitions, 2003 flow. Second operand has 15 states, 15 states have (on average 93.26666666666667) internal successors, (1399), 15 states have internal predecessors, (1399), 0 states have call successors, (0), 0 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 02:03:44,712 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:03:44,712 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 232 [2023-09-01 02:03:44,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:03:47,208 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 [1] [2023-09-01 02:03:49,215 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 [1] [2023-09-01 02:03:50,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 02:03:52,446 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 [1] [2023-09-01 02:03:54,456 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 [1] [2023-09-01 02:03:56,461 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 [1] [2023-09-01 02:03:58,476 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 [1] [2023-09-01 02:04:00,485 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 [1] [2023-09-01 02:04:02,494 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 [1] [2023-09-01 02:04:04,502 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 [1] [2023-09-01 02:04:06,512 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 [1] [2023-09-01 02:04:08,522 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 [1] [2023-09-01 02:04:10,533 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 [1] [2023-09-01 02:04:12,545 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 [1] [2023-09-01 02:04:14,559 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 [1] [2023-09-01 02:04:16,573 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 [1] [2023-09-01 02:04:18,581 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 [1] [2023-09-01 02:04:20,593 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 [1] [2023-09-01 02:04:22,602 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 [1] [2023-09-01 02:04:24,610 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 [1] [2023-09-01 02:04:26,618 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 [1] [2023-09-01 02:04:28,634 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 [1] [2023-09-01 02:04:30,645 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 [1] [2023-09-01 02:04:32,665 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 [1] [2023-09-01 02:04:34,680 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 [1] [2023-09-01 02:04:36,685 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 [1] [2023-09-01 02:04:37,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 02:04:39,932 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 [1] [2023-09-01 02:04:41,937 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 [1] [2023-09-01 02:04:42,985 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 [1] [2023-09-01 02:04:44,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 02:04:46,692 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 [1] [2023-09-01 02:04:48,706 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 [1] [2023-09-01 02:04:50,715 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 [1] [2023-09-01 02:04:52,722 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 [1] [2023-09-01 02:04:54,747 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((aux_mod_~b~0_35 Int)) (let ((.cse0 (mod (+ 4294967295 (* 4294967295 aux_mod_~b~0_35)) 4294967296))) (or (<= .cse0 (mod c_thread2Thread1of1ForFork0_~i~1 4294967296)) (< (mod (+ c_thread2Thread1of1ForFork0_~i~1 1) 4294967296) .cse0) (< (+ (mod c_thread3Thread1of1ForFork2_~i~2 4294967296) aux_mod_~b~0_35) 4294967295) (>= aux_mod_~b~0_35 4294967296)))) (<= (+ (* (div c_~a~0 4294967296) 4294967296) 1) c_~a~0)) is different from false [2023-09-01 02:04:57,434 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 [1] [2023-09-01 02:04:59,442 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 [1] [2023-09-01 02:05:01,449 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 [1] [2023-09-01 02:05:03,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 02:05:05,377 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 [1] [2023-09-01 02:05:07,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 02:05:09,725 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 [1] [2023-09-01 02:05:12,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 [1] [2023-09-01 02:05:14,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 [1] [2023-09-01 02:05:16,565 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 [1] [2023-09-01 02:05:18,572 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 [1] [2023-09-01 02:05:20,594 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 [1] [2023-09-01 02:05:22,604 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 [1] [2023-09-01 02:05:24,613 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 [1] [2023-09-01 02:05:27,689 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 [1] [2023-09-01 02:05:29,698 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 [1] [2023-09-01 02:05:31,711 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 [1] [2023-09-01 02:06:01,555 WARN L222 SmtUtils]: Spent 14.14s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 02:06:03,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 [1] [2023-09-01 02:06:07,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 02:06:09,597 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 [1] [2023-09-01 02:06:11,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 02:06:13,126 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 [1] [2023-09-01 02:06:15,134 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 [1] [2023-09-01 02:06:17,287 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 [1] [2023-09-01 02:06:19,301 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 [1] [2023-09-01 02:06:39,893 WARN L222 SmtUtils]: Spent 7.89s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 02:06:41,898 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 [1] [2023-09-01 02:06:43,904 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 [1] [2023-09-01 02:06:45,933 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_thread3Thread1of1ForFork2_~i~2 4294967296))) (and (< .cse0 (+ c_~b~0 4294967296 (* (div (+ (- 1) (- c_~b~0)) 4294967296) 4294967296))) (forall ((aux_mod_~b~0_35 Int)) (let ((.cse1 (mod (+ 4294967295 (* 4294967295 aux_mod_~b~0_35)) 4294967296))) (or (<= .cse1 (mod c_thread2Thread1of1ForFork0_~i~1 4294967296)) (< (mod (+ c_thread2Thread1of1ForFork0_~i~1 1) 4294967296) .cse1) (< (+ .cse0 aux_mod_~b~0_35) 4294967295) (>= aux_mod_~b~0_35 4294967296)))) (<= (+ (* (div c_~a~0 4294967296) 4294967296) 1) c_~a~0))) is different from false [2023-09-01 02:06:47,944 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 [1] [2023-09-01 02:06:49,951 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 [1] [2023-09-01 02:06:51,957 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 [1] [2023-09-01 02:06:53,967 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 [1] [2023-09-01 02:06:55,971 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 [1] [2023-09-01 02:06:57,983 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 [1] [2023-09-01 02:07:00,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 02:07:10,218 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 [1] [2023-09-01 02:07:12,231 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 [1] [2023-09-01 02:07:14,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 02:07:16,265 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 [1] [2023-09-01 02:07:18,270 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 [1] [2023-09-01 02:07:20,674 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 [1] [2023-09-01 02:07:22,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 02:07:24,711 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 [1] [2023-09-01 02:07:26,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 02:07:28,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 02:07:30,811 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 [1] [2023-09-01 02:07:32,818 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 [1] [2023-09-01 02:07:34,910 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 [1] [2023-09-01 02:07:36,919 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 [1] [2023-09-01 02:07:38,933 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 [1] [2023-09-01 02:07:40,958 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 [1] [2023-09-01 02:07:42,969 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 [1] [2023-09-01 02:07:44,981 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 [1] [2023-09-01 02:07:46,988 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 [1] [2023-09-01 02:07:56,049 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 [1] [2023-09-01 02:07:58,058 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 [1] [2023-09-01 02:08:00,073 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 [1] [2023-09-01 02:08:02,089 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 [1] [2023-09-01 02:08:08,319 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 [1] [2023-09-01 02:08:10,325 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 [1] [2023-09-01 02:08:12,332 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 [1] [2023-09-01 02:08:14,340 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 [1] [2023-09-01 02:08:16,565 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 [1] [2023-09-01 02:08:18,579 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 [1] [2023-09-01 02:08:20,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 [1] [2023-09-01 02:08:22,861 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 [1] [2023-09-01 02:08:24,951 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 [1] [2023-09-01 02:08:26,961 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 [1] [2023-09-01 02:08:28,976 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 [1] [2023-09-01 02:08:31,100 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 [1] [2023-09-01 02:08:33,106 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 [1] [2023-09-01 02:08:35,114 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 [1] [2023-09-01 02:08:37,120 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 [1] [2023-09-01 02:08:39,127 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 [1] [2023-09-01 02:08:41,141 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 [1] [2023-09-01 02:08:43,157 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 [1] [2023-09-01 02:08:45,167 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 [1] [2023-09-01 02:08:47,175 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 [1] [2023-09-01 02:08:49,187 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 [1] [2023-09-01 02:08:51,202 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 [1] [2023-09-01 02:08:53,212 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 [1] [2023-09-01 02:08:55,216 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 [1] [2023-09-01 02:08:57,225 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 [1] [2023-09-01 02:08:59,283 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 [1] [2023-09-01 02:08:59,390 INFO L130 PetriNetUnfolder]: 5556/8589 cut-off events. [2023-09-01 02:08:59,390 INFO L131 PetriNetUnfolder]: For 125193/125193 co-relation queries the response was YES. [2023-09-01 02:08:59,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56524 conditions, 8589 events. 5556/8589 cut-off events. For 125193/125193 co-relation queries the response was YES. Maximal size of possible extension queue 490. Compared 51630 event pairs, 592 based on Foata normal form. 58/8647 useless extension candidates. Maximal degree in co-relation 56474. Up to 3025 conditions per place. [2023-09-01 02:08:59,466 INFO L137 encePairwiseOnDemand]: 217/232 looper letters, 316 selfloop transitions, 304 changer transitions 3/623 dead transitions. [2023-09-01 02:08:59,466 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 623 transitions, 8172 flow [2023-09-01 02:08:59,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-09-01 02:08:59,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2023-09-01 02:08:59,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 3053 transitions. [2023-09-01 02:08:59,475 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43864942528735634 [2023-09-01 02:08:59,475 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 3053 transitions. [2023-09-01 02:08:59,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 3053 transitions. [2023-09-01 02:08:59,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:08:59,477 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 3053 transitions. [2023-09-01 02:08:59,482 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 101.76666666666667) internal successors, (3053), 30 states have internal predecessors, (3053), 0 states have call successors, (0), 0 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 02:08:59,492 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 232.0) internal successors, (7192), 31 states have internal predecessors, (7192), 0 states have call successors, (0), 0 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 02:08:59,505 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 232.0) internal successors, (7192), 31 states have internal predecessors, (7192), 0 states have call successors, (0), 0 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 02:08:59,505 INFO L175 Difference]: Start difference. First operand has 130 places, 154 transitions, 2003 flow. Second operand 30 states and 3053 transitions. [2023-09-01 02:08:59,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 623 transitions, 8172 flow [2023-09-01 02:08:59,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 623 transitions, 7859 flow, removed 14 selfloop flow, removed 4 redundant places. [2023-09-01 02:08:59,772 INFO L231 Difference]: Finished difference. Result has 180 places, 391 transitions, 6497 flow [2023-09-01 02:08:59,773 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=1904, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=6497, PETRI_PLACES=180, PETRI_TRANSITIONS=391} [2023-09-01 02:08:59,773 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 138 predicate places. [2023-09-01 02:08:59,773 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 391 transitions, 6497 flow [2023-09-01 02:08:59,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 93.26666666666667) internal successors, (1399), 15 states have internal predecessors, (1399), 0 states have call successors, (0), 0 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 02:08:59,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:08:59,774 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 02:08:59,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-09-01 02:08:59,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-09-01 02:08:59,975 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:08:59,975 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:08:59,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1220860868, now seen corresponding path program 5 times [2023-09-01 02:08:59,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:08:59,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202491913] [2023-09-01 02:08:59,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:08:59,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:08:59,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:09:00,188 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 02:09:00,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:09:00,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202491913] [2023-09-01 02:09:00,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202491913] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 02:09:00,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650450130] [2023-09-01 02:09:00,189 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-09-01 02:09:00,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 02:09:00,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 02:09:00,190 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 02:09:00,193 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 02:09:00,301 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-01 02:09:00,301 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 02:09:00,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 9 conjunts are in the unsatisfiable core [2023-09-01 02:09:00,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 02:09:00,405 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 02:09:00,406 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 02:09:00,542 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 02:09:00,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650450130] provided 1 perfect and 1 imperfect interpolant sequences [2023-09-01 02:09:00,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-09-01 02:09:00,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 7] total 11 [2023-09-01 02:09:00,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624057571] [2023-09-01 02:09:00,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:09:00,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 02:09:00,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:09:00,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 02:09:00,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-09-01 02:09:00,592 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 232 [2023-09-01 02:09:00,593 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 391 transitions, 6497 flow. Second operand has 6 states, 6 states have (on average 101.16666666666667) internal successors, (607), 6 states have internal predecessors, (607), 0 states have call successors, (0), 0 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 02:09:00,593 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:09:00,593 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 232 [2023-09-01 02:09:00,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:09:02,707 INFO L130 PetriNetUnfolder]: 6471/10039 cut-off events. [2023-09-01 02:09:02,707 INFO L131 PetriNetUnfolder]: For 339914/340165 co-relation queries the response was YES. [2023-09-01 02:09:02,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99079 conditions, 10039 events. 6471/10039 cut-off events. For 339914/340165 co-relation queries the response was YES. Maximal size of possible extension queue 587. Compared 62724 event pairs, 981 based on Foata normal form. 159/10125 useless extension candidates. Maximal degree in co-relation 99004. Up to 5058 conditions per place. [2023-09-01 02:09:02,836 INFO L137 encePairwiseOnDemand]: 225/232 looper letters, 446 selfloop transitions, 217 changer transitions 3/684 dead transitions. [2023-09-01 02:09:02,837 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 684 transitions, 12213 flow [2023-09-01 02:09:02,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-01 02:09:02,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-09-01 02:09:02,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 885 transitions. [2023-09-01 02:09:02,839 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47683189655172414 [2023-09-01 02:09:02,839 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 885 transitions. [2023-09-01 02:09:02,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 885 transitions. [2023-09-01 02:09:02,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:09:02,840 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 885 transitions. [2023-09-01 02:09:02,841 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 110.625) internal successors, (885), 8 states have internal predecessors, (885), 0 states have call successors, (0), 0 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 02:09:02,843 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 232.0) internal successors, (2088), 9 states have internal predecessors, (2088), 0 states have call successors, (0), 0 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 02:09:02,844 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 232.0) internal successors, (2088), 9 states have internal predecessors, (2088), 0 states have call successors, (0), 0 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 02:09:02,844 INFO L175 Difference]: Start difference. First operand has 180 places, 391 transitions, 6497 flow. Second operand 8 states and 885 transitions. [2023-09-01 02:09:02,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 684 transitions, 12213 flow [2023-09-01 02:09:04,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 684 transitions, 10607 flow, removed 779 selfloop flow, removed 1 redundant places. [2023-09-01 02:09:04,486 INFO L231 Difference]: Finished difference. Result has 192 places, 459 transitions, 7744 flow [2023-09-01 02:09:04,486 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=5658, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=154, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7744, PETRI_PLACES=192, PETRI_TRANSITIONS=459} [2023-09-01 02:09:04,486 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 150 predicate places. [2023-09-01 02:09:04,487 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 459 transitions, 7744 flow [2023-09-01 02:09:04,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.16666666666667) internal successors, (607), 6 states have internal predecessors, (607), 0 states have call successors, (0), 0 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 02:09:04,487 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:09:04,487 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 02:09:04,493 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 02:09:04,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-09-01 02:09:04,692 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:09:04,693 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:09:04,693 INFO L85 PathProgramCache]: Analyzing trace with hash -676035307, now seen corresponding path program 2 times [2023-09-01 02:09:04,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:09:04,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770616856] [2023-09-01 02:09:04,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:09:04,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:09:04,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:09:04,826 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 02:09:04,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:09:04,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770616856] [2023-09-01 02:09:04,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770616856] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:09:04,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:09:04,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-09-01 02:09:04,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922603869] [2023-09-01 02:09:04,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:09:04,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 02:09:04,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:09:04,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 02:09:04,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-09-01 02:09:04,890 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 232 [2023-09-01 02:09:04,890 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 459 transitions, 7744 flow. Second operand has 7 states, 7 states have (on average 97.85714285714286) internal successors, (685), 7 states have internal predecessors, (685), 0 states have call successors, (0), 0 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 02:09:04,891 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:09:04,891 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 232 [2023-09-01 02:09:04,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:09:07,648 INFO L130 PetriNetUnfolder]: 7492/11769 cut-off events. [2023-09-01 02:09:07,648 INFO L131 PetriNetUnfolder]: For 384763/384763 co-relation queries the response was YES. [2023-09-01 02:09:07,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110693 conditions, 11769 events. 7492/11769 cut-off events. For 384763/384763 co-relation queries the response was YES. Maximal size of possible extension queue 692. Compared 76847 event pairs, 1107 based on Foata normal form. 116/11885 useless extension candidates. Maximal degree in co-relation 110612. Up to 5944 conditions per place. [2023-09-01 02:09:07,773 INFO L137 encePairwiseOnDemand]: 223/232 looper letters, 454 selfloop transitions, 277 changer transitions 7/738 dead transitions. [2023-09-01 02:09:07,774 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 738 transitions, 13039 flow [2023-09-01 02:09:07,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-09-01 02:09:07,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-09-01 02:09:07,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1080 transitions. [2023-09-01 02:09:07,776 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46551724137931033 [2023-09-01 02:09:07,777 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1080 transitions. [2023-09-01 02:09:07,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1080 transitions. [2023-09-01 02:09:07,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:09:07,777 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1080 transitions. [2023-09-01 02:09:07,779 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 108.0) internal successors, (1080), 10 states have internal predecessors, (1080), 0 states have call successors, (0), 0 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 02:09:07,782 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 232.0) internal successors, (2552), 11 states have internal predecessors, (2552), 0 states have call successors, (0), 0 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 02:09:07,782 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 232.0) internal successors, (2552), 11 states have internal predecessors, (2552), 0 states have call successors, (0), 0 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 02:09:07,782 INFO L175 Difference]: Start difference. First operand has 192 places, 459 transitions, 7744 flow. Second operand 10 states and 1080 transitions. [2023-09-01 02:09:07,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 738 transitions, 13039 flow [2023-09-01 02:09:09,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 738 transitions, 12921 flow, removed 59 selfloop flow, removed 0 redundant places. [2023-09-01 02:09:09,125 INFO L231 Difference]: Finished difference. Result has 208 places, 540 transitions, 10285 flow [2023-09-01 02:09:09,125 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=7708, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=459, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=202, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10285, PETRI_PLACES=208, PETRI_TRANSITIONS=540} [2023-09-01 02:09:09,125 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 166 predicate places. [2023-09-01 02:09:09,125 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 540 transitions, 10285 flow [2023-09-01 02:09:09,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 97.85714285714286) internal successors, (685), 7 states have internal predecessors, (685), 0 states have call successors, (0), 0 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 02:09:09,126 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:09:09,126 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 02:09:09,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-09-01 02:09:09,126 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:09:09,126 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:09:09,127 INFO L85 PathProgramCache]: Analyzing trace with hash -559896741, now seen corresponding path program 3 times [2023-09-01 02:09:09,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:09:09,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660360910] [2023-09-01 02:09:09,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:09:09,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:09:09,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:09:09,285 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 02:09:09,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:09:09,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660360910] [2023-09-01 02:09:09,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660360910] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 02:09:09,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315799787] [2023-09-01 02:09:09,286 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-09-01 02:09:09,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 02:09:09,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 02:09:09,289 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 02:09:09,307 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 02:09:09,403 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-09-01 02:09:09,404 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 02:09:09,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 12 conjunts are in the unsatisfiable core [2023-09-01 02:09:09,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 02:09:09,561 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 02:09:09,562 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 02:09:09,688 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 02:09:09,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315799787] provided 1 perfect and 1 imperfect interpolant sequences [2023-09-01 02:09:09,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-09-01 02:09:09,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 8] total 15 [2023-09-01 02:09:09,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219772078] [2023-09-01 02:09:09,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:09:09,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 02:09:09,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:09:09,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 02:09:09,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2023-09-01 02:09:09,726 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 232 [2023-09-01 02:09:09,727 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 540 transitions, 10285 flow. Second operand has 6 states, 6 states have (on average 100.16666666666667) internal successors, (601), 6 states have internal predecessors, (601), 0 states have call successors, (0), 0 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 02:09:09,727 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:09:09,727 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 232 [2023-09-01 02:09:09,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:09:12,333 INFO L130 PetriNetUnfolder]: 7497/11794 cut-off events. [2023-09-01 02:09:12,334 INFO L131 PetriNetUnfolder]: For 382279/382807 co-relation queries the response was YES. [2023-09-01 02:09:12,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113044 conditions, 11794 events. 7497/11794 cut-off events. For 382279/382807 co-relation queries the response was YES. Maximal size of possible extension queue 726. Compared 78093 event pairs, 1157 based on Foata normal form. 221/11893 useless extension candidates. Maximal degree in co-relation 112955. Up to 8421 conditions per place. [2023-09-01 02:09:12,470 INFO L137 encePairwiseOnDemand]: 225/232 looper letters, 492 selfloop transitions, 108 changer transitions 4/622 dead transitions. [2023-09-01 02:09:12,470 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 622 transitions, 12700 flow [2023-09-01 02:09:12,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 02:09:12,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 02:09:12,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 653 transitions. [2023-09-01 02:09:12,472 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46910919540229884 [2023-09-01 02:09:12,472 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 653 transitions. [2023-09-01 02:09:12,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 653 transitions. [2023-09-01 02:09:12,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:09:12,473 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 653 transitions. [2023-09-01 02:09:12,474 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 108.83333333333333) internal successors, (653), 6 states have internal predecessors, (653), 0 states have call successors, (0), 0 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 02:09:12,475 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 232.0) internal successors, (1624), 7 states have internal predecessors, (1624), 0 states have call successors, (0), 0 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 02:09:12,476 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 232.0) internal successors, (1624), 7 states have internal predecessors, (1624), 0 states have call successors, (0), 0 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 02:09:12,476 INFO L175 Difference]: Start difference. First operand has 208 places, 540 transitions, 10285 flow. Second operand 6 states and 653 transitions. [2023-09-01 02:09:12,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 622 transitions, 12700 flow [2023-09-01 02:09:13,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 622 transitions, 12370 flow, removed 39 selfloop flow, removed 2 redundant places. [2023-09-01 02:09:13,785 INFO L231 Difference]: Finished difference. Result has 215 places, 557 transitions, 10721 flow [2023-09-01 02:09:13,785 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=9975, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=540, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=435, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=10721, PETRI_PLACES=215, PETRI_TRANSITIONS=557} [2023-09-01 02:09:13,786 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 173 predicate places. [2023-09-01 02:09:13,786 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 557 transitions, 10721 flow [2023-09-01 02:09:13,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 100.16666666666667) internal successors, (601), 6 states have internal predecessors, (601), 0 states have call successors, (0), 0 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 02:09:13,786 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:09:13,786 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 02:09:13,793 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 02:09:13,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 02:09:13,991 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:09:13,991 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:09:13,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1422384946, now seen corresponding path program 6 times [2023-09-01 02:09:13,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:09:13,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335926160] [2023-09-01 02:09:13,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:09:13,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:09:14,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:09:14,135 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 02:09:14,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:09:14,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335926160] [2023-09-01 02:09:14,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335926160] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:09:14,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:09:14,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-09-01 02:09:14,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371495806] [2023-09-01 02:09:14,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:09:14,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 02:09:14,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:09:14,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 02:09:14,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-09-01 02:09:14,203 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 232 [2023-09-01 02:09:14,203 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 557 transitions, 10721 flow. Second operand has 7 states, 7 states have (on average 97.85714285714286) internal successors, (685), 7 states have internal predecessors, (685), 0 states have call successors, (0), 0 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 02:09:14,203 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:09:14,204 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 232 [2023-09-01 02:09:14,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:09:17,366 INFO L130 PetriNetUnfolder]: 8236/13100 cut-off events. [2023-09-01 02:09:17,366 INFO L131 PetriNetUnfolder]: For 412840/412840 co-relation queries the response was YES. [2023-09-01 02:09:17,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125218 conditions, 13100 events. 8236/13100 cut-off events. For 412840/412840 co-relation queries the response was YES. Maximal size of possible extension queue 776. Compared 89191 event pairs, 1265 based on Foata normal form. 57/13157 useless extension candidates. Maximal degree in co-relation 125125. Up to 6606 conditions per place. [2023-09-01 02:09:17,503 INFO L137 encePairwiseOnDemand]: 223/232 looper letters, 474 selfloop transitions, 369 changer transitions 6/849 dead transitions. [2023-09-01 02:09:17,503 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 849 transitions, 16144 flow [2023-09-01 02:09:17,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-09-01 02:09:17,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-09-01 02:09:17,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1069 transitions. [2023-09-01 02:09:17,506 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46077586206896554 [2023-09-01 02:09:17,507 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1069 transitions. [2023-09-01 02:09:17,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1069 transitions. [2023-09-01 02:09:17,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:09:17,507 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1069 transitions. [2023-09-01 02:09:17,509 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 106.9) internal successors, (1069), 10 states have internal predecessors, (1069), 0 states have call successors, (0), 0 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 02:09:17,511 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 232.0) internal successors, (2552), 11 states have internal predecessors, (2552), 0 states have call successors, (0), 0 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 02:09:17,511 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 232.0) internal successors, (2552), 11 states have internal predecessors, (2552), 0 states have call successors, (0), 0 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 02:09:17,512 INFO L175 Difference]: Start difference. First operand has 215 places, 557 transitions, 10721 flow. Second operand 10 states and 1069 transitions. [2023-09-01 02:09:17,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 849 transitions, 16144 flow [2023-09-01 02:09:19,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 849 transitions, 16057 flow, removed 13 selfloop flow, removed 1 redundant places. [2023-09-01 02:09:19,023 INFO L231 Difference]: Finished difference. Result has 227 places, 628 transitions, 13213 flow [2023-09-01 02:09:19,023 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=10652, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=557, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=301, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=13213, PETRI_PLACES=227, PETRI_TRANSITIONS=628} [2023-09-01 02:09:19,023 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 185 predicate places. [2023-09-01 02:09:19,024 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 628 transitions, 13213 flow [2023-09-01 02:09:19,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 97.85714285714286) internal successors, (685), 7 states have internal predecessors, (685), 0 states have call successors, (0), 0 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 02:09:19,024 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:09:19,024 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 02:09:19,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-09-01 02:09:19,024 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:09:19,024 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:09:19,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1133707896, now seen corresponding path program 7 times [2023-09-01 02:09:19,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:09:19,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15986987] [2023-09-01 02:09:19,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:09:19,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:09:19,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:09:19,159 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 02:09:19,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:09:19,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15986987] [2023-09-01 02:09:19,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15986987] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:09:19,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:09:19,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-09-01 02:09:19,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428670984] [2023-09-01 02:09:19,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:09:19,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 02:09:19,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:09:19,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 02:09:19,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-09-01 02:09:19,231 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 232 [2023-09-01 02:09:19,232 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 628 transitions, 13213 flow. Second operand has 7 states, 7 states have (on average 97.85714285714286) internal successors, (685), 7 states have internal predecessors, (685), 0 states have call successors, (0), 0 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 02:09:19,232 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:09:19,232 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 232 [2023-09-01 02:09:19,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:09:22,379 INFO L130 PetriNetUnfolder]: 8219/13056 cut-off events. [2023-09-01 02:09:22,379 INFO L131 PetriNetUnfolder]: For 444287/444287 co-relation queries the response was YES. [2023-09-01 02:09:22,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130457 conditions, 13056 events. 8219/13056 cut-off events. For 444287/444287 co-relation queries the response was YES. Maximal size of possible extension queue 773. Compared 88519 event pairs, 1966 based on Foata normal form. 20/13076 useless extension candidates. Maximal degree in co-relation 130360. Up to 6570 conditions per place. [2023-09-01 02:09:22,521 INFO L137 encePairwiseOnDemand]: 224/232 looper letters, 531 selfloop transitions, 205 changer transitions 0/736 dead transitions. [2023-09-01 02:09:22,521 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 736 transitions, 15983 flow [2023-09-01 02:09:22,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 02:09:22,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 02:09:22,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 740 transitions. [2023-09-01 02:09:22,524 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45566502463054187 [2023-09-01 02:09:22,524 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 740 transitions. [2023-09-01 02:09:22,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 740 transitions. [2023-09-01 02:09:22,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:09:22,524 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 740 transitions. [2023-09-01 02:09:22,526 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 105.71428571428571) internal successors, (740), 7 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:09:22,527 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 232.0) internal successors, (1856), 8 states have internal predecessors, (1856), 0 states have call successors, (0), 0 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 02:09:22,528 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 232.0) internal successors, (1856), 8 states have internal predecessors, (1856), 0 states have call successors, (0), 0 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 02:09:22,528 INFO L175 Difference]: Start difference. First operand has 227 places, 628 transitions, 13213 flow. Second operand 7 states and 740 transitions. [2023-09-01 02:09:22,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 736 transitions, 15983 flow [2023-09-01 02:09:24,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 736 transitions, 15874 flow, removed 52 selfloop flow, removed 3 redundant places. [2023-09-01 02:09:24,556 INFO L231 Difference]: Finished difference. Result has 229 places, 631 transitions, 13599 flow [2023-09-01 02:09:24,556 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=13106, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=628, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=202, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=423, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=13599, PETRI_PLACES=229, PETRI_TRANSITIONS=631} [2023-09-01 02:09:24,557 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 187 predicate places. [2023-09-01 02:09:24,557 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 631 transitions, 13599 flow [2023-09-01 02:09:24,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 97.85714285714286) internal successors, (685), 7 states have internal predecessors, (685), 0 states have call successors, (0), 0 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 02:09:24,558 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:09:24,558 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 02:09:24,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-09-01 02:09:24,558 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:09:24,558 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:09:24,559 INFO L85 PathProgramCache]: Analyzing trace with hash 2146986196, now seen corresponding path program 8 times [2023-09-01 02:09:24,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:09:24,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997091751] [2023-09-01 02:09:24,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:09:24,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:09:24,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:09:24,719 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 02:09:24,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:09:24,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997091751] [2023-09-01 02:09:24,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997091751] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:09:24,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:09:24,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-09-01 02:09:24,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174786083] [2023-09-01 02:09:24,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:09:24,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 02:09:24,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:09:24,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 02:09:24,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-09-01 02:09:24,804 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 232 [2023-09-01 02:09:24,805 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 631 transitions, 13599 flow. Second operand has 7 states, 7 states have (on average 98.85714285714286) internal successors, (692), 7 states have internal predecessors, (692), 0 states have call successors, (0), 0 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 02:09:24,805 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:09:24,805 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 232 [2023-09-01 02:09:24,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:09:27,900 INFO L130 PetriNetUnfolder]: 8314/13290 cut-off events. [2023-09-01 02:09:27,900 INFO L131 PetriNetUnfolder]: For 465065/465065 co-relation queries the response was YES. [2023-09-01 02:09:27,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133934 conditions, 13290 events. 8314/13290 cut-off events. For 465065/465065 co-relation queries the response was YES. Maximal size of possible extension queue 798. Compared 91871 event pairs, 1353 based on Foata normal form. 52/13342 useless extension candidates. Maximal degree in co-relation 133838. Up to 6735 conditions per place. [2023-09-01 02:09:28,048 INFO L137 encePairwiseOnDemand]: 224/232 looper letters, 670 selfloop transitions, 262 changer transitions 9/941 dead transitions. [2023-09-01 02:09:28,048 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 941 transitions, 20958 flow [2023-09-01 02:09:28,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 02:09:28,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 02:09:28,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 740 transitions. [2023-09-01 02:09:28,050 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45566502463054187 [2023-09-01 02:09:28,050 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 740 transitions. [2023-09-01 02:09:28,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 740 transitions. [2023-09-01 02:09:28,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:09:28,050 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 740 transitions. [2023-09-01 02:09:28,051 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 105.71428571428571) internal successors, (740), 7 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:09:28,052 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 232.0) internal successors, (1856), 8 states have internal predecessors, (1856), 0 states have call successors, (0), 0 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 02:09:28,053 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 232.0) internal successors, (1856), 8 states have internal predecessors, (1856), 0 states have call successors, (0), 0 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 02:09:28,053 INFO L175 Difference]: Start difference. First operand has 229 places, 631 transitions, 13599 flow. Second operand 7 states and 740 transitions. [2023-09-01 02:09:28,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 941 transitions, 20958 flow [2023-09-01 02:09:30,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 941 transitions, 20442 flow, removed 9 selfloop flow, removed 4 redundant places. [2023-09-01 02:09:30,020 INFO L231 Difference]: Finished difference. Result has 236 places, 659 transitions, 14857 flow [2023-09-01 02:09:30,020 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=13228, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=631, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=234, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=14857, PETRI_PLACES=236, PETRI_TRANSITIONS=659} [2023-09-01 02:09:30,021 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 194 predicate places. [2023-09-01 02:09:30,021 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 659 transitions, 14857 flow [2023-09-01 02:09:30,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 98.85714285714286) internal successors, (692), 7 states have internal predecessors, (692), 0 states have call successors, (0), 0 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 02:09:30,022 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:09:30,022 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 02:09:30,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-09-01 02:09:30,022 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:09:30,022 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:09:30,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1509588982, now seen corresponding path program 9 times [2023-09-01 02:09:30,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:09:30,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447614445] [2023-09-01 02:09:30,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:09:30,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:09:30,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:09:30,228 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 02:09:30,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:09:30,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447614445] [2023-09-01 02:09:30,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447614445] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 02:09:30,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478833543] [2023-09-01 02:09:30,229 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-09-01 02:09:30,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 02:09:30,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 02:09:30,233 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 02:09:30,237 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 02:09:30,365 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-09-01 02:09:30,365 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 02:09:30,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 11 conjunts are in the unsatisfiable core [2023-09-01 02:09:30,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 02:09:30,440 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 02:09:30,440 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 02:09:30,547 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 02:09:30,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478833543] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 02:09:30,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 02:09:30,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2023-09-01 02:09:30,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999233922] [2023-09-01 02:09:30,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 02:09:30,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-09-01 02:09:30,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:09:30,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-09-01 02:09:30,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2023-09-01 02:09:30,654 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 232 [2023-09-01 02:09:30,655 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 659 transitions, 14857 flow. Second operand has 12 states, 12 states have (on average 97.83333333333333) internal successors, (1174), 12 states have internal predecessors, (1174), 0 states have call successors, (0), 0 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 02:09:30,655 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:09:30,655 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 232 [2023-09-01 02:09:30,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:09:33,835 INFO L130 PetriNetUnfolder]: 8204/13055 cut-off events. [2023-09-01 02:09:33,835 INFO L131 PetriNetUnfolder]: For 493712/493712 co-relation queries the response was YES. [2023-09-01 02:09:33,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137397 conditions, 13055 events. 8204/13055 cut-off events. For 493712/493712 co-relation queries the response was YES. Maximal size of possible extension queue 780. Compared 88699 event pairs, 1810 based on Foata normal form. 51/13106 useless extension candidates. Maximal degree in co-relation 137296. Up to 6596 conditions per place. [2023-09-01 02:09:33,978 INFO L137 encePairwiseOnDemand]: 224/232 looper letters, 518 selfloop transitions, 268 changer transitions 1/787 dead transitions. [2023-09-01 02:09:33,978 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 787 transitions, 18083 flow [2023-09-01 02:09:33,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 02:09:33,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 02:09:33,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 746 transitions. [2023-09-01 02:09:33,980 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45935960591133007 [2023-09-01 02:09:33,980 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 746 transitions. [2023-09-01 02:09:33,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 746 transitions. [2023-09-01 02:09:33,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:09:33,980 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 746 transitions. [2023-09-01 02:09:33,981 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 106.57142857142857) internal successors, (746), 7 states have internal predecessors, (746), 0 states have call successors, (0), 0 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 02:09:33,982 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 232.0) internal successors, (1856), 8 states have internal predecessors, (1856), 0 states have call successors, (0), 0 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 02:09:33,983 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 232.0) internal successors, (1856), 8 states have internal predecessors, (1856), 0 states have call successors, (0), 0 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 02:09:33,983 INFO L175 Difference]: Start difference. First operand has 236 places, 659 transitions, 14857 flow. Second operand 7 states and 746 transitions. [2023-09-01 02:09:33,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 787 transitions, 18083 flow [2023-09-01 02:09:36,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 787 transitions, 17601 flow, removed 139 selfloop flow, removed 2 redundant places. [2023-09-01 02:09:36,132 INFO L231 Difference]: Finished difference. Result has 242 places, 666 transitions, 15234 flow [2023-09-01 02:09:36,132 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=14386, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=659, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=261, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=15234, PETRI_PLACES=242, PETRI_TRANSITIONS=666} [2023-09-01 02:09:36,133 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 200 predicate places. [2023-09-01 02:09:36,133 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 666 transitions, 15234 flow [2023-09-01 02:09:36,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 97.83333333333333) internal successors, (1174), 12 states have internal predecessors, (1174), 0 states have call successors, (0), 0 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 02:09:36,133 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:09:36,133 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 02:09:36,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-09-01 02:09:36,334 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,SelfDestructingSolverStorable22 [2023-09-01 02:09:36,334 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:09:36,334 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:09:36,335 INFO L85 PathProgramCache]: Analyzing trace with hash 2065332540, now seen corresponding path program 10 times [2023-09-01 02:09:36,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:09:36,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680188449] [2023-09-01 02:09:36,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:09:36,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:09:36,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:09:36,481 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 02:09:36,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:09:36,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680188449] [2023-09-01 02:09:36,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680188449] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:09:36,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:09:36,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-09-01 02:09:36,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711198475] [2023-09-01 02:09:36,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:09:36,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 02:09:36,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:09:36,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 02:09:36,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-09-01 02:09:36,558 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 232 [2023-09-01 02:09:36,559 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 666 transitions, 15234 flow. Second operand has 7 states, 7 states have (on average 99.85714285714286) internal successors, (699), 7 states have internal predecessors, (699), 0 states have call successors, (0), 0 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 02:09:36,559 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:09:36,559 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 232 [2023-09-01 02:09:36,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:09:39,894 INFO L130 PetriNetUnfolder]: 8212/13276 cut-off events. [2023-09-01 02:09:39,894 INFO L131 PetriNetUnfolder]: For 514312/514312 co-relation queries the response was YES. [2023-09-01 02:09:39,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138706 conditions, 13276 events. 8212/13276 cut-off events. For 514312/514312 co-relation queries the response was YES. Maximal size of possible extension queue 813. Compared 92809 event pairs, 1773 based on Foata normal form. 80/13356 useless extension candidates. Maximal degree in co-relation 138603. Up to 6803 conditions per place. [2023-09-01 02:09:40,047 INFO L137 encePairwiseOnDemand]: 224/232 looper letters, 556 selfloop transitions, 314 changer transitions 10/880 dead transitions. [2023-09-01 02:09:40,047 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 880 transitions, 20323 flow [2023-09-01 02:09:40,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 02:09:40,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 02:09:40,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 756 transitions. [2023-09-01 02:09:40,049 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46551724137931033 [2023-09-01 02:09:40,049 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 756 transitions. [2023-09-01 02:09:40,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 756 transitions. [2023-09-01 02:09:40,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:09:40,050 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 756 transitions. [2023-09-01 02:09:40,051 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 108.0) internal successors, (756), 7 states have internal predecessors, (756), 0 states have call successors, (0), 0 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 02:09:40,052 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 232.0) internal successors, (1856), 8 states have internal predecessors, (1856), 0 states have call successors, (0), 0 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 02:09:40,053 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 232.0) internal successors, (1856), 8 states have internal predecessors, (1856), 0 states have call successors, (0), 0 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 02:09:40,053 INFO L175 Difference]: Start difference. First operand has 242 places, 666 transitions, 15234 flow. Second operand 7 states and 756 transitions. [2023-09-01 02:09:40,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 880 transitions, 20323 flow [2023-09-01 02:09:42,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 880 transitions, 19624 flow, removed 19 selfloop flow, removed 6 redundant places. [2023-09-01 02:09:42,225 INFO L231 Difference]: Finished difference. Result has 247 places, 700 transitions, 16676 flow [2023-09-01 02:09:42,226 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=14639, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=666, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=287, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=16676, PETRI_PLACES=247, PETRI_TRANSITIONS=700} [2023-09-01 02:09:42,226 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 205 predicate places. [2023-09-01 02:09:42,226 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 700 transitions, 16676 flow [2023-09-01 02:09:42,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 99.85714285714286) internal successors, (699), 7 states have internal predecessors, (699), 0 states have call successors, (0), 0 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 02:09:42,226 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:09:42,226 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 02:09:42,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-09-01 02:09:42,227 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:09:42,227 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:09:42,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1052604743, now seen corresponding path program 4 times [2023-09-01 02:09:42,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:09:42,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744501066] [2023-09-01 02:09:42,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:09:42,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:09:42,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:09:42,358 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 02:09:42,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:09:42,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744501066] [2023-09-01 02:09:42,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744501066] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 02:09:42,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525465289] [2023-09-01 02:09:42,359 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-09-01 02:09:42,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 02:09:42,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 02:09:42,361 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 02:09:42,369 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 02:09:42,491 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-09-01 02:09:42,492 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 02:09:42,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 11 conjunts are in the unsatisfiable core [2023-09-01 02:09:42,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 02:09:42,560 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 02:09:42,560 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 02:09:42,650 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 02:09:42,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525465289] provided 1 perfect and 1 imperfect interpolant sequences [2023-09-01 02:09:42,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-09-01 02:09:42,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 7] total 11 [2023-09-01 02:09:42,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847974892] [2023-09-01 02:09:42,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:09:42,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 02:09:42,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:09:42,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 02:09:42,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-09-01 02:09:42,715 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 232 [2023-09-01 02:09:42,716 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 700 transitions, 16676 flow. Second operand has 6 states, 6 states have (on average 101.16666666666667) internal successors, (607), 6 states have internal predecessors, (607), 0 states have call successors, (0), 0 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 02:09:42,716 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:09:42,716 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 232 [2023-09-01 02:09:42,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:09:46,227 INFO L130 PetriNetUnfolder]: 8137/13137 cut-off events. [2023-09-01 02:09:46,227 INFO L131 PetriNetUnfolder]: For 538304/538508 co-relation queries the response was YES. [2023-09-01 02:09:46,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140409 conditions, 13137 events. 8137/13137 cut-off events. For 538304/538508 co-relation queries the response was YES. Maximal size of possible extension queue 804. Compared 91943 event pairs, 2534 based on Foata normal form. 45/13146 useless extension candidates. Maximal degree in co-relation 140305. Up to 8098 conditions per place. [2023-09-01 02:09:46,380 INFO L137 encePairwiseOnDemand]: 225/232 looper letters, 546 selfloop transitions, 193 changer transitions 0/761 dead transitions. [2023-09-01 02:09:46,380 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 761 transitions, 18874 flow [2023-09-01 02:09:46,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 02:09:46,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 02:09:46,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 664 transitions. [2023-09-01 02:09:46,381 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47701149425287354 [2023-09-01 02:09:46,382 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 664 transitions. [2023-09-01 02:09:46,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 664 transitions. [2023-09-01 02:09:46,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:09:46,382 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 664 transitions. [2023-09-01 02:09:46,383 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 110.66666666666667) internal successors, (664), 6 states have internal predecessors, (664), 0 states have call successors, (0), 0 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 02:09:46,384 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 232.0) internal successors, (1624), 7 states have internal predecessors, (1624), 0 states have call successors, (0), 0 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 02:09:46,385 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 232.0) internal successors, (1624), 7 states have internal predecessors, (1624), 0 states have call successors, (0), 0 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 02:09:46,385 INFO L175 Difference]: Start difference. First operand has 247 places, 700 transitions, 16676 flow. Second operand 6 states and 664 transitions. [2023-09-01 02:09:46,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 761 transitions, 18874 flow [2023-09-01 02:09:48,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 761 transitions, 18593 flow, removed 134 selfloop flow, removed 2 redundant places. [2023-09-01 02:09:48,653 INFO L231 Difference]: Finished difference. Result has 252 places, 702 transitions, 16848 flow [2023-09-01 02:09:48,654 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=16395, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=700, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=191, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=507, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=16848, PETRI_PLACES=252, PETRI_TRANSITIONS=702} [2023-09-01 02:09:48,654 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 210 predicate places. [2023-09-01 02:09:48,654 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 702 transitions, 16848 flow [2023-09-01 02:09:48,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.16666666666667) internal successors, (607), 6 states have internal predecessors, (607), 0 states have call successors, (0), 0 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 02:09:48,654 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:09:48,654 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 02:09:48,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-09-01 02:09:48,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-09-01 02:09:48,855 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:09:48,855 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:09:48,855 INFO L85 PathProgramCache]: Analyzing trace with hash -3048518, now seen corresponding path program 11 times [2023-09-01 02:09:48,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:09:48,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944267059] [2023-09-01 02:09:48,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:09:48,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:09:48,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:09:48,984 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 02:09:48,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:09:48,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944267059] [2023-09-01 02:09:48,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944267059] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:09:48,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:09:48,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-09-01 02:09:48,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343562287] [2023-09-01 02:09:48,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:09:48,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 02:09:48,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:09:48,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 02:09:48,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-09-01 02:09:49,046 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 232 [2023-09-01 02:09:49,047 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 702 transitions, 16848 flow. Second operand has 7 states, 7 states have (on average 98.85714285714286) internal successors, (692), 7 states have internal predecessors, (692), 0 states have call successors, (0), 0 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 02:09:49,047 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:09:49,047 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 232 [2023-09-01 02:09:49,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:09:52,397 INFO L130 PetriNetUnfolder]: 8102/13020 cut-off events. [2023-09-01 02:09:52,397 INFO L131 PetriNetUnfolder]: For 505770/505770 co-relation queries the response was YES. [2023-09-01 02:09:52,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138379 conditions, 13020 events. 8102/13020 cut-off events. For 505770/505770 co-relation queries the response was YES. Maximal size of possible extension queue 791. Compared 89718 event pairs, 1915 based on Foata normal form. 24/13044 useless extension candidates. Maximal degree in co-relation 138273. Up to 6666 conditions per place. [2023-09-01 02:09:52,567 INFO L137 encePairwiseOnDemand]: 224/232 looper letters, 530 selfloop transitions, 286 changer transitions 8/824 dead transitions. [2023-09-01 02:09:52,567 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 824 transitions, 20056 flow [2023-09-01 02:09:52,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 02:09:52,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 02:09:52,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 748 transitions. [2023-09-01 02:09:52,570 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4605911330049261 [2023-09-01 02:09:52,570 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 748 transitions. [2023-09-01 02:09:52,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 748 transitions. [2023-09-01 02:09:52,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:09:52,570 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 748 transitions. [2023-09-01 02:09:52,571 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 106.85714285714286) internal successors, (748), 7 states have internal predecessors, (748), 0 states have call successors, (0), 0 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 02:09:52,573 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 232.0) internal successors, (1856), 8 states have internal predecessors, (1856), 0 states have call successors, (0), 0 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 02:09:52,573 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 232.0) internal successors, (1856), 8 states have internal predecessors, (1856), 0 states have call successors, (0), 0 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 02:09:52,573 INFO L175 Difference]: Start difference. First operand has 252 places, 702 transitions, 16848 flow. Second operand 7 states and 748 transitions. [2023-09-01 02:09:52,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 824 transitions, 20056 flow [2023-09-01 02:09:54,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 824 transitions, 19671 flow, removed 15 selfloop flow, removed 2 redundant places. [2023-09-01 02:09:54,847 INFO L231 Difference]: Finished difference. Result has 259 places, 703 transitions, 17132 flow [2023-09-01 02:09:54,848 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=16463, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=702, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=285, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=17132, PETRI_PLACES=259, PETRI_TRANSITIONS=703} [2023-09-01 02:09:54,848 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 217 predicate places. [2023-09-01 02:09:54,849 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 703 transitions, 17132 flow [2023-09-01 02:09:54,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 98.85714285714286) internal successors, (692), 7 states have internal predecessors, (692), 0 states have call successors, (0), 0 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 02:09:54,849 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:09:54,849 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 02:09:54,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-09-01 02:09:54,850 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:09:54,850 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:09:54,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1265173483, now seen corresponding path program 5 times [2023-09-01 02:09:54,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:09:54,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732564387] [2023-09-01 02:09:54,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:09:54,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:09:54,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:09:54,990 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 02:09:54,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:09:54,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732564387] [2023-09-01 02:09:54,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732564387] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 02:09:54,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726681755] [2023-09-01 02:09:54,991 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-09-01 02:09:54,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 02:09:54,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 02:09:54,993 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 02:09:54,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-09-01 02:09:55,131 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-01 02:09:55,132 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 02:09:55,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 11 conjunts are in the unsatisfiable core [2023-09-01 02:09:55,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 02:09:55,206 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 02:09:55,207 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 02:09:55,303 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 02:09:55,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726681755] provided 1 perfect and 1 imperfect interpolant sequences [2023-09-01 02:09:55,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-09-01 02:09:55,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 7] total 11 [2023-09-01 02:09:55,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752799720] [2023-09-01 02:09:55,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:09:55,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 02:09:55,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:09:55,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 02:09:55,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2023-09-01 02:09:55,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 232 [2023-09-01 02:09:55,368 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 703 transitions, 17132 flow. Second operand has 6 states, 6 states have (on average 101.16666666666667) internal successors, (607), 6 states have internal predecessors, (607), 0 states have call successors, (0), 0 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 02:09:55,368 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:09:55,368 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 232 [2023-09-01 02:09:55,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:09:58,725 INFO L130 PetriNetUnfolder]: 8000/12861 cut-off events. [2023-09-01 02:09:58,726 INFO L131 PetriNetUnfolder]: For 522372/522584 co-relation queries the response was YES. [2023-09-01 02:09:58,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138009 conditions, 12861 events. 8000/12861 cut-off events. For 522372/522584 co-relation queries the response was YES. Maximal size of possible extension queue 786. Compared 89001 event pairs, 2391 based on Foata normal form. 53/12876 useless extension candidates. Maximal degree in co-relation 137900. Up to 7840 conditions per place. [2023-09-01 02:09:58,892 INFO L137 encePairwiseOnDemand]: 225/232 looper letters, 568 selfloop transitions, 209 changer transitions 0/799 dead transitions. [2023-09-01 02:09:58,892 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 799 transitions, 19694 flow [2023-09-01 02:09:58,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 02:09:58,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 02:09:58,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 662 transitions. [2023-09-01 02:09:58,898 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4755747126436782 [2023-09-01 02:09:58,898 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 662 transitions. [2023-09-01 02:09:58,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 662 transitions. [2023-09-01 02:09:58,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:09:58,899 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 662 transitions. [2023-09-01 02:09:58,900 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 110.33333333333333) internal successors, (662), 6 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 02:09:58,901 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 232.0) internal successors, (1624), 7 states have internal predecessors, (1624), 0 states have call successors, (0), 0 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 02:09:58,901 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 232.0) internal successors, (1624), 7 states have internal predecessors, (1624), 0 states have call successors, (0), 0 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 02:09:58,902 INFO L175 Difference]: Start difference. First operand has 259 places, 703 transitions, 17132 flow. Second operand 6 states and 662 transitions. [2023-09-01 02:09:58,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 799 transitions, 19694 flow [2023-09-01 02:10:01,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 799 transitions, 19149 flow, removed 14 selfloop flow, removed 4 redundant places. [2023-09-01 02:10:01,212 INFO L231 Difference]: Finished difference. Result has 262 places, 707 transitions, 17126 flow [2023-09-01 02:10:01,213 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=16587, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=703, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=205, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=494, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=17126, PETRI_PLACES=262, PETRI_TRANSITIONS=707} [2023-09-01 02:10:01,213 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 220 predicate places. [2023-09-01 02:10:01,214 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 707 transitions, 17126 flow [2023-09-01 02:10:01,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.16666666666667) internal successors, (607), 6 states have internal predecessors, (607), 0 states have call successors, (0), 0 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 02:10:01,214 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:10:01,214 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 02:10:01,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-09-01 02:10:01,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-09-01 02:10:01,419 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:10:01,420 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:10:01,420 INFO L85 PathProgramCache]: Analyzing trace with hash 975317519, now seen corresponding path program 6 times [2023-09-01 02:10:01,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:10:01,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688955590] [2023-09-01 02:10:01,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:10:01,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:10:01,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:10:01,559 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 02:10:01,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:10:01,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688955590] [2023-09-01 02:10:01,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688955590] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 02:10:01,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142271348] [2023-09-01 02:10:01,560 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-09-01 02:10:01,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 02:10:01,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 02:10:01,565 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 02:10:01,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-09-01 02:10:01,684 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-09-01 02:10:01,684 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 02:10:01,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 14 conjunts are in the unsatisfiable core [2023-09-01 02:10:01,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 02:10:01,808 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 02:10:01,808 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 02:10:01,939 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 02:10:01,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142271348] provided 1 perfect and 1 imperfect interpolant sequences [2023-09-01 02:10:01,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-09-01 02:10:01,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 8] total 15 [2023-09-01 02:10:01,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688694392] [2023-09-01 02:10:01,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:10:01,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 02:10:01,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:10:01,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 02:10:01,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2023-09-01 02:10:03,986 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 02:10:04,046 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 232 [2023-09-01 02:10:04,046 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 707 transitions, 17126 flow. Second operand has 6 states, 6 states have (on average 101.16666666666667) internal successors, (607), 6 states have internal predecessors, (607), 0 states have call successors, (0), 0 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 02:10:04,046 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:10:04,046 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 232 [2023-09-01 02:10:04,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:10:07,285 INFO L130 PetriNetUnfolder]: 7984/12825 cut-off events. [2023-09-01 02:10:07,285 INFO L131 PetriNetUnfolder]: For 517684/517896 co-relation queries the response was YES. [2023-09-01 02:10:07,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137531 conditions, 12825 events. 7984/12825 cut-off events. For 517684/517896 co-relation queries the response was YES. Maximal size of possible extension queue 783. Compared 88627 event pairs, 2355 based on Foata normal form. 49/12836 useless extension candidates. Maximal degree in co-relation 137420. Up to 7840 conditions per place. [2023-09-01 02:10:07,431 INFO L137 encePairwiseOnDemand]: 225/232 looper letters, 566 selfloop transitions, 209 changer transitions 0/797 dead transitions. [2023-09-01 02:10:07,431 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 797 transitions, 19619 flow [2023-09-01 02:10:07,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 02:10:07,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 02:10:07,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 660 transitions. [2023-09-01 02:10:07,433 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47413793103448276 [2023-09-01 02:10:07,433 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 660 transitions. [2023-09-01 02:10:07,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 660 transitions. [2023-09-01 02:10:07,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:10:07,434 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 660 transitions. [2023-09-01 02:10:07,434 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 110.0) internal successors, (660), 6 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 02:10:07,436 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 232.0) internal successors, (1624), 7 states have internal predecessors, (1624), 0 states have call successors, (0), 0 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 02:10:07,436 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 232.0) internal successors, (1624), 7 states have internal predecessors, (1624), 0 states have call successors, (0), 0 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 02:10:07,436 INFO L175 Difference]: Start difference. First operand has 262 places, 707 transitions, 17126 flow. Second operand 6 states and 660 transitions. [2023-09-01 02:10:07,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 797 transitions, 19619 flow [2023-09-01 02:10:09,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 797 transitions, 19244 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-09-01 02:10:09,682 INFO L231 Difference]: Finished difference. Result has 267 places, 708 transitions, 17206 flow [2023-09-01 02:10:09,682 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=16751, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=707, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=208, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=498, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=17206, PETRI_PLACES=267, PETRI_TRANSITIONS=708} [2023-09-01 02:10:09,683 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 225 predicate places. [2023-09-01 02:10:09,683 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 708 transitions, 17206 flow [2023-09-01 02:10:09,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.16666666666667) internal successors, (607), 6 states have internal predecessors, (607), 0 states have call successors, (0), 0 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 02:10:09,683 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:10:09,683 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 02:10:09,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-09-01 02:10:09,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-09-01 02:10:09,888 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:10:09,888 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:10:09,889 INFO L85 PathProgramCache]: Analyzing trace with hash -313396623, now seen corresponding path program 7 times [2023-09-01 02:10:09,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:10:09,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507303540] [2023-09-01 02:10:09,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:10:09,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:10:09,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:10:10,025 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 02:10:10,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:10:10,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507303540] [2023-09-01 02:10:10,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507303540] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 02:10:10,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435999552] [2023-09-01 02:10:10,026 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-09-01 02:10:10,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 02:10:10,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 02:10:10,029 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 02:10:10,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-09-01 02:10:10,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:10:10,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 11 conjunts are in the unsatisfiable core [2023-09-01 02:10:10,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 02:10:10,245 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 02:10:10,245 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 02:10:16,625 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 02:10:16,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435999552] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 02:10:16,626 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 02:10:16,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 12 [2023-09-01 02:10:16,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292919336] [2023-09-01 02:10:16,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 02:10:16,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-09-01 02:10:16,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:10:16,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-09-01 02:10:16,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=95, Unknown=2, NotChecked=0, Total=132 [2023-09-01 02:10:18,911 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 [1] [2023-09-01 02:10:20,919 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 [1] [2023-09-01 02:10:22,932 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 [1] [2023-09-01 02:10:24,949 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 [1] [2023-09-01 02:10:26,956 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 [1] [2023-09-01 02:10:28,969 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 [1] [2023-09-01 02:10:31,160 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 [1] [2023-09-01 02:10:33,197 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 [1] [2023-09-01 02:10:35,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 02:10:36,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 02:10:38,605 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 [1] [2023-09-01 02:10:38,605 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 232 [2023-09-01 02:10:38,606 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 708 transitions, 17206 flow. Second operand has 12 states, 12 states have (on average 95.08333333333333) internal successors, (1141), 12 states have internal predecessors, (1141), 0 states have call successors, (0), 0 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 02:10:38,606 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:10:38,606 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 232 [2023-09-01 02:10:38,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:10:41,028 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 [1] [2023-09-01 02:10:43,087 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 [1] [2023-09-01 02:10:45,117 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 [1] [2023-09-01 02:10:47,121 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 [1] [2023-09-01 02:10:49,824 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_thread1Thread1of1ForFork1_~i~0 4294967296))) (and (forall ((aux_mod_~b~0_21 Int)) (or (> 0 aux_mod_~b~0_21) (let ((.cse0 (* 4294967295 aux_mod_~b~0_21))) (< .cse0 (+ .cse1 (* (div .cse0 4294967296) 4294967296) 1))) (< (mod c_thread2Thread1of1ForFork0_~i~1 4294967296) aux_mod_~b~0_21))) (let ((.cse2 (* 4294967295 c_~b~0))) (< .cse2 (+ (* (div .cse2 4294967296) 4294967296) .cse1 1))))) is different from false [2023-09-01 02:10:51,827 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 [1] [2023-09-01 02:10:53,836 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 [1] [2023-09-01 02:10:55,842 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 [1] [2023-09-01 02:10:57,854 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 [1] [2023-09-01 02:10:59,858 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 [1] [2023-09-01 02:11:01,868 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 [1] [2023-09-01 02:11:03,882 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 [1] [2023-09-01 02:11:05,897 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 [1] [2023-09-01 02:11:07,901 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 [1] [2023-09-01 02:11:09,907 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 [1] [2023-09-01 02:11:12,949 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 [1] [2023-09-01 02:11:14,996 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 [1] [2023-09-01 02:11:17,070 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 [1] [2023-09-01 02:11:19,082 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 [1] [2023-09-01 02:11:21,092 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 [1] [2023-09-01 02:11:42,179 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 [1] [2023-09-01 02:11:44,213 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 [1] [2023-09-01 02:11:46,219 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 [1] [2023-09-01 02:11:48,287 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 [1] [2023-09-01 02:11:50,300 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 [1] [2023-09-01 02:11:52,313 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 [1] [2023-09-01 02:11:56,389 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 [1] [2023-09-01 02:11:58,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 02:12:00,412 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 [1] [2023-09-01 02:12:02,420 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 [1] [2023-09-01 02:12:04,429 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 [1] [2023-09-01 02:12:06,686 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 [1] [2023-09-01 02:12:08,693 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 [1] [2023-09-01 02:12:10,702 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 [1] [2023-09-01 02:12:12,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 02:12:14,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 02:12:16,847 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 [1] [2023-09-01 02:12:19,526 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 [1] [2023-09-01 02:12:21,540 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 [1] [2023-09-01 02:12:23,547 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 [1] [2023-09-01 02:12:25,894 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 [1] [2023-09-01 02:12:27,900 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 [1] [2023-09-01 02:12:29,905 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 [1] [2023-09-01 02:12:32,329 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 [1] [2023-09-01 02:12:34,612 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 [1] [2023-09-01 02:12:36,628 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 [1] [2023-09-01 02:12:38,633 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 [1] [2023-09-01 02:12:40,640 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 [1] [2023-09-01 02:12:42,646 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 [1] [2023-09-01 02:12:44,662 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 [1] [2023-09-01 02:12:46,677 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 [1] [2023-09-01 02:12:48,685 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 [1] [2023-09-01 02:12:50,698 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 [1] [2023-09-01 02:12:52,706 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 [1] [2023-09-01 02:12:54,714 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 [1] [2023-09-01 02:12:56,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 [1] [2023-09-01 02:12:58,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 [1] [2023-09-01 02:13:00,734 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 [1] [2023-09-01 02:13:02,740 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 [1] [2023-09-01 02:13:04,783 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((aux_mod_~b~0_21 Int)) (or (> 0 aux_mod_~b~0_21) (let ((.cse0 (* 4294967295 aux_mod_~b~0_21))) (< .cse0 (+ (mod c_thread1Thread1of1ForFork1_~i~0 4294967296) (* (div .cse0 4294967296) 4294967296) 1))) (< (mod c_thread2Thread1of1ForFork0_~i~1 4294967296) aux_mod_~b~0_21))) (<= (div (+ c_~b~0 c_~a~0) 4294967296) (div (+ (- 1) c_~b~0 c_~a~0) 4294967296))) is different from false [2023-09-01 02:13:08,891 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 [1] [2023-09-01 02:13:10,899 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 [1] [2023-09-01 02:13:12,910 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 [1] [2023-09-01 02:13:14,917 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 [1] [2023-09-01 02:13:17,121 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 [1] [2023-09-01 02:13:19,256 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 [1] [2023-09-01 02:13:21,262 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 [1] [2023-09-01 02:13:23,286 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((aux_mod_~b~0_21 Int)) (or (> 0 aux_mod_~b~0_21) (let ((.cse0 (* 4294967295 aux_mod_~b~0_21))) (< .cse0 (+ (mod c_thread1Thread1of1ForFork1_~i~0 4294967296) (* (div .cse0 4294967296) 4294967296) 1))) (< (mod c_thread2Thread1of1ForFork0_~i~1 4294967296) aux_mod_~b~0_21))) (< 0 (mod c_~a~0 4294967296)) (= c_thread3Thread1of1ForFork2_~i~2 0) (<= c_~b~0 (* 4294967296 (div c_~b~0 4294967296)))) is different from false [2023-09-01 02:13:25,290 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 [1] [2023-09-01 02:13:27,304 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 [1] [2023-09-01 02:13:29,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 02:13:31,329 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 [1] [2023-09-01 02:13:33,335 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 [1] [2023-09-01 02:13:35,342 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 [1] [2023-09-01 02:13:37,348 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 [1] [2023-09-01 02:13:39,616 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 [1] [2023-09-01 02:13:41,737 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 [1] [2023-09-01 02:13:43,751 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 [1] [2023-09-01 02:13:45,757 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 [1] [2023-09-01 02:13:47,764 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 [1] [2023-09-01 02:13:49,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 [1] [2023-09-01 02:13:51,773 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 [1] [2023-09-01 02:13:56,294 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 [1] [2023-09-01 02:13:58,302 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 [1] [2023-09-01 02:14:00,307 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 [1] [2023-09-01 02:14:02,312 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 [1] [2023-09-01 02:14:04,315 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 [1] [2023-09-01 02:14:06,322 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 [1] [2023-09-01 02:14:08,905 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 [1] [2023-09-01 02:14:10,920 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 [1] [2023-09-01 02:14:12,926 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 [1] [2023-09-01 02:14:14,933 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 [1] [2023-09-01 02:14:16,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 02:14:18,963 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 [1] [2023-09-01 02:14:21,676 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 [1] [2023-09-01 02:14:23,810 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 [1] [2023-09-01 02:14:25,821 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 [1] [2023-09-01 02:14:27,836 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 [1] [2023-09-01 02:14:29,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 [1] [2023-09-01 02:14:32,672 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 [1] [2023-09-01 02:14:34,685 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 [1] [2023-09-01 02:14:36,690 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 [1] [2023-09-01 02:14:39,110 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 [1] [2023-09-01 02:14:41,142 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 [1] [2023-09-01 02:14:43,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 02:14:45,169 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 [1] [2023-09-01 02:14:47,178 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 [1] [2023-09-01 02:14:49,187 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 [1] [2023-09-01 02:14:52,287 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 [1] [2023-09-01 02:14:54,303 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 [1] [2023-09-01 02:14:56,310 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 [1] [2023-09-01 02:14:58,319 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 [1] [2023-09-01 02:15:00,326 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 [1] [2023-09-01 02:15:02,334 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 [1] [2023-09-01 02:15:04,342 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 [1] [2023-09-01 02:15:06,374 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 [1] [2023-09-01 02:15:08,381 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 [1] [2023-09-01 02:15:10,557 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 [1] [2023-09-01 02:15:12,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 02:15:14,616 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 [1] [2023-09-01 02:15:16,709 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 [1] [2023-09-01 02:15:18,721 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 [1] [2023-09-01 02:15:20,759 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 [1] [2023-09-01 02:15:22,763 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 [1] [2023-09-01 02:15:24,770 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 [1] [2023-09-01 02:15:25,002 INFO L130 PetriNetUnfolder]: 9946/16042 cut-off events. [2023-09-01 02:15:25,002 INFO L131 PetriNetUnfolder]: For 647912/647912 co-relation queries the response was YES. [2023-09-01 02:15:25,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172549 conditions, 16042 events. 9946/16042 cut-off events. For 647912/647912 co-relation queries the response was YES. Maximal size of possible extension queue 1000. Compared 115268 event pairs, 1696 based on Foata normal form. 30/16072 useless extension candidates. Maximal degree in co-relation 172436. Up to 8478 conditions per place. [2023-09-01 02:15:25,231 INFO L137 encePairwiseOnDemand]: 216/232 looper letters, 560 selfloop transitions, 557 changer transitions 6/1123 dead transitions. [2023-09-01 02:15:25,231 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 1123 transitions, 26135 flow [2023-09-01 02:15:25,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-09-01 02:15:25,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-09-01 02:15:25,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1981 transitions. [2023-09-01 02:15:25,234 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44941016333938294 [2023-09-01 02:15:25,234 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 1981 transitions. [2023-09-01 02:15:25,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 1981 transitions. [2023-09-01 02:15:25,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:15:25,234 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1981 transitions. [2023-09-01 02:15:25,237 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 104.26315789473684) internal successors, (1981), 19 states have internal predecessors, (1981), 0 states have call successors, (0), 0 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 02:15:25,241 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 232.0) internal successors, (4640), 20 states have internal predecessors, (4640), 0 states have call successors, (0), 0 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 02:15:25,242 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 232.0) internal successors, (4640), 20 states have internal predecessors, (4640), 0 states have call successors, (0), 0 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 02:15:25,242 INFO L175 Difference]: Start difference. First operand has 267 places, 708 transitions, 17206 flow. Second operand 19 states and 1981 transitions. [2023-09-01 02:15:25,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 1123 transitions, 26135 flow [2023-09-01 02:15:28,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 1123 transitions, 25632 flow, removed 10 selfloop flow, removed 3 redundant places. [2023-09-01 02:15:28,417 INFO L231 Difference]: Finished difference. Result has 293 places, 859 transitions, 22158 flow [2023-09-01 02:15:28,418 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=16757, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=706, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=428, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=22158, PETRI_PLACES=293, PETRI_TRANSITIONS=859} [2023-09-01 02:15:28,419 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 251 predicate places. [2023-09-01 02:15:28,419 INFO L495 AbstractCegarLoop]: Abstraction has has 293 places, 859 transitions, 22158 flow [2023-09-01 02:15:28,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 95.08333333333333) internal successors, (1141), 12 states have internal predecessors, (1141), 0 states have call successors, (0), 0 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 02:15:28,420 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:15:28,420 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 02:15:28,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-09-01 02:15:28,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-09-01 02:15:28,625 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:15:28,625 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:15:28,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1397145201, now seen corresponding path program 8 times [2023-09-01 02:15:28,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:15:28,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497967510] [2023-09-01 02:15:28,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:15:28,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:15:28,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:15:28,760 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 02:15:28,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:15:28,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497967510] [2023-09-01 02:15:28,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497967510] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:15:28,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:15:28,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-09-01 02:15:28,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705195899] [2023-09-01 02:15:28,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:15:28,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 02:15:28,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:15:28,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 02:15:28,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-09-01 02:15:28,858 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 232 [2023-09-01 02:15:28,859 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 859 transitions, 22158 flow. Second operand has 7 states, 7 states have (on average 98.85714285714286) internal successors, (692), 7 states have internal predecessors, (692), 0 states have call successors, (0), 0 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 02:15:28,859 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:15:28,859 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 232 [2023-09-01 02:15:28,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:15:34,233 INFO L130 PetriNetUnfolder]: 10278/16537 cut-off events. [2023-09-01 02:15:34,234 INFO L131 PetriNetUnfolder]: For 807014/807014 co-relation queries the response was YES. [2023-09-01 02:15:34,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204524 conditions, 16537 events. 10278/16537 cut-off events. For 807014/807014 co-relation queries the response was YES. Maximal size of possible extension queue 1030. Compared 118666 event pairs, 2499 based on Foata normal form. 34/16571 useless extension candidates. Maximal degree in co-relation 204401. Up to 8785 conditions per place. [2023-09-01 02:15:34,470 INFO L137 encePairwiseOnDemand]: 224/232 looper letters, 720 selfloop transitions, 280 changer transitions 0/1000 dead transitions. [2023-09-01 02:15:34,471 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 1000 transitions, 26742 flow [2023-09-01 02:15:34,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 02:15:34,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 02:15:34,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 767 transitions. [2023-09-01 02:15:34,472 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4722906403940887 [2023-09-01 02:15:34,473 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 767 transitions. [2023-09-01 02:15:34,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 767 transitions. [2023-09-01 02:15:34,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:15:34,473 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 767 transitions. [2023-09-01 02:15:34,474 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 109.57142857142857) internal successors, (767), 7 states have internal predecessors, (767), 0 states have call successors, (0), 0 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 02:15:34,476 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 232.0) internal successors, (1856), 8 states have internal predecessors, (1856), 0 states have call successors, (0), 0 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 02:15:34,476 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 232.0) internal successors, (1856), 8 states have internal predecessors, (1856), 0 states have call successors, (0), 0 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 02:15:34,476 INFO L175 Difference]: Start difference. First operand has 293 places, 859 transitions, 22158 flow. Second operand 7 states and 767 transitions. [2023-09-01 02:15:34,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 1000 transitions, 26742 flow [2023-09-01 02:15:39,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 1000 transitions, 25506 flow, removed 468 selfloop flow, removed 3 redundant places. [2023-09-01 02:15:39,074 INFO L231 Difference]: Finished difference. Result has 299 places, 872 transitions, 22306 flow [2023-09-01 02:15:39,074 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=21224, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=858, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=267, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=582, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=22306, PETRI_PLACES=299, PETRI_TRANSITIONS=872} [2023-09-01 02:15:39,075 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 257 predicate places. [2023-09-01 02:15:39,075 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 872 transitions, 22306 flow [2023-09-01 02:15:39,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 98.85714285714286) internal successors, (692), 7 states have internal predecessors, (692), 0 states have call successors, (0), 0 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 02:15:39,075 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:15:39,075 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 02:15:39,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-09-01 02:15:39,076 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-09-01 02:15:39,076 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:15:39,076 INFO L85 PathProgramCache]: Analyzing trace with hash 16048179, now seen corresponding path program 9 times [2023-09-01 02:15:39,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 02:15:39,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672482176] [2023-09-01 02:15:39,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:15:39,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 02:15:39,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:15:39,207 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 02:15:39,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 02:15:39,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672482176] [2023-09-01 02:15:39,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672482176] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 02:15:39,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869179400] [2023-09-01 02:15:39,208 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-09-01 02:15:39,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 02:15:39,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 02:15:39,209 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 02:15:39,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-09-01 02:15:39,320 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-09-01 02:15:39,320 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 02:15:39,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 14 conjunts are in the unsatisfiable core [2023-09-01 02:15:39,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 02:15:39,453 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 02:15:39,453 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 02:15:52,590 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 02:15:52,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869179400] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 02:15:52,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 02:15:52,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 16 [2023-09-01 02:15:52,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516105071] [2023-09-01 02:15:52,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 02:15:52,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-09-01 02:15:52,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 02:15:52,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-09-01 02:15:52,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=174, Unknown=6, NotChecked=0, Total=240 [2023-09-01 02:15:52,801 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 232 [2023-09-01 02:15:52,802 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 872 transitions, 22306 flow. Second operand has 16 states, 16 states have (on average 97.375) internal successors, (1558), 16 states have internal predecessors, (1558), 0 states have call successors, (0), 0 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 02:15:52,802 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:15:52,802 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 232 [2023-09-01 02:15:52,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:15:54,940 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 [1] [2023-09-01 02:15:56,955 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 [1] [2023-09-01 02:15:58,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 [1] [2023-09-01 02:16:01,004 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 02:16:03,027 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 [1] [2023-09-01 02:16:05,041 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 [1] [2023-09-01 02:16:07,060 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 [1] [2023-09-01 02:16:09,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 02:16:11,277 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 [1] [2023-09-01 02:16:13,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 02:16:15,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 02:16:17,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 02:16:19,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 02:16:21,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 02:16:23,572 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 [1] [2023-09-01 02:16:25,578 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 [1] [2023-09-01 02:16:27,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 02:16:29,632 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 [1] [2023-09-01 02:16:31,655 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 [1] [2023-09-01 02:16:33,668 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 [1] [2023-09-01 02:16:35,676 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 [1] [2023-09-01 02:16:37,690 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 [1] [2023-09-01 02:16:39,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 02:16:41,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 02:16:43,800 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 [1] [2023-09-01 02:16:45,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 02:16:47,862 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 [1] [2023-09-01 02:16:49,879 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 [1] [2023-09-01 02:16:51,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 02:16:53,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 02:16:55,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 02:16:58,010 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 [1] [2023-09-01 02:17:00,029 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 [1] [2023-09-01 02:17:02,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 02:17:04,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-01 02:17:06,245 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 [1] Killed by 15