./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_71-funloop_racing.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_71-funloop_racing.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bde6fe221f69c3fccb0f7c90e011f0b13ab5ca582ddcd328a459cbb512a8fd7f --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 21:48:21,696 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 21:48:21,698 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 21:48:21,739 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 21:48:21,741 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 21:48:21,743 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 21:48:21,745 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 21:48:21,748 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 21:48:21,750 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 21:48:21,754 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 21:48:21,754 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 21:48:21,757 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 21:48:21,757 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 21:48:21,759 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 21:48:21,760 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 21:48:21,764 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 21:48:21,765 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 21:48:21,766 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 21:48:21,768 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 21:48:21,772 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 21:48:21,773 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 21:48:21,774 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 21:48:21,775 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 21:48:21,775 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 21:48:21,782 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 21:48:21,782 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 21:48:21,782 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 21:48:21,784 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 21:48:21,784 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 21:48:21,785 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 21:48:21,785 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 21:48:21,790 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 21:48:21,791 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 21:48:21,792 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 21:48:21,793 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 21:48:21,794 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 21:48:21,794 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 21:48:21,795 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 21:48:21,795 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 21:48:21,795 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 21:48:21,796 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 21:48:21,797 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-29 21:48:21,829 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 21:48:21,829 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 21:48:21,831 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 21:48:21,831 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 21:48:21,832 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 21:48:21,832 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 21:48:21,832 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 21:48:21,833 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 21:48:21,833 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 21:48:21,833 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 21:48:21,834 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 21:48:21,834 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 21:48:21,834 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 21:48:21,835 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 21:48:21,835 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 21:48:21,835 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 21:48:21,835 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 21:48:21,836 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 21:48:21,836 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 21:48:21,837 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 21:48:21,837 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 21:48:21,841 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 21:48:21,841 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 21:48:21,842 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 21:48:21,843 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 21:48:21,843 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 21:48:21,844 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 21:48:21,844 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 21:48:21,844 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 21:48:21,844 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 21:48:21,845 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 21:48:21,845 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 21:48:21,845 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 21:48:21,845 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 21:48:21,845 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 -> bde6fe221f69c3fccb0f7c90e011f0b13ab5ca582ddcd328a459cbb512a8fd7f Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-29 21:48:22,131 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 21:48:22,154 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 21:48:22,157 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 21:48:22,159 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 21:48:22,159 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 21:48:22,160 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_71-funloop_racing.i [2023-08-29 21:48:23,271 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 21:48:23,534 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 21:48:23,546 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_71-funloop_racing.i [2023-08-29 21:48:23,563 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cce479b3/bda43a6e8b514047a10c14cc70348678/FLAG851fb1abd [2023-08-29 21:48:23,574 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cce479b3/bda43a6e8b514047a10c14cc70348678 [2023-08-29 21:48:23,575 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 21:48:23,576 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 21:48:23,577 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 21:48:23,577 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 21:48:23,580 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 21:48:23,581 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 09:48:23" (1/1) ... [2023-08-29 21:48:23,581 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12b63512 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:48:23, skipping insertion in model container [2023-08-29 21:48:23,582 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 09:48:23" (1/1) ... [2023-08-29 21:48:23,587 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 21:48:23,630 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 21:48:24,044 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_71-funloop_racing.i[41323,41336] [2023-08-29 21:48:24,079 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 21:48:24,101 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 21:48:24,146 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_71-funloop_racing.i[41323,41336] [2023-08-29 21:48:24,168 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 21:48:24,237 INFO L208 MainTranslator]: Completed translation [2023-08-29 21:48:24,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:48:24 WrapperNode [2023-08-29 21:48:24,238 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 21:48:24,239 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 21:48:24,239 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 21:48:24,239 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 21:48:24,244 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:48:24" (1/1) ... [2023-08-29 21:48:24,272 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:48:24" (1/1) ... [2023-08-29 21:48:24,310 INFO L138 Inliner]: procedures = 271, calls = 40, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 247 [2023-08-29 21:48:24,311 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 21:48:24,312 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 21:48:24,312 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 21:48:24,312 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 21:48:24,319 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:48:24" (1/1) ... [2023-08-29 21:48:24,320 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:48:24" (1/1) ... [2023-08-29 21:48:24,337 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:48:24" (1/1) ... [2023-08-29 21:48:24,338 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:48:24" (1/1) ... [2023-08-29 21:48:24,345 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:48:24" (1/1) ... [2023-08-29 21:48:24,360 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:48:24" (1/1) ... [2023-08-29 21:48:24,363 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:48:24" (1/1) ... [2023-08-29 21:48:24,367 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:48:24" (1/1) ... [2023-08-29 21:48:24,370 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 21:48:24,371 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 21:48:24,372 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 21:48:24,374 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 21:48:24,375 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:48:24" (1/1) ... [2023-08-29 21:48:24,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 21:48:24,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:48:24,406 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-29 21:48:24,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-29 21:48:24,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 21:48:24,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 21:48:24,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-29 21:48:24,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 21:48:24,447 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-29 21:48:24,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 21:48:24,448 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-29 21:48:24,448 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-29 21:48:24,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-29 21:48:24,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 21:48:24,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 21:48:24,450 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 21:48:24,642 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 21:48:24,644 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 21:48:24,956 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 21:48:24,966 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 21:48:24,969 INFO L302 CfgBuilder]: Removed 35 assume(true) statements. [2023-08-29 21:48:24,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 09:48:24 BoogieIcfgContainer [2023-08-29 21:48:24,971 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 21:48:24,973 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 21:48:24,974 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 21:48:24,976 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 21:48:24,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 09:48:23" (1/3) ... [2023-08-29 21:48:24,977 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4273237a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 09:48:24, skipping insertion in model container [2023-08-29 21:48:24,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:48:24" (2/3) ... [2023-08-29 21:48:24,978 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4273237a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 09:48:24, skipping insertion in model container [2023-08-29 21:48:24,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 09:48:24" (3/3) ... [2023-08-29 21:48:24,979 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_71-funloop_racing.i [2023-08-29 21:48:24,994 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 21:48:24,994 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 38 error locations. [2023-08-29 21:48:24,994 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 21:48:25,125 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-08-29 21:48:25,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 239 places, 281 transitions, 570 flow [2023-08-29 21:48:25,290 INFO L130 PetriNetUnfolder]: 73/440 cut-off events. [2023-08-29 21:48:25,290 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-29 21:48:25,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 446 conditions, 440 events. 73/440 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2247 event pairs, 0 based on Foata normal form. 0/299 useless extension candidates. Maximal degree in co-relation 243. Up to 8 conditions per place. [2023-08-29 21:48:25,300 INFO L82 GeneralOperation]: Start removeDead. Operand has 239 places, 281 transitions, 570 flow [2023-08-29 21:48:25,313 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 239 places, 281 transitions, 570 flow [2023-08-29 21:48:25,316 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 21:48:25,333 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 239 places, 281 transitions, 570 flow [2023-08-29 21:48:25,339 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 239 places, 281 transitions, 570 flow [2023-08-29 21:48:25,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 239 places, 281 transitions, 570 flow [2023-08-29 21:48:25,408 INFO L130 PetriNetUnfolder]: 73/440 cut-off events. [2023-08-29 21:48:25,408 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-29 21:48:25,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 446 conditions, 440 events. 73/440 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2247 event pairs, 0 based on Foata normal form. 0/299 useless extension candidates. Maximal degree in co-relation 243. Up to 8 conditions per place. [2023-08-29 21:48:25,426 INFO L119 LiptonReduction]: Number of co-enabled transitions 26070 [2023-08-29 21:48:29,506 INFO L134 LiptonReduction]: Checked pairs total: 52948 [2023-08-29 21:48:29,506 INFO L136 LiptonReduction]: Total number of compositions: 250 [2023-08-29 21:48:29,527 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 21:48:29,535 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;@74b0ce99, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 21:48:29,535 INFO L358 AbstractCegarLoop]: Starting to check reachability of 49 error locations. [2023-08-29 21:48:29,542 INFO L130 PetriNetUnfolder]: 1/5 cut-off events. [2023-08-29 21:48:29,542 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 21:48:29,543 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:48:29,543 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 21:48:29,545 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:48:29,549 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:48:29,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1088863, now seen corresponding path program 1 times [2023-08-29 21:48:29,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:48:29,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15032263] [2023-08-29 21:48:29,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:48:29,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:48:29,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:48:29,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 21:48:29,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:48:29,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15032263] [2023-08-29 21:48:29,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15032263] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:48:29,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 21:48:29,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 21:48:29,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459115830] [2023-08-29 21:48:29,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:48:29,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 21:48:29,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:48:29,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 21:48:29,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 21:48:29,885 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 531 [2023-08-29 21:48:29,889 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 135 transitions, 278 flow. Second operand has 3 states, 3 states have (on average 235.0) internal successors, (705), 3 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:48:29,889 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:48:29,889 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 531 [2023-08-29 21:48:29,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:48:30,251 INFO L130 PetriNetUnfolder]: 1124/2457 cut-off events. [2023-08-29 21:48:30,252 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-29 21:48:30,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4578 conditions, 2457 events. 1124/2457 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 17754 event pairs, 960 based on Foata normal form. 186/1719 useless extension candidates. Maximal degree in co-relation 4449. Up to 2113 conditions per place. [2023-08-29 21:48:30,265 INFO L137 encePairwiseOnDemand]: 486/531 looper letters, 75 selfloop transitions, 2 changer transitions 0/94 dead transitions. [2023-08-29 21:48:30,265 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 94 transitions, 350 flow [2023-08-29 21:48:30,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 21:48:30,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 21:48:30,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 822 transitions. [2023-08-29 21:48:30,284 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5160075329566854 [2023-08-29 21:48:30,285 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 822 transitions. [2023-08-29 21:48:30,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 822 transitions. [2023-08-29 21:48:30,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:48:30,290 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 822 transitions. [2023-08-29 21:48:30,296 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 274.0) internal successors, (822), 3 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:48:30,303 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 531.0) internal successors, (2124), 4 states have internal predecessors, (2124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:48:30,305 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 531.0) internal successors, (2124), 4 states have internal predecessors, (2124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:48:30,307 INFO L175 Difference]: Start difference. First operand has 99 places, 135 transitions, 278 flow. Second operand 3 states and 822 transitions. [2023-08-29 21:48:30,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 94 transitions, 350 flow [2023-08-29 21:48:30,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 94 transitions, 350 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 21:48:30,314 INFO L231 Difference]: Finished difference. Result has 92 places, 94 transitions, 206 flow [2023-08-29 21:48:30,315 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=206, PETRI_PLACES=92, PETRI_TRANSITIONS=94} [2023-08-29 21:48:30,318 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -7 predicate places. [2023-08-29 21:48:30,318 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 94 transitions, 206 flow [2023-08-29 21:48:30,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.0) internal successors, (705), 3 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:48:30,318 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:48:30,318 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-29 21:48:30,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 21:48:30,319 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:48:30,319 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:48:30,319 INFO L85 PathProgramCache]: Analyzing trace with hash 33765744, now seen corresponding path program 1 times [2023-08-29 21:48:30,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:48:30,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651759654] [2023-08-29 21:48:30,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:48:30,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:48:30,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:48:30,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 21:48:30,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:48:30,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651759654] [2023-08-29 21:48:30,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651759654] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:48:30,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691322650] [2023-08-29 21:48:30,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:48:30,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:48:30,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:48:30,446 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-08-29 21:48:30,468 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-08-29 21:48:30,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:48:30,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-29 21:48:30,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:48:30,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 21:48:30,571 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 21:48:30,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 21:48:30,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [691322650] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 21:48:30,585 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 21:48:30,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-29 21:48:30,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125854393] [2023-08-29 21:48:30,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 21:48:30,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 21:48:30,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:48:30,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 21:48:30,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-29 21:48:30,629 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 531 [2023-08-29 21:48:30,631 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 94 transitions, 206 flow. Second operand has 7 states, 7 states have (on average 234.28571428571428) internal successors, (1640), 7 states have internal predecessors, (1640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:48:30,631 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:48:30,631 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 531 [2023-08-29 21:48:30,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:48:30,972 INFO L130 PetriNetUnfolder]: 1124/2460 cut-off events. [2023-08-29 21:48:30,973 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-29 21:48:30,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4594 conditions, 2460 events. 1124/2460 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 17785 event pairs, 960 based on Foata normal form. 0/1536 useless extension candidates. Maximal degree in co-relation 4582. Up to 2113 conditions per place. [2023-08-29 21:48:30,984 INFO L137 encePairwiseOnDemand]: 528/531 looper letters, 75 selfloop transitions, 5 changer transitions 0/97 dead transitions. [2023-08-29 21:48:30,984 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 97 transitions, 378 flow [2023-08-29 21:48:30,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 21:48:30,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 21:48:30,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1481 transitions. [2023-08-29 21:48:30,992 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46484620213433775 [2023-08-29 21:48:30,993 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1481 transitions. [2023-08-29 21:48:30,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1481 transitions. [2023-08-29 21:48:30,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:48:30,994 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1481 transitions. [2023-08-29 21:48:30,997 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 246.83333333333334) internal successors, (1481), 6 states have internal predecessors, (1481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:48:31,002 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 531.0) internal successors, (3717), 7 states have internal predecessors, (3717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:48:31,004 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 531.0) internal successors, (3717), 7 states have internal predecessors, (3717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:48:31,004 INFO L175 Difference]: Start difference. First operand has 92 places, 94 transitions, 206 flow. Second operand 6 states and 1481 transitions. [2023-08-29 21:48:31,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 97 transitions, 378 flow [2023-08-29 21:48:31,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 97 transitions, 374 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-29 21:48:31,021 INFO L231 Difference]: Finished difference. Result has 99 places, 97 transitions, 238 flow [2023-08-29 21:48:31,022 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=238, PETRI_PLACES=99, PETRI_TRANSITIONS=97} [2023-08-29 21:48:31,022 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, 0 predicate places. [2023-08-29 21:48:31,023 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 97 transitions, 238 flow [2023-08-29 21:48:31,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 234.28571428571428) internal successors, (1640), 7 states have internal predecessors, (1640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:48:31,024 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:48:31,024 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2023-08-29 21:48:31,037 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-08-29 21:48:31,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:48:31,230 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:48:31,230 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:48:31,230 INFO L85 PathProgramCache]: Analyzing trace with hash 903907869, now seen corresponding path program 2 times [2023-08-29 21:48:31,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:48:31,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340141809] [2023-08-29 21:48:31,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:48:31,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:48:31,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:48:31,347 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 21:48:31,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:48:31,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340141809] [2023-08-29 21:48:31,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340141809] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:48:31,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233604753] [2023-08-29 21:48:31,348 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 21:48:31,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:48:31,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:48:31,353 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-08-29 21:48:31,366 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-08-29 21:48:31,423 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-29 21:48:31,423 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 21:48:31,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-29 21:48:31,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:48:31,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-29 21:48:31,477 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-29 21:48:31,477 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 21:48:31,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [233604753] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:48:31,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-29 21:48:31,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 8 [2023-08-29 21:48:31,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777983509] [2023-08-29 21:48:31,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:48:31,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 21:48:31,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:48:31,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 21:48:31,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-08-29 21:48:31,547 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 531 [2023-08-29 21:48:31,548 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 97 transitions, 238 flow. Second operand has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:48:31,549 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:48:31,549 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 531 [2023-08-29 21:48:31,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:48:31,837 INFO L130 PetriNetUnfolder]: 1074/2292 cut-off events. [2023-08-29 21:48:31,837 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-29 21:48:31,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4417 conditions, 2292 events. 1074/2292 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 17034 event pairs, 0 based on Foata normal form. 0/1473 useless extension candidates. Maximal degree in co-relation 4383. Up to 2051 conditions per place. [2023-08-29 21:48:31,848 INFO L137 encePairwiseOnDemand]: 527/531 looper letters, 101 selfloop transitions, 2 changer transitions 0/120 dead transitions. [2023-08-29 21:48:31,848 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 120 transitions, 490 flow [2023-08-29 21:48:31,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 21:48:31,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 21:48:31,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 800 transitions. [2023-08-29 21:48:31,851 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5021971123666039 [2023-08-29 21:48:31,851 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 800 transitions. [2023-08-29 21:48:31,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 800 transitions. [2023-08-29 21:48:31,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:48:31,851 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 800 transitions. [2023-08-29 21:48:31,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 266.6666666666667) internal successors, (800), 3 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:48:31,856 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 531.0) internal successors, (2124), 4 states have internal predecessors, (2124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:48:31,857 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 531.0) internal successors, (2124), 4 states have internal predecessors, (2124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:48:31,857 INFO L175 Difference]: Start difference. First operand has 99 places, 97 transitions, 238 flow. Second operand 3 states and 800 transitions. [2023-08-29 21:48:31,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 120 transitions, 490 flow [2023-08-29 21:48:31,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 120 transitions, 476 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-29 21:48:31,861 INFO L231 Difference]: Finished difference. Result has 101 places, 97 transitions, 234 flow [2023-08-29 21:48:31,861 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=234, PETRI_PLACES=101, PETRI_TRANSITIONS=97} [2023-08-29 21:48:31,862 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, 2 predicate places. [2023-08-29 21:48:31,862 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 97 transitions, 234 flow [2023-08-29 21:48:31,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:48:31,863 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:48:31,863 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2023-08-29 21:48:31,875 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-08-29 21:48:32,069 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,SelfDestructingSolverStorable2 [2023-08-29 21:48:32,069 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:48:32,070 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:48:32,070 INFO L85 PathProgramCache]: Analyzing trace with hash 903907871, now seen corresponding path program 1 times [2023-08-29 21:48:32,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:48:32,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081247155] [2023-08-29 21:48:32,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:48:32,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:48:32,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:48:32,119 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-29 21:48:32,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:48:32,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081247155] [2023-08-29 21:48:32,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081247155] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:48:32,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 21:48:32,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 21:48:32,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046549134] [2023-08-29 21:48:32,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:48:32,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 21:48:32,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:48:32,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 21:48:32,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 21:48:32,196 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 531 [2023-08-29 21:48:32,198 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 97 transitions, 234 flow. Second operand has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:48:32,198 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:48:32,198 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 531 [2023-08-29 21:48:32,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:48:32,478 INFO L130 PetriNetUnfolder]: 1072/2266 cut-off events. [2023-08-29 21:48:32,479 INFO L131 PetriNetUnfolder]: For 56/56 co-relation queries the response was YES. [2023-08-29 21:48:32,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4366 conditions, 2266 events. 1072/2266 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 16066 event pairs, 880 based on Foata normal form. 0/1480 useless extension candidates. Maximal degree in co-relation 4337. Up to 1897 conditions per place. [2023-08-29 21:48:32,490 INFO L137 encePairwiseOnDemand]: 526/531 looper letters, 96 selfloop transitions, 3 changer transitions 0/116 dead transitions. [2023-08-29 21:48:32,491 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 116 transitions, 470 flow [2023-08-29 21:48:32,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 21:48:32,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 21:48:32,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 787 transitions. [2023-08-29 21:48:32,494 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49403640929064657 [2023-08-29 21:48:32,494 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 787 transitions. [2023-08-29 21:48:32,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 787 transitions. [2023-08-29 21:48:32,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:48:32,495 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 787 transitions. [2023-08-29 21:48:32,497 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:48:32,500 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 531.0) internal successors, (2124), 4 states have internal predecessors, (2124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:48:32,501 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 531.0) internal successors, (2124), 4 states have internal predecessors, (2124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:48:32,501 INFO L175 Difference]: Start difference. First operand has 101 places, 97 transitions, 234 flow. Second operand 3 states and 787 transitions. [2023-08-29 21:48:32,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 116 transitions, 470 flow [2023-08-29 21:48:32,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 116 transitions, 466 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 21:48:32,507 INFO L231 Difference]: Finished difference. Result has 99 places, 95 transitions, 232 flow [2023-08-29 21:48:32,508 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=232, PETRI_PLACES=99, PETRI_TRANSITIONS=95} [2023-08-29 21:48:32,509 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, 0 predicate places. [2023-08-29 21:48:32,509 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 95 transitions, 232 flow [2023-08-29 21:48:32,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:48:32,510 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:48:32,510 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2023-08-29 21:48:32,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-29 21:48:32,511 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:48:32,511 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:48:32,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1124769419, now seen corresponding path program 1 times [2023-08-29 21:48:32,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:48:32,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436466390] [2023-08-29 21:48:32,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:48:32,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:48:32,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:48:32,588 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-29 21:48:32,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:48:32,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436466390] [2023-08-29 21:48:32,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436466390] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:48:32,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753108818] [2023-08-29 21:48:32,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:48:32,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:48:32,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:48:32,593 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-08-29 21:48:32,616 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-08-29 21:48:32,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:48:32,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 21:48:32,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:48:32,687 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-29 21:48:32,687 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 21:48:32,732 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-29 21:48:32,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753108818] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 21:48:32,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 21:48:32,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-29 21:48:32,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887811428] [2023-08-29 21:48:32,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 21:48:32,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-29 21:48:32,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:48:32,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-29 21:48:32,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-29 21:48:32,760 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 531 [2023-08-29 21:48:32,763 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 95 transitions, 232 flow. Second operand has 13 states, 13 states have (on average 234.3846153846154) internal successors, (3047), 13 states have internal predecessors, (3047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:48:32,763 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:48:32,763 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 531 [2023-08-29 21:48:32,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:48:33,083 INFO L130 PetriNetUnfolder]: 1074/2274 cut-off events. [2023-08-29 21:48:33,083 INFO L131 PetriNetUnfolder]: For 101/101 co-relation queries the response was YES. [2023-08-29 21:48:33,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4415 conditions, 2274 events. 1074/2274 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 16036 event pairs, 920 based on Foata normal form. 6/1515 useless extension candidates. Maximal degree in co-relation 4362. Up to 1986 conditions per place. [2023-08-29 21:48:33,097 INFO L137 encePairwiseOnDemand]: 528/531 looper letters, 73 selfloop transitions, 11 changer transitions 0/101 dead transitions. [2023-08-29 21:48:33,098 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 101 transitions, 436 flow [2023-08-29 21:48:33,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-29 21:48:33,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-29 21:48:33,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2886 transitions. [2023-08-29 21:48:33,105 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4529190207156309 [2023-08-29 21:48:33,105 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2886 transitions. [2023-08-29 21:48:33,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2886 transitions. [2023-08-29 21:48:33,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:48:33,107 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2886 transitions. [2023-08-29 21:48:33,113 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 240.5) internal successors, (2886), 12 states have internal predecessors, (2886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:48:33,120 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 531.0) internal successors, (6903), 13 states have internal predecessors, (6903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:48:33,124 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 531.0) internal successors, (6903), 13 states have internal predecessors, (6903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:48:33,124 INFO L175 Difference]: Start difference. First operand has 99 places, 95 transitions, 232 flow. Second operand 12 states and 2886 transitions. [2023-08-29 21:48:33,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 101 transitions, 436 flow [2023-08-29 21:48:33,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 101 transitions, 430 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 21:48:33,128 INFO L231 Difference]: Finished difference. Result has 114 places, 101 transitions, 310 flow [2023-08-29 21:48:33,129 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=310, PETRI_PLACES=114, PETRI_TRANSITIONS=101} [2023-08-29 21:48:33,131 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, 15 predicate places. [2023-08-29 21:48:33,131 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 101 transitions, 310 flow [2023-08-29 21:48:33,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 234.3846153846154) internal successors, (3047), 13 states have internal predecessors, (3047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:48:33,132 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:48:33,132 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2023-08-29 21:48:33,143 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-08-29 21:48:33,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:48:33,338 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:48:33,339 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:48:33,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1726668373, now seen corresponding path program 2 times [2023-08-29 21:48:33,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:48:33,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373204372] [2023-08-29 21:48:33,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:48:33,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:48:33,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:48:33,447 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:48:33,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:48:33,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373204372] [2023-08-29 21:48:33,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373204372] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:48:33,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215384175] [2023-08-29 21:48:33,448 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 21:48:33,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:48:33,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:48:33,450 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-08-29 21:48:33,468 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-08-29 21:48:33,531 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-29 21:48:33,531 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 21:48:33,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-29 21:48:33,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:48:33,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-29 21:48:33,585 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:48:33,586 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 21:48:33,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215384175] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:48:33,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-29 21:48:33,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-29 21:48:33,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825471670] [2023-08-29 21:48:33,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:48:33,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 21:48:33,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:48:33,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 21:48:33,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-29 21:48:33,708 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 531 [2023-08-29 21:48:33,709 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 101 transitions, 310 flow. Second operand has 4 states, 4 states have (on average 233.75) internal successors, (935), 4 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:48:33,709 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:48:33,709 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 531 [2023-08-29 21:48:33,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:48:34,011 INFO L130 PetriNetUnfolder]: 1052/2223 cut-off events. [2023-08-29 21:48:34,011 INFO L131 PetriNetUnfolder]: For 54/54 co-relation queries the response was YES. [2023-08-29 21:48:34,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4291 conditions, 2223 events. 1052/2223 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 15568 event pairs, 588 based on Foata normal form. 0/1446 useless extension candidates. Maximal degree in co-relation 4214. Up to 1831 conditions per place. [2023-08-29 21:48:34,028 INFO L137 encePairwiseOnDemand]: 526/531 looper letters, 122 selfloop transitions, 4 changer transitions 0/143 dead transitions. [2023-08-29 21:48:34,028 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 143 transitions, 644 flow [2023-08-29 21:48:34,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 21:48:34,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 21:48:34,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1045 transitions. [2023-08-29 21:48:34,032 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4919962335216573 [2023-08-29 21:48:34,032 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1045 transitions. [2023-08-29 21:48:34,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1045 transitions. [2023-08-29 21:48:34,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:48:34,033 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1045 transitions. [2023-08-29 21:48:34,035 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 261.25) internal successors, (1045), 4 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:48:34,038 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 531.0) internal successors, (2655), 5 states have internal predecessors, (2655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:48:34,038 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 531.0) internal successors, (2655), 5 states have internal predecessors, (2655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:48:34,039 INFO L175 Difference]: Start difference. First operand has 114 places, 101 transitions, 310 flow. Second operand 4 states and 1045 transitions. [2023-08-29 21:48:34,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 143 transitions, 644 flow [2023-08-29 21:48:34,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 143 transitions, 596 flow, removed 19 selfloop flow, removed 5 redundant places. [2023-08-29 21:48:34,043 INFO L231 Difference]: Finished difference. Result has 111 places, 100 transitions, 266 flow [2023-08-29 21:48:34,044 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=266, PETRI_PLACES=111, PETRI_TRANSITIONS=100} [2023-08-29 21:48:34,046 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, 12 predicate places. [2023-08-29 21:48:34,046 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 100 transitions, 266 flow [2023-08-29 21:48:34,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 233.75) internal successors, (935), 4 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:48:34,048 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:48:34,048 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:48:34,061 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-08-29 21:48:34,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:48:34,254 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:48:34,254 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:48:34,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1470218290, now seen corresponding path program 1 times [2023-08-29 21:48:34,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:48:34,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535826337] [2023-08-29 21:48:34,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:48:34,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:48:34,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:48:34,527 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:48:34,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:48:34,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535826337] [2023-08-29 21:48:34,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535826337] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:48:34,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 21:48:34,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 21:48:34,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246544164] [2023-08-29 21:48:34,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:48:34,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 21:48:34,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:48:34,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 21:48:34,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-29 21:48:34,839 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 531 [2023-08-29 21:48:34,841 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 100 transitions, 266 flow. Second operand has 7 states, 7 states have (on average 206.28571428571428) internal successors, (1444), 7 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:48:34,841 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:48:34,841 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 531 [2023-08-29 21:48:34,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:48:35,564 INFO L130 PetriNetUnfolder]: 1707/3783 cut-off events. [2023-08-29 21:48:35,564 INFO L131 PetriNetUnfolder]: For 181/181 co-relation queries the response was YES. [2023-08-29 21:48:35,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7253 conditions, 3783 events. 1707/3783 cut-off events. For 181/181 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 29689 event pairs, 760 based on Foata normal form. 80/2746 useless extension candidates. Maximal degree in co-relation 7200. Up to 1645 conditions per place. [2023-08-29 21:48:35,583 INFO L137 encePairwiseOnDemand]: 514/531 looper letters, 242 selfloop transitions, 18 changer transitions 0/276 dead transitions. [2023-08-29 21:48:35,584 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 276 transitions, 1168 flow [2023-08-29 21:48:35,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-29 21:48:35,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-29 21:48:35,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2332 transitions. [2023-08-29 21:48:35,590 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4391713747645951 [2023-08-29 21:48:35,590 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2332 transitions. [2023-08-29 21:48:35,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2332 transitions. [2023-08-29 21:48:35,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:48:35,591 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2332 transitions. [2023-08-29 21:48:35,596 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 233.2) internal successors, (2332), 10 states have internal predecessors, (2332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:48:35,602 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 531.0) internal successors, (5841), 11 states have internal predecessors, (5841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:48:35,603 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 531.0) internal successors, (5841), 11 states have internal predecessors, (5841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:48:35,603 INFO L175 Difference]: Start difference. First operand has 111 places, 100 transitions, 266 flow. Second operand 10 states and 2332 transitions. [2023-08-29 21:48:35,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 276 transitions, 1168 flow [2023-08-29 21:48:35,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 276 transitions, 1142 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 21:48:35,609 INFO L231 Difference]: Finished difference. Result has 115 places, 108 transitions, 350 flow [2023-08-29 21:48:35,609 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=350, PETRI_PLACES=115, PETRI_TRANSITIONS=108} [2023-08-29 21:48:35,610 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, 16 predicate places. [2023-08-29 21:48:35,610 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 108 transitions, 350 flow [2023-08-29 21:48:35,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 206.28571428571428) internal successors, (1444), 7 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:48:35,611 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:48:35,611 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:48:35,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-29 21:48:35,611 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:48:35,612 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:48:35,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1667878464, now seen corresponding path program 1 times [2023-08-29 21:48:35,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:48:35,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013926562] [2023-08-29 21:48:35,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:48:35,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:48:35,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:48:35,780 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:48:35,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:48:35,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013926562] [2023-08-29 21:48:35,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013926562] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:48:35,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 21:48:35,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 21:48:35,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699290127] [2023-08-29 21:48:35,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:48:35,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 21:48:35,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:48:35,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 21:48:35,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-29 21:48:36,134 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 531 [2023-08-29 21:48:36,136 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 108 transitions, 350 flow. Second operand has 6 states, 6 states have (on average 217.5) internal successors, (1305), 6 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:48:36,136 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:48:36,136 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 531 [2023-08-29 21:48:36,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:48:37,018 INFO L130 PetriNetUnfolder]: 2650/5752 cut-off events. [2023-08-29 21:48:37,018 INFO L131 PetriNetUnfolder]: For 1549/1549 co-relation queries the response was YES. [2023-08-29 21:48:37,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12853 conditions, 5752 events. 2650/5752 cut-off events. For 1549/1549 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 47505 event pairs, 264 based on Foata normal form. 0/4425 useless extension candidates. Maximal degree in co-relation 12795. Up to 3131 conditions per place. [2023-08-29 21:48:37,051 INFO L137 encePairwiseOnDemand]: 517/531 looper letters, 226 selfloop transitions, 35 changer transitions 1/279 dead transitions. [2023-08-29 21:48:37,051 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 279 transitions, 1380 flow [2023-08-29 21:48:37,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 21:48:37,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 21:48:37,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1732 transitions. [2023-08-29 21:48:37,056 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4659671778315846 [2023-08-29 21:48:37,056 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1732 transitions. [2023-08-29 21:48:37,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1732 transitions. [2023-08-29 21:48:37,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:48:37,057 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1732 transitions. [2023-08-29 21:48:37,061 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 247.42857142857142) internal successors, (1732), 7 states have internal predecessors, (1732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:48:37,077 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 531.0) internal successors, (4248), 8 states have internal predecessors, (4248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:48:37,079 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 531.0) internal successors, (4248), 8 states have internal predecessors, (4248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:48:37,079 INFO L175 Difference]: Start difference. First operand has 115 places, 108 transitions, 350 flow. Second operand 7 states and 1732 transitions. [2023-08-29 21:48:37,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 279 transitions, 1380 flow [2023-08-29 21:48:37,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 279 transitions, 1379 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 21:48:37,138 INFO L231 Difference]: Finished difference. Result has 126 places, 141 transitions, 665 flow [2023-08-29 21:48:37,139 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=349, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=665, PETRI_PLACES=126, PETRI_TRANSITIONS=141} [2023-08-29 21:48:37,139 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, 27 predicate places. [2023-08-29 21:48:37,139 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 141 transitions, 665 flow [2023-08-29 21:48:37,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 217.5) internal successors, (1305), 6 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:48:37,140 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:48:37,140 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:48:37,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-29 21:48:37,140 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:48:37,140 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:48:37,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1646445397, now seen corresponding path program 1 times [2023-08-29 21:48:37,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:48:37,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806528873] [2023-08-29 21:48:37,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:48:37,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:48:37,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:48:37,192 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:48:37,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:48:37,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806528873] [2023-08-29 21:48:37,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806528873] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:48:37,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792097599] [2023-08-29 21:48:37,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:48:37,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:48:37,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:48:37,195 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-08-29 21:48:37,220 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-08-29 21:48:37,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:48:37,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-29 21:48:37,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:48:37,303 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:48:37,303 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 21:48:37,320 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:48:37,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [792097599] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 21:48:37,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 21:48:37,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-08-29 21:48:37,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380352220] [2023-08-29 21:48:37,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 21:48:37,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 21:48:37,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:48:37,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 21:48:37,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-29 21:48:37,340 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 531 [2023-08-29 21:48:37,342 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 141 transitions, 665 flow. Second operand has 7 states, 7 states have (on average 235.71428571428572) internal successors, (1650), 7 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:48:37,342 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:48:37,342 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 531 [2023-08-29 21:48:37,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:48:37,422 INFO L130 PetriNetUnfolder]: 121/388 cut-off events. [2023-08-29 21:48:37,422 INFO L131 PetriNetUnfolder]: For 456/456 co-relation queries the response was YES. [2023-08-29 21:48:37,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1165 conditions, 388 events. 121/388 cut-off events. For 456/456 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1830 event pairs, 34 based on Foata normal form. 54/408 useless extension candidates. Maximal degree in co-relation 1113. Up to 249 conditions per place. [2023-08-29 21:48:37,425 INFO L137 encePairwiseOnDemand]: 528/531 looper letters, 73 selfloop transitions, 2 changer transitions 2/85 dead transitions. [2023-08-29 21:48:37,425 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 85 transitions, 564 flow [2023-08-29 21:48:37,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 21:48:37,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 21:48:37,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 982 transitions. [2023-08-29 21:48:37,428 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4623352165725047 [2023-08-29 21:48:37,428 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 982 transitions. [2023-08-29 21:48:37,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 982 transitions. [2023-08-29 21:48:37,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:48:37,433 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 982 transitions. [2023-08-29 21:48:37,436 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 245.5) internal successors, (982), 4 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:48:37,440 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 531.0) internal successors, (2655), 5 states have internal predecessors, (2655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:48:37,441 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 531.0) internal successors, (2655), 5 states have internal predecessors, (2655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:48:37,441 INFO L175 Difference]: Start difference. First operand has 126 places, 141 transitions, 665 flow. Second operand 4 states and 982 transitions. [2023-08-29 21:48:37,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 85 transitions, 564 flow [2023-08-29 21:48:37,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 85 transitions, 528 flow, removed 14 selfloop flow, removed 7 redundant places. [2023-08-29 21:48:37,445 INFO L231 Difference]: Finished difference. Result has 73 places, 56 transitions, 258 flow [2023-08-29 21:48:37,445 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=258, PETRI_PLACES=73, PETRI_TRANSITIONS=56} [2023-08-29 21:48:37,446 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -26 predicate places. [2023-08-29 21:48:37,446 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 56 transitions, 258 flow [2023-08-29 21:48:37,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 235.71428571428572) internal successors, (1650), 7 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:48:37,446 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:48:37,446 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:48:37,457 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-08-29 21:48:37,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:48:37,652 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:48:37,653 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:48:37,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1667878667, now seen corresponding path program 1 times [2023-08-29 21:48:37,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:48:37,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253457023] [2023-08-29 21:48:37,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:48:37,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:48:37,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:48:37,762 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:48:37,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:48:37,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253457023] [2023-08-29 21:48:37,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253457023] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 21:48:37,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 21:48:37,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 21:48:37,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87984525] [2023-08-29 21:48:37,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 21:48:37,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 21:48:37,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:48:37,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 21:48:37,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-29 21:48:37,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 531 [2023-08-29 21:48:37,960 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 56 transitions, 258 flow. Second operand has 6 states, 6 states have (on average 209.5) internal successors, (1257), 6 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:48:37,961 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:48:37,961 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 531 [2023-08-29 21:48:37,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:48:38,027 INFO L130 PetriNetUnfolder]: 105/314 cut-off events. [2023-08-29 21:48:38,027 INFO L131 PetriNetUnfolder]: For 336/342 co-relation queries the response was YES. [2023-08-29 21:48:38,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 944 conditions, 314 events. 105/314 cut-off events. For 336/342 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1226 event pairs, 16 based on Foata normal form. 20/320 useless extension candidates. Maximal degree in co-relation 885. Up to 255 conditions per place. [2023-08-29 21:48:38,029 INFO L137 encePairwiseOnDemand]: 524/531 looper letters, 47 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2023-08-29 21:48:38,029 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 53 transitions, 356 flow [2023-08-29 21:48:38,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 21:48:38,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 21:48:38,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 865 transitions. [2023-08-29 21:48:38,032 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4072504708097928 [2023-08-29 21:48:38,032 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 865 transitions. [2023-08-29 21:48:38,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 865 transitions. [2023-08-29 21:48:38,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:48:38,033 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 865 transitions. [2023-08-29 21:48:38,034 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 216.25) internal successors, (865), 4 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:48:38,037 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 531.0) internal successors, (2655), 5 states have internal predecessors, (2655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:48:38,038 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 531.0) internal successors, (2655), 5 states have internal predecessors, (2655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:48:38,038 INFO L175 Difference]: Start difference. First operand has 73 places, 56 transitions, 258 flow. Second operand 4 states and 865 transitions. [2023-08-29 21:48:38,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 53 transitions, 356 flow [2023-08-29 21:48:38,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 53 transitions, 350 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 21:48:38,040 INFO L231 Difference]: Finished difference. Result has 67 places, 51 transitions, 247 flow [2023-08-29 21:48:38,041 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=247, PETRI_PLACES=67, PETRI_TRANSITIONS=51} [2023-08-29 21:48:38,041 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -32 predicate places. [2023-08-29 21:48:38,041 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 51 transitions, 247 flow [2023-08-29 21:48:38,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 209.5) internal successors, (1257), 6 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:48:38,060 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:48:38,060 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:48:38,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-29 21:48:38,060 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:48:38,061 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:48:38,061 INFO L85 PathProgramCache]: Analyzing trace with hash 122468036, now seen corresponding path program 1 times [2023-08-29 21:48:38,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:48:38,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790461415] [2023-08-29 21:48:38,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:48:38,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:48:38,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:48:38,285 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:48:38,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:48:38,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790461415] [2023-08-29 21:48:38,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790461415] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:48:38,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316573025] [2023-08-29 21:48:38,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:48:38,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:48:38,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:48:38,289 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-08-29 21:48:38,314 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-08-29 21:48:38,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:48:38,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 22 conjunts are in the unsatisfiable core [2023-08-29 21:48:38,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:48:38,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-29 21:48:38,465 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 21:48:38,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-29 21:48:38,482 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-29 21:48:38,534 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-29 21:48:38,544 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:48:38,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 21:48:46,583 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_334 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_334) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2023-08-29 21:48:46,596 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_334 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_334) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2023-08-29 21:48:46,700 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 1 not checked. [2023-08-29 21:48:46,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316573025] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 21:48:46,701 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 21:48:46,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2023-08-29 21:48:46,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522311632] [2023-08-29 21:48:46,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 21:48:46,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-29 21:48:46,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:48:46,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-29 21:48:46,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=80, Unknown=5, NotChecked=38, Total=156 [2023-08-29 21:48:46,753 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 531 [2023-08-29 21:48:46,755 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 51 transitions, 247 flow. Second operand has 13 states, 13 states have (on average 165.3846153846154) internal successors, (2150), 13 states have internal predecessors, (2150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:48:46,755 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:48:46,755 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 531 [2023-08-29 21:48:46,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:48:50,949 INFO L130 PetriNetUnfolder]: 105/313 cut-off events. [2023-08-29 21:48:50,950 INFO L131 PetriNetUnfolder]: For 295/301 co-relation queries the response was YES. [2023-08-29 21:48:50,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 939 conditions, 313 events. 105/313 cut-off events. For 295/301 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1212 event pairs, 16 based on Foata normal form. 2/301 useless extension candidates. Maximal degree in co-relation 880. Up to 131 conditions per place. [2023-08-29 21:48:50,951 INFO L137 encePairwiseOnDemand]: 524/531 looper letters, 56 selfloop transitions, 8 changer transitions 0/68 dead transitions. [2023-08-29 21:48:50,952 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 68 transitions, 439 flow [2023-08-29 21:48:50,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 21:48:50,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 21:48:50,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1025 transitions. [2023-08-29 21:48:50,955 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32172002510985565 [2023-08-29 21:48:50,955 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1025 transitions. [2023-08-29 21:48:50,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1025 transitions. [2023-08-29 21:48:50,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:48:50,956 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1025 transitions. [2023-08-29 21:48:50,958 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 170.83333333333334) internal successors, (1025), 6 states have internal predecessors, (1025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:48:50,962 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 531.0) internal successors, (3717), 7 states have internal predecessors, (3717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:48:50,962 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 531.0) internal successors, (3717), 7 states have internal predecessors, (3717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:48:50,963 INFO L175 Difference]: Start difference. First operand has 67 places, 51 transitions, 247 flow. Second operand 6 states and 1025 transitions. [2023-08-29 21:48:50,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 68 transitions, 439 flow [2023-08-29 21:48:50,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 68 transitions, 436 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 21:48:50,965 INFO L231 Difference]: Finished difference. Result has 71 places, 51 transitions, 265 flow [2023-08-29 21:48:50,966 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=265, PETRI_PLACES=71, PETRI_TRANSITIONS=51} [2023-08-29 21:48:50,966 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -28 predicate places. [2023-08-29 21:48:50,966 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 51 transitions, 265 flow [2023-08-29 21:48:50,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 165.3846153846154) internal successors, (2150), 13 states have internal predecessors, (2150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:48:50,967 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:48:50,967 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:48:50,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-08-29 21:48:51,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:48:51,175 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:48:51,175 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:48:51,176 INFO L85 PathProgramCache]: Analyzing trace with hash -396765722, now seen corresponding path program 1 times [2023-08-29 21:48:51,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:48:51,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861873246] [2023-08-29 21:48:51,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:48:51,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:48:51,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:48:51,486 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:48:51,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:48:51,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861873246] [2023-08-29 21:48:51,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861873246] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:48:51,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527444665] [2023-08-29 21:48:51,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:48:51,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:48:51,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:48:51,489 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-08-29 21:48:51,517 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-08-29 21:48:51,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:48:51,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 27 conjunts are in the unsatisfiable core [2023-08-29 21:48:51,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:48:51,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 21:48:51,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-29 21:48:51,837 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:48:51,838 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 21:48:58,070 WARN L222 SmtUtils]: Spent 6.07s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 21:48:58,181 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:48:58,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1527444665] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 21:48:58,182 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 21:48:58,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 17 [2023-08-29 21:48:58,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133418883] [2023-08-29 21:48:58,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 21:48:58,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-29 21:48:58,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:48:58,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-29 21:48:58,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2023-08-29 21:48:59,657 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 531 [2023-08-29 21:48:59,660 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 51 transitions, 265 flow. Second operand has 19 states, 19 states have (on average 200.21052631578948) internal successors, (3804), 19 states have internal predecessors, (3804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:48:59,660 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:48:59,660 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 531 [2023-08-29 21:48:59,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:49:00,171 INFO L130 PetriNetUnfolder]: 262/763 cut-off events. [2023-08-29 21:49:00,172 INFO L131 PetriNetUnfolder]: For 764/766 co-relation queries the response was YES. [2023-08-29 21:49:00,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2250 conditions, 763 events. 262/763 cut-off events. For 764/766 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3535 event pairs, 44 based on Foata normal form. 54/784 useless extension candidates. Maximal degree in co-relation 2190. Up to 136 conditions per place. [2023-08-29 21:49:00,176 INFO L137 encePairwiseOnDemand]: 520/531 looper letters, 126 selfloop transitions, 21 changer transitions 0/151 dead transitions. [2023-08-29 21:49:00,176 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 151 transitions, 1015 flow [2023-08-29 21:49:00,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-29 21:49:00,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-29 21:49:00,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2485 transitions. [2023-08-29 21:49:00,183 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38998744507219085 [2023-08-29 21:49:00,183 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2485 transitions. [2023-08-29 21:49:00,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2485 transitions. [2023-08-29 21:49:00,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:49:00,185 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2485 transitions. [2023-08-29 21:49:00,189 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 207.08333333333334) internal successors, (2485), 12 states have internal predecessors, (2485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:49:00,219 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 531.0) internal successors, (6903), 13 states have internal predecessors, (6903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:49:00,220 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 531.0) internal successors, (6903), 13 states have internal predecessors, (6903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:49:00,220 INFO L175 Difference]: Start difference. First operand has 71 places, 51 transitions, 265 flow. Second operand 12 states and 2485 transitions. [2023-08-29 21:49:00,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 151 transitions, 1015 flow [2023-08-29 21:49:00,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 151 transitions, 976 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-29 21:49:00,225 INFO L231 Difference]: Finished difference. Result has 81 places, 64 transitions, 421 flow [2023-08-29 21:49:00,225 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=421, PETRI_PLACES=81, PETRI_TRANSITIONS=64} [2023-08-29 21:49:00,226 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -18 predicate places. [2023-08-29 21:49:00,226 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 64 transitions, 421 flow [2023-08-29 21:49:00,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 200.21052631578948) internal successors, (3804), 19 states have internal predecessors, (3804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:49:00,227 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:49:00,227 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:49:00,235 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-08-29 21:49:00,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:49:00,433 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:49:00,433 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:49:00,433 INFO L85 PathProgramCache]: Analyzing trace with hash 632001480, now seen corresponding path program 1 times [2023-08-29 21:49:00,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:49:00,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855104467] [2023-08-29 21:49:00,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:49:00,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:49:00,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:49:00,899 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:49:00,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:49:00,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855104467] [2023-08-29 21:49:00,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855104467] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:49:00,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212322389] [2023-08-29 21:49:00,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:49:00,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:49:00,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:49:00,902 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-08-29 21:49:00,931 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-08-29 21:49:01,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:49:01,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 34 conjunts are in the unsatisfiable core [2023-08-29 21:49:01,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:49:01,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-29 21:49:01,085 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 21:49:01,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-29 21:49:01,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-29 21:49:01,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-29 21:49:01,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-08-29 21:49:05,515 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:49:05,515 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 21:49:15,168 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_89| Int)) (or (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_89|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_89| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-08-29 21:49:17,190 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_505 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_89| Int)) (or (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_505)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_89|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_89| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-08-29 21:49:29,371 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_505 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_89| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_90| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_501) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_90| v_ArrVal_505) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_89|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_89| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_90| 28)))) is different from false [2023-08-29 21:49:29,528 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 1 not checked. [2023-08-29 21:49:29,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [212322389] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 21:49:29,528 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 21:49:29,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 20 [2023-08-29 21:49:29,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468169720] [2023-08-29 21:49:29,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 21:49:29,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-29 21:49:29,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:49:29,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-29 21:49:29,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=247, Unknown=16, NotChecked=108, Total=462 [2023-08-29 21:49:29,800 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 531 [2023-08-29 21:49:29,801 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 64 transitions, 421 flow. Second operand has 22 states, 22 states have (on average 159.54545454545453) internal successors, (3510), 22 states have internal predecessors, (3510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:49:29,802 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:49:29,802 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 531 [2023-08-29 21:49:29,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:49:31,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:49:32,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:49:40,005 WARN L222 SmtUtils]: Spent 6.03s on a formula simplification. DAG size of input: 30 DAG size of output: 28 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 21:49:41,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 21:49:43,427 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-08-29 21:49:44,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:49:45,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:49:46,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:49:47,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:49:50,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:49:51,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:49:52,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:49:55,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:50:04,752 INFO L130 PetriNetUnfolder]: 422/1096 cut-off events. [2023-08-29 21:50:04,752 INFO L131 PetriNetUnfolder]: For 1537/1539 co-relation queries the response was YES. [2023-08-29 21:50:04,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3503 conditions, 1096 events. 422/1096 cut-off events. For 1537/1539 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 5298 event pairs, 1 based on Foata normal form. 10/1064 useless extension candidates. Maximal degree in co-relation 3439. Up to 507 conditions per place. [2023-08-29 21:50:04,758 INFO L137 encePairwiseOnDemand]: 519/531 looper letters, 109 selfloop transitions, 54 changer transitions 0/167 dead transitions. [2023-08-29 21:50:04,758 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 167 transitions, 1362 flow [2023-08-29 21:50:04,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-29 21:50:04,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-29 21:50:04,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1978 transitions. [2023-08-29 21:50:04,764 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31042059008160705 [2023-08-29 21:50:04,764 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1978 transitions. [2023-08-29 21:50:04,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1978 transitions. [2023-08-29 21:50:04,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:50:04,766 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1978 transitions. [2023-08-29 21:50:04,769 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 164.83333333333334) internal successors, (1978), 12 states have internal predecessors, (1978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:50:04,775 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 531.0) internal successors, (6903), 13 states have internal predecessors, (6903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:50:04,777 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 531.0) internal successors, (6903), 13 states have internal predecessors, (6903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:50:04,777 INFO L175 Difference]: Start difference. First operand has 81 places, 64 transitions, 421 flow. Second operand 12 states and 1978 transitions. [2023-08-29 21:50:04,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 167 transitions, 1362 flow [2023-08-29 21:50:04,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 167 transitions, 1252 flow, removed 39 selfloop flow, removed 6 redundant places. [2023-08-29 21:50:04,783 INFO L231 Difference]: Finished difference. Result has 94 places, 112 transitions, 971 flow [2023-08-29 21:50:04,784 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=387, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=971, PETRI_PLACES=94, PETRI_TRANSITIONS=112} [2023-08-29 21:50:04,784 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -5 predicate places. [2023-08-29 21:50:04,784 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 112 transitions, 971 flow [2023-08-29 21:50:04,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 159.54545454545453) internal successors, (3510), 22 states have internal predecessors, (3510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:50:04,785 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:50:04,785 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:50:04,797 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-08-29 21:50:04,997 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,SelfDestructingSolverStorable12 [2023-08-29 21:50:04,998 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:50:04,998 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:50:04,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1544199506, now seen corresponding path program 1 times [2023-08-29 21:50:04,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:50:04,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699181139] [2023-08-29 21:50:04,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:50:04,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:50:05,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:50:05,408 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:50:05,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:50:05,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699181139] [2023-08-29 21:50:05,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699181139] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:50:05,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786842453] [2023-08-29 21:50:05,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:50:05,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:50:05,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:50:05,413 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-08-29 21:50:05,415 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-08-29 21:50:05,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:50:05,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 40 conjunts are in the unsatisfiable core [2023-08-29 21:50:05,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:50:05,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-29 21:50:05,597 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 21:50:05,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-29 21:50:05,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-29 21:50:05,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-29 21:50:05,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2023-08-29 21:50:05,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2023-08-29 21:50:05,850 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:50:05,850 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 21:50:21,920 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_93| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (- 1)))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_93|) 0)) is different from false [2023-08-29 21:50:23,926 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_93| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_93|) 0)) is different from false [2023-08-29 21:50:25,939 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_93| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1|)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_93|) 0)) is different from false [2023-08-29 21:50:33,966 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_602 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_602) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2023-08-29 21:50:34,052 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 2 not checked. [2023-08-29 21:50:34,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [786842453] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 21:50:34,053 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 21:50:34,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 7] total 22 [2023-08-29 21:50:34,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620348983] [2023-08-29 21:50:34,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 21:50:34,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-08-29 21:50:34,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:50:34,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-08-29 21:50:34,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=291, Unknown=9, NotChecked=156, Total=552 [2023-08-29 21:50:34,058 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 531 [2023-08-29 21:50:34,060 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 112 transitions, 971 flow. Second operand has 24 states, 24 states have (on average 155.66666666666666) internal successors, (3736), 24 states have internal predecessors, (3736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:50:34,061 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:50:34,061 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 531 [2023-08-29 21:50:34,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:50:40,207 WARN L222 SmtUtils]: Spent 6.03s on a formula simplification. DAG size of input: 41 DAG size of output: 34 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 21:50:46,260 WARN L222 SmtUtils]: Spent 6.03s on a formula simplification. DAG size of input: 36 DAG size of output: 32 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 21:50:56,626 WARN L222 SmtUtils]: Spent 6.03s on a formula simplification. DAG size of input: 35 DAG size of output: 30 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 21:50:56,841 INFO L130 PetriNetUnfolder]: 463/1305 cut-off events. [2023-08-29 21:50:56,842 INFO L131 PetriNetUnfolder]: For 4135/4139 co-relation queries the response was YES. [2023-08-29 21:50:56,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5159 conditions, 1305 events. 463/1305 cut-off events. For 4135/4139 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 7059 event pairs, 30 based on Foata normal form. 11/1315 useless extension candidates. Maximal degree in co-relation 5087. Up to 322 conditions per place. [2023-08-29 21:50:56,849 INFO L137 encePairwiseOnDemand]: 520/531 looper letters, 130 selfloop transitions, 57 changer transitions 0/191 dead transitions. [2023-08-29 21:50:56,850 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 191 transitions, 1933 flow [2023-08-29 21:50:56,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-29 21:50:56,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-29 21:50:56,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2373 transitions. [2023-08-29 21:50:56,858 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29792843691148774 [2023-08-29 21:50:56,858 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2373 transitions. [2023-08-29 21:50:56,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2373 transitions. [2023-08-29 21:50:56,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:50:56,860 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2373 transitions. [2023-08-29 21:50:56,863 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 158.2) internal successors, (2373), 15 states have internal predecessors, (2373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:50:56,870 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 531.0) internal successors, (8496), 16 states have internal predecessors, (8496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:50:56,871 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 531.0) internal successors, (8496), 16 states have internal predecessors, (8496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:50:56,871 INFO L175 Difference]: Start difference. First operand has 94 places, 112 transitions, 971 flow. Second operand 15 states and 2373 transitions. [2023-08-29 21:50:56,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 191 transitions, 1933 flow [2023-08-29 21:50:56,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 191 transitions, 1813 flow, removed 60 selfloop flow, removed 0 redundant places. [2023-08-29 21:50:56,889 INFO L231 Difference]: Finished difference. Result has 115 places, 152 transitions, 1410 flow [2023-08-29 21:50:56,890 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=899, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1410, PETRI_PLACES=115, PETRI_TRANSITIONS=152} [2023-08-29 21:50:56,890 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, 16 predicate places. [2023-08-29 21:50:56,890 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 152 transitions, 1410 flow [2023-08-29 21:50:56,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 155.66666666666666) internal successors, (3736), 24 states have internal predecessors, (3736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:50:56,891 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:50:56,891 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:50:56,899 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-08-29 21:50:57,097 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,SelfDestructingSolverStorable13 [2023-08-29 21:50:57,098 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:50:57,098 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:50:57,098 INFO L85 PathProgramCache]: Analyzing trace with hash -359790508, now seen corresponding path program 2 times [2023-08-29 21:50:57,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:50:57,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398940756] [2023-08-29 21:50:57,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:50:57,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:50:57,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:50:57,532 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:50:57,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:50:57,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398940756] [2023-08-29 21:50:57,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398940756] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:50:57,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401178147] [2023-08-29 21:50:57,533 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 21:50:57,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:50:57,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:50:57,535 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-08-29 21:50:57,540 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-08-29 21:50:57,671 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-29 21:50:57,672 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 21:50:57,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-29 21:50:57,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:50:57,681 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-29 21:50:57,739 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 21:50:57,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-29 21:50:57,751 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-29 21:50:57,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-29 21:50:57,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-29 21:50:57,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-08-29 21:51:01,398 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:51:01,399 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 21:51:09,416 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_97| Int)) (or (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_97|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_97| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-08-29 21:51:11,439 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_97| Int) (v_ArrVal_706 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_97| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_706)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_97|) 0))) is different from false [2023-08-29 21:51:11,457 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_97| Int) (v_ArrVal_705 (Array Int Int)) (v_ArrVal_706 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_97| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_705))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_706))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_97|) 0))) is different from false [2023-08-29 21:51:11,499 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_97| Int) (v_ArrVal_705 (Array Int Int)) (v_ArrVal_706 Int) (v_ArrVal_703 Int)) (or (= (select (select (let ((.cse0 (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_703)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_705))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_706))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_97|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_97| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-08-29 21:51:11,546 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_98| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_97| Int) (v_ArrVal_705 (Array Int Int)) (v_ArrVal_706 Int) (v_ArrVal_703 Int)) (or (= (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_98| v_ArrVal_703)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_705) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_98| v_ArrVal_706) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_97|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_97| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_98| 28)))) is different from false [2023-08-29 21:51:11,578 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_702 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_98| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_97| Int) (v_ArrVal_705 (Array Int Int)) (v_ArrVal_706 Int) (v_ArrVal_703 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_97| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_98| 28)) (= (select (store (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_702))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_98| v_ArrVal_703))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_705) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_98| v_ArrVal_706) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_97|) 0))) is different from false [2023-08-29 21:51:11,759 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 3 not checked. [2023-08-29 21:51:11,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401178147] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 21:51:11,760 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 21:51:11,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 9] total 21 [2023-08-29 21:51:11,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913100196] [2023-08-29 21:51:11,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 21:51:11,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-29 21:51:11,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:51:11,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-29 21:51:11,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=206, Unknown=12, NotChecked=210, Total=506 [2023-08-29 21:51:11,963 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 531 [2023-08-29 21:51:11,965 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 152 transitions, 1410 flow. Second operand has 23 states, 23 states have (on average 159.47826086956522) internal successors, (3668), 23 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:51:11,965 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:51:11,965 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 531 [2023-08-29 21:51:11,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:51:13,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:51:14,198 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:51:15,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:51:17,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:51:19,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:51:21,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:51:22,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:51:23,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:51:29,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:51:30,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:51:32,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:51:33,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:51:34,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:51:44,283 WARN L222 SmtUtils]: Spent 6.04s on a formula simplification. DAG size of input: 38 DAG size of output: 24 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 21:51:48,145 INFO L130 PetriNetUnfolder]: 500/1577 cut-off events. [2023-08-29 21:51:48,145 INFO L131 PetriNetUnfolder]: For 6741/6745 co-relation queries the response was YES. [2023-08-29 21:51:48,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6941 conditions, 1577 events. 500/1577 cut-off events. For 6741/6745 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 9736 event pairs, 41 based on Foata normal form. 5/1581 useless extension candidates. Maximal degree in co-relation 6860. Up to 390 conditions per place. [2023-08-29 21:51:48,157 INFO L137 encePairwiseOnDemand]: 521/531 looper letters, 169 selfloop transitions, 69 changer transitions 0/242 dead transitions. [2023-08-29 21:51:48,157 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 242 transitions, 2624 flow [2023-08-29 21:51:48,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-29 21:51:48,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-29 21:51:48,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1811 transitions. [2023-08-29 21:51:48,161 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3100496490326999 [2023-08-29 21:51:48,161 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1811 transitions. [2023-08-29 21:51:48,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1811 transitions. [2023-08-29 21:51:48,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:51:48,162 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1811 transitions. [2023-08-29 21:51:48,164 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 164.63636363636363) internal successors, (1811), 11 states have internal predecessors, (1811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:51:48,168 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 531.0) internal successors, (6372), 12 states have internal predecessors, (6372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:51:48,169 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 531.0) internal successors, (6372), 12 states have internal predecessors, (6372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:51:48,169 INFO L175 Difference]: Start difference. First operand has 115 places, 152 transitions, 1410 flow. Second operand 11 states and 1811 transitions. [2023-08-29 21:51:48,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 242 transitions, 2624 flow [2023-08-29 21:51:48,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 242 transitions, 2557 flow, removed 27 selfloop flow, removed 3 redundant places. [2023-08-29 21:51:48,204 INFO L231 Difference]: Finished difference. Result has 129 places, 184 transitions, 2015 flow [2023-08-29 21:51:48,205 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=1355, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2015, PETRI_PLACES=129, PETRI_TRANSITIONS=184} [2023-08-29 21:51:48,205 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, 30 predicate places. [2023-08-29 21:51:48,205 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 184 transitions, 2015 flow [2023-08-29 21:51:48,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 159.47826086956522) internal successors, (3668), 23 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:51:48,206 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:51:48,206 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:51:48,217 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-08-29 21:51:48,416 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,SelfDestructingSolverStorable14 [2023-08-29 21:51:48,417 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:51:48,417 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:51:48,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1335793072, now seen corresponding path program 3 times [2023-08-29 21:51:48,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:51:48,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109264697] [2023-08-29 21:51:48,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:51:48,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:51:48,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:51:48,860 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:51:48,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:51:48,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109264697] [2023-08-29 21:51:48,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109264697] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:51:48,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104439354] [2023-08-29 21:51:48,861 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-29 21:51:48,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:51:48,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:51:48,863 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-08-29 21:51:48,865 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-08-29 21:51:48,991 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-29 21:51:48,991 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 21:51:48,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 41 conjunts are in the unsatisfiable core [2023-08-29 21:51:48,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:51:49,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-29 21:51:49,173 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-08-29 21:51:49,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2023-08-29 21:51:49,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-29 21:51:49,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-29 21:51:49,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-08-29 21:51:53,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-29 21:51:54,341 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:51:54,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 21:51:54,360 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_808 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_808) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2023-08-29 21:51:54,373 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_808 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_101| Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_808) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_101|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_101| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)))) is different from false [2023-08-29 21:51:56,383 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_808 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_101| Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_808) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_101|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_101| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-08-29 21:51:58,413 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_806 Int) (v_ArrVal_808 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_101| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_101| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_806)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_808) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_101|) 0))) is different from false [2023-08-29 21:51:58,480 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_806 Int) (v_ArrVal_808 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_101| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_102| Int)) (or (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_102| v_ArrVal_806)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_808) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_101|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_101| (+ 28 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_102|)))) is different from false [2023-08-29 21:51:58,506 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_803 (Array Int Int)) (v_ArrVal_806 Int) (v_ArrVal_808 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_101| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_102| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_101| (+ 28 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_102|)) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_803))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_102| v_ArrVal_806))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_808) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_101|) 0))) is different from false [2023-08-29 21:51:58,706 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 3 not checked. [2023-08-29 21:51:58,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104439354] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 21:51:58,707 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 21:51:58,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 22 [2023-08-29 21:51:58,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71525213] [2023-08-29 21:51:58,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 21:51:58,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-08-29 21:51:58,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:51:58,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-08-29 21:51:58,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=245, Unknown=10, NotChecked=222, Total=552 [2023-08-29 21:51:58,910 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 531 [2023-08-29 21:51:58,912 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 184 transitions, 2015 flow. Second operand has 24 states, 24 states have (on average 158.70833333333334) internal successors, (3809), 24 states have internal predecessors, (3809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:51:58,912 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:51:58,912 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 531 [2023-08-29 21:51:58,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:52:00,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:52:02,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:52:05,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:52:06,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:52:07,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:52:08,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:52:09,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:52:11,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:52:17,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:52:19,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:52:20,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:52:21,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:52:22,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:52:23,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:52:24,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:52:25,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:52:26,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:52:28,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:52:29,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:52:30,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:52:31,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:52:32,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:52:55,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:52:56,077 INFO L130 PetriNetUnfolder]: 513/1653 cut-off events. [2023-08-29 21:52:56,077 INFO L131 PetriNetUnfolder]: For 9127/9131 co-relation queries the response was YES. [2023-08-29 21:52:56,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7699 conditions, 1653 events. 513/1653 cut-off events. For 9127/9131 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 10434 event pairs, 35 based on Foata normal form. 5/1657 useless extension candidates. Maximal degree in co-relation 7610. Up to 352 conditions per place. [2023-08-29 21:52:56,090 INFO L137 encePairwiseOnDemand]: 518/531 looper letters, 165 selfloop transitions, 91 changer transitions 0/260 dead transitions. [2023-08-29 21:52:56,091 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 260 transitions, 3197 flow [2023-08-29 21:52:56,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-29 21:52:56,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-29 21:52:56,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1961 transitions. [2023-08-29 21:52:56,094 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30775266792215944 [2023-08-29 21:52:56,094 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1961 transitions. [2023-08-29 21:52:56,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1961 transitions. [2023-08-29 21:52:56,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:52:56,095 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1961 transitions. [2023-08-29 21:52:56,098 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 163.41666666666666) internal successors, (1961), 12 states have internal predecessors, (1961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:52:56,102 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 531.0) internal successors, (6903), 13 states have internal predecessors, (6903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:52:56,103 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 531.0) internal successors, (6903), 13 states have internal predecessors, (6903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:52:56,103 INFO L175 Difference]: Start difference. First operand has 129 places, 184 transitions, 2015 flow. Second operand 12 states and 1961 transitions. [2023-08-29 21:52:56,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 260 transitions, 3197 flow [2023-08-29 21:52:56,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 260 transitions, 3137 flow, removed 17 selfloop flow, removed 3 redundant places. [2023-08-29 21:52:56,146 INFO L231 Difference]: Finished difference. Result has 144 places, 206 transitions, 2540 flow [2023-08-29 21:52:56,146 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=1960, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2540, PETRI_PLACES=144, PETRI_TRANSITIONS=206} [2023-08-29 21:52:56,146 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, 45 predicate places. [2023-08-29 21:52:56,146 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 206 transitions, 2540 flow [2023-08-29 21:52:56,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 158.70833333333334) internal successors, (3809), 24 states have internal predecessors, (3809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:52:56,147 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:52:56,147 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2023-08-29 21:52:56,157 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-08-29 21:52:56,353 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,SelfDestructingSolverStorable15 [2023-08-29 21:52:56,354 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:52:56,354 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:52:56,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1018858754, now seen corresponding path program 2 times [2023-08-29 21:52:56,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:52:56,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458462818] [2023-08-29 21:52:56,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:52:56,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:52:56,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:52:56,791 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:52:56,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:52:56,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458462818] [2023-08-29 21:52:56,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458462818] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:52:56,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800497940] [2023-08-29 21:52:56,792 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 21:52:56,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:52:56,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:52:56,797 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-08-29 21:52:56,801 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-08-29 21:52:56,953 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-29 21:52:56,953 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 21:52:56,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-29 21:52:56,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:52:57,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 21:52:57,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-29 21:52:57,454 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 40 proven. 8 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:52:57,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 21:53:00,104 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:53:00,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800497940] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 21:53:00,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 21:53:00,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 27 [2023-08-29 21:53:00,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084712248] [2023-08-29 21:53:00,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 21:53:00,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-29 21:53:00,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:53:00,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-29 21:53:00,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=644, Unknown=0, NotChecked=0, Total=812 [2023-08-29 21:53:03,008 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 531 [2023-08-29 21:53:03,011 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 206 transitions, 2540 flow. Second operand has 29 states, 29 states have (on average 201.0) internal successors, (5829), 29 states have internal predecessors, (5829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:53:03,011 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:53:03,011 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 531 [2023-08-29 21:53:03,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:53:04,072 INFO L130 PetriNetUnfolder]: 627/2001 cut-off events. [2023-08-29 21:53:04,072 INFO L131 PetriNetUnfolder]: For 15065/15069 co-relation queries the response was YES. [2023-08-29 21:53:04,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10312 conditions, 2001 events. 627/2001 cut-off events. For 15065/15069 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 12837 event pairs, 61 based on Foata normal form. 59/2059 useless extension candidates. Maximal degree in co-relation 10216. Up to 452 conditions per place. [2023-08-29 21:53:04,089 INFO L137 encePairwiseOnDemand]: 524/531 looper letters, 435 selfloop transitions, 52 changer transitions 102/593 dead transitions. [2023-08-29 21:53:04,089 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 593 transitions, 8225 flow [2023-08-29 21:53:04,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-29 21:53:04,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-29 21:53:04,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2692 transitions. [2023-08-29 21:53:04,095 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3899753730262205 [2023-08-29 21:53:04,095 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2692 transitions. [2023-08-29 21:53:04,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2692 transitions. [2023-08-29 21:53:04,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 21:53:04,097 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2692 transitions. [2023-08-29 21:53:04,100 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 207.07692307692307) internal successors, (2692), 13 states have internal predecessors, (2692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:53:04,104 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 531.0) internal successors, (7434), 14 states have internal predecessors, (7434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:53:04,105 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 531.0) internal successors, (7434), 14 states have internal predecessors, (7434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:53:04,105 INFO L175 Difference]: Start difference. First operand has 144 places, 206 transitions, 2540 flow. Second operand 13 states and 2692 transitions. [2023-08-29 21:53:04,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 593 transitions, 8225 flow [2023-08-29 21:53:04,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 593 transitions, 8072 flow, removed 24 selfloop flow, removed 7 redundant places. [2023-08-29 21:53:04,169 INFO L231 Difference]: Finished difference. Result has 148 places, 188 transitions, 2395 flow [2023-08-29 21:53:04,170 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=2372, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2395, PETRI_PLACES=148, PETRI_TRANSITIONS=188} [2023-08-29 21:53:04,170 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, 49 predicate places. [2023-08-29 21:53:04,170 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 188 transitions, 2395 flow [2023-08-29 21:53:04,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 201.0) internal successors, (5829), 29 states have internal predecessors, (5829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:53:04,171 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 21:53:04,171 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 21:53:04,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-08-29 21:53:04,377 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,SelfDestructingSolverStorable16 [2023-08-29 21:53:04,378 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2023-08-29 21:53:04,378 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 21:53:04,378 INFO L85 PathProgramCache]: Analyzing trace with hash -568249598, now seen corresponding path program 4 times [2023-08-29 21:53:04,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 21:53:04,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598454041] [2023-08-29 21:53:04,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 21:53:04,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 21:53:04,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 21:53:05,351 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:53:05,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 21:53:05,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598454041] [2023-08-29 21:53:05,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598454041] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 21:53:05,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130290584] [2023-08-29 21:53:05,352 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-29 21:53:05,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 21:53:05,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 21:53:05,353 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-08-29 21:53:05,356 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-08-29 21:53:05,526 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-29 21:53:05,526 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 21:53:05,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 48 conjunts are in the unsatisfiable core [2023-08-29 21:53:05,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 21:53:05,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-29 21:53:05,600 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 21:53:05,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-29 21:53:05,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-29 21:53:05,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-29 21:53:05,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-29 21:53:05,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-08-29 21:53:09,482 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-08-29 21:53:09,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2023-08-29 21:53:23,178 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-29 21:53:23,179 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 21:53:37,233 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_111| Int)) (or (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_111|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_111| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-08-29 21:53:39,252 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1068 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_111| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_111| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1068)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_111|) 0))) is different from false [2023-08-29 21:53:41,305 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1068 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_111| Int)) (let ((.cse0 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (or (= (select (store (select |c_#memory_int| |c_~#cache~0.base|) (+ .cse0 |c_~#cache~0.offset|) v_ArrVal_1068) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_111|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_111| (+ .cse0 28 |c_~#cache~0.offset|))))) is different from false [2023-08-29 21:53:43,325 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_83| Int)) (or (forall ((v_ArrVal_1068 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_111| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_83| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_111| (+ 28 |c_~#cache~0.offset| .cse0)) (= (select (store (select |c_#memory_int| |c_~#cache~0.base|) (+ |c_~#cache~0.offset| .cse0) v_ArrVal_1068) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_111|) 0)))) (< |v_t_funThread1of1ForFork0_~i~0#1_83| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)))) is different from false [2023-08-29 21:54:40,752 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1063 Int) (|v_t_funThread1of1ForFork0_~i~0#1_83| Int) (v_ArrVal_1068 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_111| Int) (v_ArrVal_1060 Int) (v_ArrVal_1062 (Array Int Int))) (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_83| 28))) (or (= (select (store (select (let ((.cse0 (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1060)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1062))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1063))) |c_~#cache~0.base|) (+ |c_~#cache~0.offset| .cse1) v_ArrVal_1068) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_111|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_111| (+ 28 |c_~#cache~0.offset| .cse1)) (< |v_t_funThread1of1ForFork0_~i~0#1_83| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1))))) is different from false [2023-08-29 21:54:40,831 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1063 Int) (|v_t_funThread1of1ForFork0_~i~0#1_83| Int) (v_ArrVal_1068 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_111| Int) (|~#cache~0.offset| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_113| Int) (v_ArrVal_1060 Int) (v_ArrVal_1062 (Array Int Int))) (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_83| 28))) (let ((.cse0 (+ |~#cache~0.offset| .cse1))) (or (< .cse0 (+ 28 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_113|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_111| (+ |~#cache~0.offset| 28 .cse1)) (= (select (store (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_113| v_ArrVal_1060)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1062) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_113| v_ArrVal_1063) .cse0 v_ArrVal_1068) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_111|) 0))))) is different from false [2023-08-29 21:54:40,892 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1063 Int) (v_ArrVal_1059 (Array Int Int)) (|v_t_funThread1of1ForFork0_~i~0#1_83| Int) (v_ArrVal_1068 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_111| Int) (|~#cache~0.offset| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_113| Int) (v_ArrVal_1060 Int) (v_ArrVal_1062 (Array Int Int))) (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_83| 28))) (let ((.cse0 (+ |~#cache~0.offset| .cse1))) (or (< .cse0 (+ 28 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_113|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_111| (+ |~#cache~0.offset| 28 .cse1)) (= (select (store (store (select (store (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1059))) (store .cse2 |c_~#cache~0.base| (store (select .cse2 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_113| v_ArrVal_1060))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1062) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_113| v_ArrVal_1063) .cse0 v_ArrVal_1068) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_111|) 0))))) is different from false [2023-08-29 21:54:41,220 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 18 not checked. [2023-08-29 21:54:41,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130290584] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 21:54:41,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 21:54:41,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 31 [2023-08-29 21:54:41,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901738610] [2023-08-29 21:54:41,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 21:54:41,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-08-29 21:54:41,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 21:54:41,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-08-29 21:54:41,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=470, Unknown=62, NotChecked=378, Total=1056 [2023-08-29 21:54:41,457 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 531 [2023-08-29 21:54:41,460 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 188 transitions, 2395 flow. Second operand has 33 states, 33 states have (on average 159.72727272727272) internal successors, (5271), 33 states have internal predecessors, (5271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 21:54:41,460 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 21:54:41,460 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 531 [2023-08-29 21:54:41,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 21:54:42,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:54:44,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 [0] [2023-08-29 21:54:45,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:54:47,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:54:49,158 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 [0] [2023-08-29 21:54:50,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:54:51,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:54:53,789 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 [0] [2023-08-29 21:54:55,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:55:01,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:55:03,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:55:05,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:55:11,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:55:13,736 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 [0] [2023-08-29 21:55:15,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:55:16,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:55:18,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:55:19,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:55:21,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:55:22,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:55:23,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:55:25,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:55:27,172 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 [0] [2023-08-29 21:55:28,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:55:30,343 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 [0] [2023-08-29 21:55:31,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:55:32,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:55:44,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:55:46,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:55:48,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:55:49,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:55:50,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:55:52,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:55:54,655 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 [0] [2023-08-29 21:55:55,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:55:57,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:55:59,259 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 [0] [2023-08-29 21:56:01,266 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 [0] [2023-08-29 21:56:02,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:56:04,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:56:13,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:56:15,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 [0] [2023-08-29 21:56:17,298 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 [0] [2023-08-29 21:56:18,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:56:20,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:56:22,354 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 [0] [2023-08-29 21:56:24,367 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 [0] [2023-08-29 21:56:36,465 WARN L222 SmtUtils]: Spent 6.06s on a formula simplification. DAG size of input: 69 DAG size of output: 40 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 21:56:50,566 WARN L222 SmtUtils]: Spent 8.07s on a formula simplification. DAG size of input: 50 DAG size of output: 44 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 21:56:52,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-29 21:57:09,383 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 [0] [2023-08-29 21:57:21,973 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 [0] [2023-08-29 21:57:23,994 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 [0, 1] [2023-08-29 21:57:26,014 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 [0, 1] [2023-08-29 21:57:28,039 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 [0, 1] [2023-08-29 21:57:30,067 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 [0, 1] [2023-08-29 21:57:32,098 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 [0, 1] [2023-08-29 21:57:34,143 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 [0, 1] [2023-08-29 21:57:38,236 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 [0, 1] [2023-08-29 21:57:40,241 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 [0, 1] [2023-08-29 21:57:42,245 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-08-29 21:57:44,252 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-08-29 21:57:46,260 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-08-29 21:57:48,264 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 [0, 1] [2023-08-29 21:57:50,274 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-08-29 21:57:52,280 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-08-29 21:57:54,284 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-08-29 21:57:56,289 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 [0, 1] [2023-08-29 21:57:58,294 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-08-29 21:58:00,300 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 [0, 1] [2023-08-29 21:58:02,305 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 [0, 1] [2023-08-29 21:58:04,313 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-08-29 21:58:06,325 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-08-29 21:58:08,330 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 [0, 1] [2023-08-29 21:58:10,338 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-08-29 21:58:12,343 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-08-29 21:58:14,353 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 [0, 1] [2023-08-29 21:58:16,374 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 [0, 1] [2023-08-29 21:58:18,399 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 [0, 1] [2023-08-29 21:58:20,428 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-08-29 21:58:22,432 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-08-29 21:58:24,439 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-08-29 21:58:26,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 21:58:28,448 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-08-29 21:58:30,455 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-08-29 21:59:02,597 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 [0, 1] [2023-08-29 21:59:04,602 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 [0, 1] [2023-08-29 21:59:06,605 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-08-29 21:59:08,611 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-08-29 21:59:10,614 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-08-29 21:59:12,625 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 [0, 1] [2023-08-29 21:59:14,630 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-08-29 21:59:16,635 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-08-29 21:59:18,640 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-08-29 21:59:20,645 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 [0, 1] [2023-08-29 21:59:22,650 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-08-29 21:59:24,659 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 [0, 1] [2023-08-29 21:59:43,984 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 [0, 1] [2023-08-29 21:59:59,877 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 [0, 1] [2023-08-29 22:00:01,884 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 [0, 1] [2023-08-29 22:00:03,889 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-08-29 22:00:05,901 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-08-29 22:00:07,911 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 [0, 1] [2023-08-29 22:00:09,917 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-08-29 22:00:11,922 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-08-29 22:00:13,928 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-08-29 22:00:15,932 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 [0, 1] [2023-08-29 22:00:17,936 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-08-29 22:00:19,950 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 [0, 1] [2023-08-29 22:00:21,955 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 [0, 1] [2023-08-29 22:00:23,959 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-08-29 22:00:25,970 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-08-29 22:00:27,974 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-08-29 22:00:29,979 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 [0, 1] [2023-08-29 22:00:31,986 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-08-29 22:00:33,993 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-08-29 22:00:35,998 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-08-29 22:00:38,010 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 [0, 1] [2023-08-29 22:00:40,014 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-08-29 22:00:42,020 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 [0, 1] [2023-08-29 22:00:44,025 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 [0, 1] [2023-08-29 22:00:46,030 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-08-29 22:00:48,036 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-08-29 22:00:50,047 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-08-29 22:00:52,060 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 [0, 1] [2023-08-29 22:00:54,068 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-08-29 22:00:56,086 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-08-29 22:00:58,091 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-08-29 22:01:00,100 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 [0, 1] [2023-08-29 22:01:02,105 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-08-29 22:01:04,146 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 [0, 1] [2023-08-29 22:01:06,156 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 [0, 1] [2023-08-29 22:01:08,188 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 [0, 1] [2023-08-29 22:01:10,208 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 [0, 1] [2023-08-29 22:01:12,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 [0, 1] [2023-08-29 22:01:30,526 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 [0, 1] [2023-08-29 22:01:32,530 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 [0, 1] [2023-08-29 22:01:34,546 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-08-29 22:01:36,555 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-08-29 22:01:38,559 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 [0, 1] [2023-08-29 22:01:40,564 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-08-29 22:01:42,568 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-08-29 22:01:44,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-08-29 22:01:46,575 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 [0, 1] [2023-08-29 22:01:48,579 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 [0, 1] [2023-08-29 22:01:50,583 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-08-29 22:01:52,595 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 [0, 1] [2023-08-29 22:01:54,643 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-08-29 22:01:56,651 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-08-29 22:01:58,657 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 [0, 1] [2023-08-29 22:02:00,664 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-08-29 22:02:02,668 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-08-29 22:02:04,671 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-08-29 22:02:06,676 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 [0, 1] [2023-08-29 22:02:08,755 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-08-29 22:02:10,758 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-08-29 22:02:19,940 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 [0, 1] [2023-08-29 22:02:21,973 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 [0, 1] [2023-08-29 22:02:23,990 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 [0, 1] [2023-08-29 22:02:26,017 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 [0, 1] [2023-08-29 22:02:28,043 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 [0, 1] [2023-08-29 22:02:30,076 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 [0, 1] [2023-08-29 22:02:32,085 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 [0, 1] [2023-08-29 22:02:34,107 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-08-29 22:02:35,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 22:02:37,692 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-08-29 22:02:39,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-29 22:02:41,160 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-08-29 22:02:43,168 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 [0, 1] Killed by 15