./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-ext/36_stack_cas_p0_vs_concur.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-ext/36_stack_cas_p0_vs_concur.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 e7fe0631e7f950e2868c8cb954edca4f6de3fdffbf6debba58771511fbac2e8b --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 20:02:00,423 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:02:00,425 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:02:00,464 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:02:00,465 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:02:00,468 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:02:00,469 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:02:00,471 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:02:00,473 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:02:00,477 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:02:00,478 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:02:00,480 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:02:00,480 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:02:00,486 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:02:00,487 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:02:00,490 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:02:00,491 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:02:00,492 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:02:00,493 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:02:00,498 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:02:00,505 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:02:00,506 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:02:00,507 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:02:00,508 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:02:00,514 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:02:00,514 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:02:00,515 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:02:00,516 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:02:00,517 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:02:00,517 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:02:00,518 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:02:00,519 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:02:00,521 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:02:00,521 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:02:00,522 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:02:00,522 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:02:00,523 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:02:00,523 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:02:00,523 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:02:00,524 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:02:00,525 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:02:00,526 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-29 20:02:00,558 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:02:00,559 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:02:00,560 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:02:00,560 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:02:00,561 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:02:00,561 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:02:00,561 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:02:00,562 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:02:00,562 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:02:00,562 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:02:00,563 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:02:00,563 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:02:00,563 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:02:00,563 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:02:00,564 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:02:00,564 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:02:00,564 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:02:00,564 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:02:00,564 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:02:00,565 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:02:00,565 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:02:00,565 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:02:00,565 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:02:00,565 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:02:00,565 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:02:00,566 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:02:00,566 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:02:00,566 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:02:00,566 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 20:02:00,566 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 20:02:00,567 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:02:00,567 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:02:00,567 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:02:00,567 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:02:00,568 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 -> e7fe0631e7f950e2868c8cb954edca4f6de3fdffbf6debba58771511fbac2e8b Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-29 20:02:00,870 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:02:00,889 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:02:00,892 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:02:00,893 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:02:00,893 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:02:00,894 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/36_stack_cas_p0_vs_concur.i [2023-08-29 20:02:02,142 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:02:02,401 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:02:02,402 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/36_stack_cas_p0_vs_concur.i [2023-08-29 20:02:02,413 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/184143c7d/80ec2e908bf449da866ffddf9b0b2f4e/FLAGe172ec509 [2023-08-29 20:02:02,427 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/184143c7d/80ec2e908bf449da866ffddf9b0b2f4e [2023-08-29 20:02:02,429 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:02:02,431 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:02:02,432 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:02:02,433 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:02:02,435 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:02:02,436 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:02:02" (1/1) ... [2023-08-29 20:02:02,437 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c5e36ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:02:02, skipping insertion in model container [2023-08-29 20:02:02,437 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:02:02" (1/1) ... [2023-08-29 20:02:02,442 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:02:02,474 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:02:02,710 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/36_stack_cas_p0_vs_concur.i[30687,30700] [2023-08-29 20:02:02,716 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:02:02,726 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:02:02,782 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/36_stack_cas_p0_vs_concur.i[30687,30700] [2023-08-29 20:02:02,784 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:02:02,841 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:02:02,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:02:02 WrapperNode [2023-08-29 20:02:02,842 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:02:02,843 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:02:02,843 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:02:02,843 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:02:02,849 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:02:02" (1/1) ... [2023-08-29 20:02:02,878 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:02:02" (1/1) ... [2023-08-29 20:02:02,906 INFO L138 Inliner]: procedures = 170, calls = 35, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 104 [2023-08-29 20:02:02,906 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:02:02,908 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:02:02,908 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:02:02,908 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:02:02,915 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:02:02" (1/1) ... [2023-08-29 20:02:02,916 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:02:02" (1/1) ... [2023-08-29 20:02:02,930 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:02:02" (1/1) ... [2023-08-29 20:02:02,936 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:02:02" (1/1) ... [2023-08-29 20:02:02,941 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:02:02" (1/1) ... [2023-08-29 20:02:02,949 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:02:02" (1/1) ... [2023-08-29 20:02:02,951 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:02:02" (1/1) ... [2023-08-29 20:02:02,958 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:02:02" (1/1) ... [2023-08-29 20:02:02,960 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:02:02,961 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:02:02,961 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:02:02,961 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:02:02,962 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:02:02" (1/1) ... [2023-08-29 20:02:02,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:02:02,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:02:02,997 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-29 20:02:03,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-29 20:02:03,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-29 20:02:03,036 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-08-29 20:02:03,037 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-08-29 20:02:03,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 20:02:03,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:02:03,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:02:03,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:02:03,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-29 20:02:03,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:02:03,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:02:03,040 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 20:02:03,187 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:02:03,197 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:02:03,436 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:02:03,535 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:02:03,536 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-29 20:02:03,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:02:03 BoogieIcfgContainer [2023-08-29 20:02:03,538 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:02:03,540 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:02:03,540 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:02:03,542 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:02:03,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:02:02" (1/3) ... [2023-08-29 20:02:03,543 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47b0d139 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:02:03, skipping insertion in model container [2023-08-29 20:02:03,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:02:02" (2/3) ... [2023-08-29 20:02:03,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47b0d139 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:02:03, skipping insertion in model container [2023-08-29 20:02:03,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:02:03" (3/3) ... [2023-08-29 20:02:03,545 INFO L112 eAbstractionObserver]: Analyzing ICFG 36_stack_cas_p0_vs_concur.i [2023-08-29 20:02:03,559 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:02:03,560 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 32 error locations. [2023-08-29 20:02:03,560 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:02:03,643 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:02:03,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 127 transitions, 259 flow [2023-08-29 20:02:03,755 INFO L130 PetriNetUnfolder]: 10/142 cut-off events. [2023-08-29 20:02:03,755 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:02:03,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 142 events. 10/142 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 299 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 109. Up to 4 conditions per place. [2023-08-29 20:02:03,761 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 127 transitions, 259 flow [2023-08-29 20:02:03,768 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 127 transitions, 259 flow [2023-08-29 20:02:03,772 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:02:03,790 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 127 transitions, 259 flow [2023-08-29 20:02:03,800 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 127 transitions, 259 flow [2023-08-29 20:02:03,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 127 transitions, 259 flow [2023-08-29 20:02:03,850 INFO L130 PetriNetUnfolder]: 10/142 cut-off events. [2023-08-29 20:02:03,851 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:02:03,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 142 events. 10/142 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 299 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 109. Up to 4 conditions per place. [2023-08-29 20:02:03,854 INFO L119 LiptonReduction]: Number of co-enabled transitions 3312 [2023-08-29 20:02:06,460 INFO L134 LiptonReduction]: Checked pairs total: 8292 [2023-08-29 20:02:06,461 INFO L136 LiptonReduction]: Total number of compositions: 112 [2023-08-29 20:02:06,482 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:02:06,489 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;@215e7758, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:02:06,489 INFO L358 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2023-08-29 20:02:06,497 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2023-08-29 20:02:06,498 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:02:06,498 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:02:06,499 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-29 20:02:06,500 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err28ASSERT_VIOLATIONMEMORY_LEAK, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-29 20:02:06,505 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:02:06,505 INFO L85 PathProgramCache]: Analyzing trace with hash 19236, now seen corresponding path program 1 times [2023-08-29 20:02:06,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:02:06,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974330298] [2023-08-29 20:02:06,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:02:06,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:02:06,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:02:06,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:02:06,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:02:06,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974330298] [2023-08-29 20:02:06,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974330298] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:02:06,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:02:06,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:02:06,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615730686] [2023-08-29 20:02:06,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:02:06,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:02:06,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:02:06,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:02:06,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:02:06,764 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 239 [2023-08-29 20:02:06,767 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 58 transitions, 121 flow. Second operand has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:06,767 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:02:06,767 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 239 [2023-08-29 20:02:06,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:02:06,938 INFO L130 PetriNetUnfolder]: 218/531 cut-off events. [2023-08-29 20:02:06,938 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:02:06,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1037 conditions, 531 events. 218/531 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2238 event pairs, 111 based on Foata normal form. 0/266 useless extension candidates. Maximal degree in co-relation 1006. Up to 259 conditions per place. [2023-08-29 20:02:06,943 INFO L137 encePairwiseOnDemand]: 225/239 looper letters, 69 selfloop transitions, 4 changer transitions 0/80 dead transitions. [2023-08-29 20:02:06,943 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 80 transitions, 311 flow [2023-08-29 20:02:06,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:02:06,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:02:06,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 371 transitions. [2023-08-29 20:02:06,955 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5174337517433751 [2023-08-29 20:02:06,956 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 371 transitions. [2023-08-29 20:02:06,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 371 transitions. [2023-08-29 20:02:06,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:02:06,959 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 371 transitions. [2023-08-29 20:02:06,963 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:06,967 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:06,967 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:06,969 INFO L175 Difference]: Start difference. First operand has 58 places, 58 transitions, 121 flow. Second operand 3 states and 371 transitions. [2023-08-29 20:02:06,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 80 transitions, 311 flow [2023-08-29 20:02:06,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 80 transitions, 311 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:02:06,974 INFO L231 Difference]: Finished difference. Result has 50 places, 48 transitions, 125 flow [2023-08-29 20:02:06,975 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=125, PETRI_PLACES=50, PETRI_TRANSITIONS=48} [2023-08-29 20:02:06,978 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -8 predicate places. [2023-08-29 20:02:06,979 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 48 transitions, 125 flow [2023-08-29 20:02:06,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:06,979 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:02:06,979 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-29 20:02:06,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 20:02:06,980 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err28ASSERT_VIOLATIONMEMORY_LEAK, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-29 20:02:06,980 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:02:06,980 INFO L85 PathProgramCache]: Analyzing trace with hash 19234, now seen corresponding path program 1 times [2023-08-29 20:02:06,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:02:06,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819618216] [2023-08-29 20:02:06,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:02:06,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:02:06,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:02:07,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:02:07,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:02:07,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819618216] [2023-08-29 20:02:07,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819618216] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:02:07,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:02:07,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:02:07,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345518233] [2023-08-29 20:02:07,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:02:07,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:02:07,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:02:07,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:02:07,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:02:07,110 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 239 [2023-08-29 20:02:07,110 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 48 transitions, 125 flow. Second operand has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:07,111 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:02:07,111 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 239 [2023-08-29 20:02:07,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:02:07,285 INFO L130 PetriNetUnfolder]: 225/600 cut-off events. [2023-08-29 20:02:07,285 INFO L131 PetriNetUnfolder]: For 154/154 co-relation queries the response was YES. [2023-08-29 20:02:07,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1329 conditions, 600 events. 225/600 cut-off events. For 154/154 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2918 event pairs, 90 based on Foata normal form. 2/399 useless extension candidates. Maximal degree in co-relation 1247. Up to 442 conditions per place. [2023-08-29 20:02:07,289 INFO L137 encePairwiseOnDemand]: 232/239 looper letters, 70 selfloop transitions, 7 changer transitions 0/83 dead transitions. [2023-08-29 20:02:07,290 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 83 transitions, 357 flow [2023-08-29 20:02:07,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:02:07,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:02:07,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2023-08-29 20:02:07,293 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5062761506276151 [2023-08-29 20:02:07,293 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 363 transitions. [2023-08-29 20:02:07,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 363 transitions. [2023-08-29 20:02:07,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:02:07,293 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 363 transitions. [2023-08-29 20:02:07,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:07,296 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:07,297 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:07,297 INFO L175 Difference]: Start difference. First operand has 50 places, 48 transitions, 125 flow. Second operand 3 states and 363 transitions. [2023-08-29 20:02:07,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 83 transitions, 357 flow [2023-08-29 20:02:07,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 83 transitions, 347 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:02:07,301 INFO L231 Difference]: Finished difference. Result has 52 places, 53 transitions, 169 flow [2023-08-29 20:02:07,301 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=169, PETRI_PLACES=52, PETRI_TRANSITIONS=53} [2023-08-29 20:02:07,302 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -6 predicate places. [2023-08-29 20:02:07,302 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 53 transitions, 169 flow [2023-08-29 20:02:07,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:07,302 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:02:07,303 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-29 20:02:07,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-29 20:02:07,303 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err28ASSERT_VIOLATIONMEMORY_LEAK, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-29 20:02:07,303 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:02:07,304 INFO L85 PathProgramCache]: Analyzing trace with hash 598193049, now seen corresponding path program 1 times [2023-08-29 20:02:07,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:02:07,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315417869] [2023-08-29 20:02:07,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:02:07,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:02:07,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:02:07,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:02:07,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:02:07,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315417869] [2023-08-29 20:02:07,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315417869] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:02:07,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:02:07,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:02:07,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214311250] [2023-08-29 20:02:07,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:02:07,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:02:07,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:02:07,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:02:07,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:02:07,544 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 239 [2023-08-29 20:02:07,545 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 53 transitions, 169 flow. Second operand has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:07,545 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:02:07,545 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 239 [2023-08-29 20:02:07,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:02:07,649 INFO L130 PetriNetUnfolder]: 173/432 cut-off events. [2023-08-29 20:02:07,650 INFO L131 PetriNetUnfolder]: For 338/338 co-relation queries the response was YES. [2023-08-29 20:02:07,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1109 conditions, 432 events. 173/432 cut-off events. For 338/338 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1743 event pairs, 69 based on Foata normal form. 10/309 useless extension candidates. Maximal degree in co-relation 1080. Up to 354 conditions per place. [2023-08-29 20:02:07,652 INFO L137 encePairwiseOnDemand]: 228/239 looper letters, 36 selfloop transitions, 4 changer transitions 0/46 dead transitions. [2023-08-29 20:02:07,652 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 46 transitions, 233 flow [2023-08-29 20:02:07,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:02:07,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:02:07,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 302 transitions. [2023-08-29 20:02:07,655 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4211994421199442 [2023-08-29 20:02:07,655 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 302 transitions. [2023-08-29 20:02:07,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 302 transitions. [2023-08-29 20:02:07,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:02:07,656 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 302 transitions. [2023-08-29 20:02:07,656 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:07,658 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:07,658 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:07,659 INFO L175 Difference]: Start difference. First operand has 52 places, 53 transitions, 169 flow. Second operand 3 states and 302 transitions. [2023-08-29 20:02:07,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 46 transitions, 233 flow [2023-08-29 20:02:07,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 46 transitions, 221 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:02:07,661 INFO L231 Difference]: Finished difference. Result has 43 places, 42 transitions, 133 flow [2023-08-29 20:02:07,661 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=133, PETRI_PLACES=43, PETRI_TRANSITIONS=42} [2023-08-29 20:02:07,662 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -15 predicate places. [2023-08-29 20:02:07,662 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 42 transitions, 133 flow [2023-08-29 20:02:07,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:07,663 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:02:07,663 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:02:07,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-29 20:02:07,663 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err28ASSERT_VIOLATIONMEMORY_LEAK, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-29 20:02:07,664 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:02:07,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1367601857, now seen corresponding path program 1 times [2023-08-29 20:02:07,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:02:07,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584907350] [2023-08-29 20:02:07,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:02:07,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:02:07,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:02:07,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-29 20:02:07,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:02:07,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584907350] [2023-08-29 20:02:07,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584907350] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:02:07,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:02:07,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:02:07,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809807675] [2023-08-29 20:02:07,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:02:07,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:02:07,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:02:07,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:02:07,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:02:07,909 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 239 [2023-08-29 20:02:07,910 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 42 transitions, 133 flow. Second operand has 4 states, 4 states have (on average 93.5) internal successors, (374), 4 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:07,910 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:02:07,910 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 239 [2023-08-29 20:02:07,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:02:08,033 INFO L130 PetriNetUnfolder]: 125/338 cut-off events. [2023-08-29 20:02:08,034 INFO L131 PetriNetUnfolder]: For 215/217 co-relation queries the response was YES. [2023-08-29 20:02:08,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 837 conditions, 338 events. 125/338 cut-off events. For 215/217 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1260 event pairs, 62 based on Foata normal form. 46/276 useless extension candidates. Maximal degree in co-relation 803. Up to 157 conditions per place. [2023-08-29 20:02:08,036 INFO L137 encePairwiseOnDemand]: 234/239 looper letters, 55 selfloop transitions, 4 changer transitions 0/65 dead transitions. [2023-08-29 20:02:08,036 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 65 transitions, 299 flow [2023-08-29 20:02:08,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:02:08,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:02:08,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 427 transitions. [2023-08-29 20:02:08,041 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.446652719665272 [2023-08-29 20:02:08,041 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 427 transitions. [2023-08-29 20:02:08,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 427 transitions. [2023-08-29 20:02:08,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:02:08,042 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 427 transitions. [2023-08-29 20:02:08,043 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 106.75) internal successors, (427), 4 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:08,045 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 239.0) internal successors, (1195), 5 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:08,046 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 239.0) internal successors, (1195), 5 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:08,046 INFO L175 Difference]: Start difference. First operand has 43 places, 42 transitions, 133 flow. Second operand 4 states and 427 transitions. [2023-08-29 20:02:08,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 65 transitions, 299 flow [2023-08-29 20:02:08,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 65 transitions, 289 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:02:08,053 INFO L231 Difference]: Finished difference. Result has 43 places, 41 transitions, 129 flow [2023-08-29 20:02:08,054 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=129, PETRI_PLACES=43, PETRI_TRANSITIONS=41} [2023-08-29 20:02:08,055 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -15 predicate places. [2023-08-29 20:02:08,055 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 41 transitions, 129 flow [2023-08-29 20:02:08,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.5) internal successors, (374), 4 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:08,056 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:02:08,056 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:02:08,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-29 20:02:08,056 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err8ASSERT_VIOLATIONARRAY_INDEX === [thr1Err28ASSERT_VIOLATIONMEMORY_LEAK, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-29 20:02:08,057 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:02:08,057 INFO L85 PathProgramCache]: Analyzing trace with hash 946297184, now seen corresponding path program 1 times [2023-08-29 20:02:08,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:02:08,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257511024] [2023-08-29 20:02:08,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:02:08,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:02:08,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:02:08,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:02:08,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:02:08,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257511024] [2023-08-29 20:02:08,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257511024] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:02:08,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:02:08,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:02:08,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560621645] [2023-08-29 20:02:08,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:02:08,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:02:08,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:02:08,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:02:08,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:02:08,270 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 239 [2023-08-29 20:02:08,271 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 41 transitions, 129 flow. Second operand has 4 states, 4 states have (on average 98.75) internal successors, (395), 4 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:08,271 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:02:08,271 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 239 [2023-08-29 20:02:08,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:02:08,387 INFO L130 PetriNetUnfolder]: 151/421 cut-off events. [2023-08-29 20:02:08,388 INFO L131 PetriNetUnfolder]: For 256/257 co-relation queries the response was YES. [2023-08-29 20:02:08,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1035 conditions, 421 events. 151/421 cut-off events. For 256/257 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1868 event pairs, 26 based on Foata normal form. 0/283 useless extension candidates. Maximal degree in co-relation 978. Up to 314 conditions per place. [2023-08-29 20:02:08,390 INFO L137 encePairwiseOnDemand]: 231/239 looper letters, 49 selfloop transitions, 6 changer transitions 0/61 dead transitions. [2023-08-29 20:02:08,390 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 61 transitions, 289 flow [2023-08-29 20:02:08,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:02:08,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:02:08,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 440 transitions. [2023-08-29 20:02:08,392 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4602510460251046 [2023-08-29 20:02:08,392 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 440 transitions. [2023-08-29 20:02:08,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 440 transitions. [2023-08-29 20:02:08,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:02:08,393 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 440 transitions. [2023-08-29 20:02:08,394 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:08,396 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 239.0) internal successors, (1195), 5 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:08,396 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 239.0) internal successors, (1195), 5 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:08,396 INFO L175 Difference]: Start difference. First operand has 43 places, 41 transitions, 129 flow. Second operand 4 states and 440 transitions. [2023-08-29 20:02:08,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 61 transitions, 289 flow [2023-08-29 20:02:08,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 61 transitions, 284 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:02:08,399 INFO L231 Difference]: Finished difference. Result has 46 places, 46 transitions, 171 flow [2023-08-29 20:02:08,399 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=171, PETRI_PLACES=46, PETRI_TRANSITIONS=46} [2023-08-29 20:02:08,399 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -12 predicate places. [2023-08-29 20:02:08,400 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 46 transitions, 171 flow [2023-08-29 20:02:08,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.75) internal successors, (395), 4 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:08,400 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:02:08,400 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:02:08,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-29 20:02:08,401 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err28ASSERT_VIOLATIONMEMORY_LEAK, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-29 20:02:08,401 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:02:08,401 INFO L85 PathProgramCache]: Analyzing trace with hash -729556590, now seen corresponding path program 1 times [2023-08-29 20:02:08,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:02:08,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260034278] [2023-08-29 20:02:08,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:02:08,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:02:08,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:02:08,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:02:08,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:02:08,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260034278] [2023-08-29 20:02:08,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260034278] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:02:08,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:02:08,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:02:08,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779642289] [2023-08-29 20:02:08,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:02:08,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-29 20:02:08,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:02:08,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-29 20:02:08,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2023-08-29 20:02:08,997 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 239 [2023-08-29 20:02:08,998 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 46 transitions, 171 flow. Second operand has 8 states, 8 states have (on average 86.125) internal successors, (689), 8 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:08,999 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:02:08,999 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 239 [2023-08-29 20:02:08,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:02:09,166 INFO L130 PetriNetUnfolder]: 163/479 cut-off events. [2023-08-29 20:02:09,167 INFO L131 PetriNetUnfolder]: For 330/330 co-relation queries the response was YES. [2023-08-29 20:02:09,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1282 conditions, 479 events. 163/479 cut-off events. For 330/330 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2096 event pairs, 35 based on Foata normal form. 0/358 useless extension candidates. Maximal degree in co-relation 1235. Up to 247 conditions per place. [2023-08-29 20:02:09,170 INFO L137 encePairwiseOnDemand]: 232/239 looper letters, 72 selfloop transitions, 6 changer transitions 0/81 dead transitions. [2023-08-29 20:02:09,170 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 81 transitions, 445 flow [2023-08-29 20:02:09,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:02:09,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:02:09,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 493 transitions. [2023-08-29 20:02:09,172 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4125523012552301 [2023-08-29 20:02:09,172 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 493 transitions. [2023-08-29 20:02:09,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 493 transitions. [2023-08-29 20:02:09,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:02:09,173 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 493 transitions. [2023-08-29 20:02:09,174 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 98.6) internal successors, (493), 5 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:09,176 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:09,176 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:09,176 INFO L175 Difference]: Start difference. First operand has 46 places, 46 transitions, 171 flow. Second operand 5 states and 493 transitions. [2023-08-29 20:02:09,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 81 transitions, 445 flow [2023-08-29 20:02:09,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 81 transitions, 438 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-29 20:02:09,179 INFO L231 Difference]: Finished difference. Result has 51 places, 50 transitions, 214 flow [2023-08-29 20:02:09,179 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=214, PETRI_PLACES=51, PETRI_TRANSITIONS=50} [2023-08-29 20:02:09,180 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -7 predicate places. [2023-08-29 20:02:09,180 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 50 transitions, 214 flow [2023-08-29 20:02:09,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 86.125) internal successors, (689), 8 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:09,181 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:02:09,181 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:02:09,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-29 20:02:09,181 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err28ASSERT_VIOLATIONMEMORY_LEAK, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-29 20:02:09,182 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:02:09,182 INFO L85 PathProgramCache]: Analyzing trace with hash -729556591, now seen corresponding path program 1 times [2023-08-29 20:02:09,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:02:09,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062775098] [2023-08-29 20:02:09,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:02:09,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:02:09,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:02:09,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:02:09,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:02:09,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062775098] [2023-08-29 20:02:09,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062775098] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:02:09,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:02:09,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:02:09,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448376766] [2023-08-29 20:02:09,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:02:09,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:02:09,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:02:09,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:02:09,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:02:09,608 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 239 [2023-08-29 20:02:09,609 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 50 transitions, 214 flow. Second operand has 7 states, 7 states have (on average 80.14285714285714) internal successors, (561), 7 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:09,609 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:02:09,609 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 239 [2023-08-29 20:02:09,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:02:09,750 INFO L130 PetriNetUnfolder]: 155/459 cut-off events. [2023-08-29 20:02:09,750 INFO L131 PetriNetUnfolder]: For 360/361 co-relation queries the response was YES. [2023-08-29 20:02:09,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1260 conditions, 459 events. 155/459 cut-off events. For 360/361 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1990 event pairs, 33 based on Foata normal form. 0/359 useless extension candidates. Maximal degree in co-relation 1202. Up to 276 conditions per place. [2023-08-29 20:02:09,753 INFO L137 encePairwiseOnDemand]: 232/239 looper letters, 63 selfloop transitions, 5 changer transitions 0/73 dead transitions. [2023-08-29 20:02:09,753 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 73 transitions, 426 flow [2023-08-29 20:02:09,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:02:09,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:02:09,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 454 transitions. [2023-08-29 20:02:09,755 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3799163179916318 [2023-08-29 20:02:09,756 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 454 transitions. [2023-08-29 20:02:09,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 454 transitions. [2023-08-29 20:02:09,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:02:09,756 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 454 transitions. [2023-08-29 20:02:09,757 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:09,766 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:09,767 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:09,767 INFO L175 Difference]: Start difference. First operand has 51 places, 50 transitions, 214 flow. Second operand 5 states and 454 transitions. [2023-08-29 20:02:09,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 73 transitions, 426 flow [2023-08-29 20:02:09,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 73 transitions, 421 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:02:09,770 INFO L231 Difference]: Finished difference. Result has 55 places, 52 transitions, 244 flow [2023-08-29 20:02:09,770 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=244, PETRI_PLACES=55, PETRI_TRANSITIONS=52} [2023-08-29 20:02:09,771 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places. [2023-08-29 20:02:09,771 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 52 transitions, 244 flow [2023-08-29 20:02:09,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 80.14285714285714) internal successors, (561), 7 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:09,771 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:02:09,772 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:02:09,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-29 20:02:09,772 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err8ASSERT_VIOLATIONARRAY_INDEX === [thr1Err28ASSERT_VIOLATIONMEMORY_LEAK, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-29 20:02:09,772 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:02:09,772 INFO L85 PathProgramCache]: Analyzing trace with hash 2054952416, now seen corresponding path program 1 times [2023-08-29 20:02:09,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:02:09,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665090594] [2023-08-29 20:02:09,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:02:09,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:02:09,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:02:09,956 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 20:02:09,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:02:09,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665090594] [2023-08-29 20:02:09,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665090594] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 20:02:09,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572902858] [2023-08-29 20:02:09,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:02:09,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 20:02:09,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:02:09,965 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 20:02:09,990 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 20:02:10,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:02:10,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 15 conjunts are in the unsatisfiable core [2023-08-29 20:02:10,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:02:10,113 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 20:02:10,168 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 20:02:10,168 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 20:02:10,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-29 20:02:10,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 7 treesize of output 5 [2023-08-29 20:02:10,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2023-08-29 20:02:10,292 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 14 treesize of output 16 [2023-08-29 20:02:10,309 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 20:02:10,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 20:02:10,491 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 20:02:10,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 102 treesize of output 116 [2023-08-29 20:02:10,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 87 [2023-08-29 20:02:10,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 83 [2023-08-29 20:02:10,537 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 20:02:10,537 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 1 case distinctions, treesize of input 9 treesize of output 8 [2023-08-29 20:02:10,669 INFO L321 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2023-08-29 20:02:10,670 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 1 case distinctions, treesize of input 86 treesize of output 74 [2023-08-29 20:02:10,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2023-08-29 20:02:10,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2023-08-29 20:02:10,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-08-29 20:02:10,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2023-08-29 20:02:10,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2023-08-29 20:02:10,839 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 20:02:10,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572902858] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 20:02:10,839 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 20:02:10,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2023-08-29 20:02:10,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104392695] [2023-08-29 20:02:10,840 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 20:02:10,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-29 20:02:10,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:02:10,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-29 20:02:10,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2023-08-29 20:02:11,163 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 239 [2023-08-29 20:02:11,164 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 52 transitions, 244 flow. Second operand has 14 states, 14 states have (on average 63.857142857142854) internal successors, (894), 14 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:11,164 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:02:11,165 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 239 [2023-08-29 20:02:11,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:02:11,595 INFO L130 PetriNetUnfolder]: 205/592 cut-off events. [2023-08-29 20:02:11,595 INFO L131 PetriNetUnfolder]: For 609/609 co-relation queries the response was YES. [2023-08-29 20:02:11,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1695 conditions, 592 events. 205/592 cut-off events. For 609/609 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2826 event pairs, 21 based on Foata normal form. 2/486 useless extension candidates. Maximal degree in co-relation 1613. Up to 306 conditions per place. [2023-08-29 20:02:11,599 INFO L137 encePairwiseOnDemand]: 228/239 looper letters, 80 selfloop transitions, 16 changer transitions 0/99 dead transitions. [2023-08-29 20:02:11,599 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 99 transitions, 585 flow [2023-08-29 20:02:11,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:02:11,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:02:11,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 520 transitions. [2023-08-29 20:02:11,601 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31081888822474596 [2023-08-29 20:02:11,601 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 520 transitions. [2023-08-29 20:02:11,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 520 transitions. [2023-08-29 20:02:11,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:02:11,602 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 520 transitions. [2023-08-29 20:02:11,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 74.28571428571429) internal successors, (520), 7 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:11,605 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:11,606 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:11,606 INFO L175 Difference]: Start difference. First operand has 55 places, 52 transitions, 244 flow. Second operand 7 states and 520 transitions. [2023-08-29 20:02:11,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 99 transitions, 585 flow [2023-08-29 20:02:11,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 99 transitions, 580 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:02:11,609 INFO L231 Difference]: Finished difference. Result has 63 places, 61 transitions, 356 flow [2023-08-29 20:02:11,609 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=356, PETRI_PLACES=63, PETRI_TRANSITIONS=61} [2023-08-29 20:02:11,610 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 5 predicate places. [2023-08-29 20:02:11,610 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 61 transitions, 356 flow [2023-08-29 20:02:11,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 63.857142857142854) internal successors, (894), 14 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:11,611 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:02:11,611 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:02:11,622 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 20:02:11,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 20:02:11,816 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err28ASSERT_VIOLATIONMEMORY_LEAK, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-29 20:02:11,817 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:02:11,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1685385675, now seen corresponding path program 1 times [2023-08-29 20:02:11,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:02:11,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253051275] [2023-08-29 20:02:11,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:02:11,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:02:11,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:02:11,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:02:11,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:02:11,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253051275] [2023-08-29 20:02:11,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253051275] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:02:11,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:02:11,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:02:11,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645364631] [2023-08-29 20:02:11,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:02:11,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:02:11,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:02:11,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:02:11,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:02:11,949 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 239 [2023-08-29 20:02:11,949 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 61 transitions, 356 flow. Second operand has 4 states, 4 states have (on average 98.75) internal successors, (395), 4 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:11,950 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:02:11,950 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 239 [2023-08-29 20:02:11,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:02:12,085 INFO L130 PetriNetUnfolder]: 182/548 cut-off events. [2023-08-29 20:02:12,086 INFO L131 PetriNetUnfolder]: For 912/913 co-relation queries the response was YES. [2023-08-29 20:02:12,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1811 conditions, 548 events. 182/548 cut-off events. For 912/913 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2682 event pairs, 77 based on Foata normal form. 21/484 useless extension candidates. Maximal degree in co-relation 1713. Up to 357 conditions per place. [2023-08-29 20:02:12,089 INFO L137 encePairwiseOnDemand]: 230/239 looper letters, 55 selfloop transitions, 23 changer transitions 0/84 dead transitions. [2023-08-29 20:02:12,089 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 84 transitions, 663 flow [2023-08-29 20:02:12,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:02:12,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:02:12,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 430 transitions. [2023-08-29 20:02:12,091 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4497907949790795 [2023-08-29 20:02:12,091 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 430 transitions. [2023-08-29 20:02:12,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 430 transitions. [2023-08-29 20:02:12,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:02:12,092 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 430 transitions. [2023-08-29 20:02:12,093 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 107.5) internal successors, (430), 4 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:12,094 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 239.0) internal successors, (1195), 5 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:12,095 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 239.0) internal successors, (1195), 5 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:12,095 INFO L175 Difference]: Start difference. First operand has 63 places, 61 transitions, 356 flow. Second operand 4 states and 430 transitions. [2023-08-29 20:02:12,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 84 transitions, 663 flow [2023-08-29 20:02:12,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 84 transitions, 650 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-29 20:02:12,099 INFO L231 Difference]: Finished difference. Result has 66 places, 77 transitions, 571 flow [2023-08-29 20:02:12,099 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=571, PETRI_PLACES=66, PETRI_TRANSITIONS=77} [2023-08-29 20:02:12,100 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 8 predicate places. [2023-08-29 20:02:12,100 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 77 transitions, 571 flow [2023-08-29 20:02:12,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.75) internal successors, (395), 4 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:12,101 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:02:12,101 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:02:12,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-29 20:02:12,101 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err28ASSERT_VIOLATIONMEMORY_LEAK, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-29 20:02:12,101 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:02:12,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1685385674, now seen corresponding path program 1 times [2023-08-29 20:02:12,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:02:12,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942765829] [2023-08-29 20:02:12,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:02:12,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:02:12,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:02:12,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:02:12,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:02:12,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942765829] [2023-08-29 20:02:12,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942765829] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:02:12,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:02:12,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:02:12,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45601503] [2023-08-29 20:02:12,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:02:12,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:02:12,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:02:12,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:02:12,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:02:12,191 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 239 [2023-08-29 20:02:12,192 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 77 transitions, 571 flow. Second operand has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:12,192 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:02:12,192 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 239 [2023-08-29 20:02:12,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:02:12,281 INFO L130 PetriNetUnfolder]: 161/505 cut-off events. [2023-08-29 20:02:12,281 INFO L131 PetriNetUnfolder]: For 1029/1029 co-relation queries the response was YES. [2023-08-29 20:02:12,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1895 conditions, 505 events. 161/505 cut-off events. For 1029/1029 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2433 event pairs, 38 based on Foata normal form. 0/458 useless extension candidates. Maximal degree in co-relation 1795. Up to 361 conditions per place. [2023-08-29 20:02:12,285 INFO L137 encePairwiseOnDemand]: 234/239 looper letters, 64 selfloop transitions, 5 changer transitions 0/73 dead transitions. [2023-08-29 20:02:12,285 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 73 transitions, 671 flow [2023-08-29 20:02:12,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:02:12,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:02:12,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 310 transitions. [2023-08-29 20:02:12,287 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43235704323570434 [2023-08-29 20:02:12,287 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 310 transitions. [2023-08-29 20:02:12,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 310 transitions. [2023-08-29 20:02:12,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:02:12,287 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 310 transitions. [2023-08-29 20:02:12,288 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:12,289 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:12,289 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:12,290 INFO L175 Difference]: Start difference. First operand has 66 places, 77 transitions, 571 flow. Second operand 3 states and 310 transitions. [2023-08-29 20:02:12,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 73 transitions, 671 flow [2023-08-29 20:02:12,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 73 transitions, 667 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-08-29 20:02:12,295 INFO L231 Difference]: Finished difference. Result has 65 places, 69 transitions, 510 flow [2023-08-29 20:02:12,295 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=510, PETRI_PLACES=65, PETRI_TRANSITIONS=69} [2023-08-29 20:02:12,295 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 7 predicate places. [2023-08-29 20:02:12,296 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 69 transitions, 510 flow [2023-08-29 20:02:12,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:12,296 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:02:12,296 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:02:12,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-29 20:02:12,296 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err28ASSERT_VIOLATIONMEMORY_LEAK, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-29 20:02:12,297 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:02:12,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1685385673, now seen corresponding path program 1 times [2023-08-29 20:02:12,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:02:12,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701437166] [2023-08-29 20:02:12,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:02:12,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:02:12,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:02:12,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:02:12,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:02:12,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701437166] [2023-08-29 20:02:12,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701437166] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:02:12,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:02:12,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:02:12,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276207086] [2023-08-29 20:02:12,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:02:12,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:02:12,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:02:12,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:02:12,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:02:12,427 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 239 [2023-08-29 20:02:12,428 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 69 transitions, 510 flow. Second operand has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:12,428 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:02:12,428 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 239 [2023-08-29 20:02:12,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:02:12,515 INFO L130 PetriNetUnfolder]: 142/473 cut-off events. [2023-08-29 20:02:12,516 INFO L131 PetriNetUnfolder]: For 1007/1007 co-relation queries the response was YES. [2023-08-29 20:02:12,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1715 conditions, 473 events. 142/473 cut-off events. For 1007/1007 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2278 event pairs, 52 based on Foata normal form. 3/453 useless extension candidates. Maximal degree in co-relation 1616. Up to 345 conditions per place. [2023-08-29 20:02:12,519 INFO L137 encePairwiseOnDemand]: 235/239 looper letters, 56 selfloop transitions, 6 changer transitions 0/66 dead transitions. [2023-08-29 20:02:12,519 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 66 transitions, 598 flow [2023-08-29 20:02:12,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:02:12,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:02:12,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 325 transitions. [2023-08-29 20:02:12,521 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45327754532775455 [2023-08-29 20:02:12,521 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 325 transitions. [2023-08-29 20:02:12,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 325 transitions. [2023-08-29 20:02:12,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:02:12,522 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 325 transitions. [2023-08-29 20:02:12,522 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:12,524 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:12,524 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:12,524 INFO L175 Difference]: Start difference. First operand has 65 places, 69 transitions, 510 flow. Second operand 3 states and 325 transitions. [2023-08-29 20:02:12,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 66 transitions, 598 flow [2023-08-29 20:02:12,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 66 transitions, 588 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:02:12,529 INFO L231 Difference]: Finished difference. Result has 63 places, 62 transitions, 447 flow [2023-08-29 20:02:12,529 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=447, PETRI_PLACES=63, PETRI_TRANSITIONS=62} [2023-08-29 20:02:12,529 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 5 predicate places. [2023-08-29 20:02:12,530 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 62 transitions, 447 flow [2023-08-29 20:02:12,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:12,530 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:02:12,530 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:02:12,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-29 20:02:12,530 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err13ASSERT_VIOLATIONARRAY_INDEX === [thr1Err28ASSERT_VIOLATIONMEMORY_LEAK, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-29 20:02:12,531 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:02:12,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1156322432, now seen corresponding path program 1 times [2023-08-29 20:02:12,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:02:12,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317976892] [2023-08-29 20:02:12,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:02:12,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:02:12,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:02:12,817 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:02:12,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:02:12,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317976892] [2023-08-29 20:02:12,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317976892] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:02:12,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:02:12,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-29 20:02:12,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774606150] [2023-08-29 20:02:12,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:02:12,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:02:12,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:02:12,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:02:12,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:02:13,005 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 239 [2023-08-29 20:02:13,006 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 62 transitions, 447 flow. Second operand has 7 states, 7 states have (on average 91.14285714285714) internal successors, (638), 7 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:13,006 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:02:13,006 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 239 [2023-08-29 20:02:13,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:02:13,164 INFO L130 PetriNetUnfolder]: 97/366 cut-off events. [2023-08-29 20:02:13,165 INFO L131 PetriNetUnfolder]: For 757/757 co-relation queries the response was YES. [2023-08-29 20:02:13,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1317 conditions, 366 events. 97/366 cut-off events. For 757/757 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1649 event pairs, 14 based on Foata normal form. 0/351 useless extension candidates. Maximal degree in co-relation 1226. Up to 172 conditions per place. [2023-08-29 20:02:13,167 INFO L137 encePairwiseOnDemand]: 230/239 looper letters, 60 selfloop transitions, 21 changer transitions 0/85 dead transitions. [2023-08-29 20:02:13,167 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 85 transitions, 693 flow [2023-08-29 20:02:13,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-29 20:02:13,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-29 20:02:13,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 863 transitions. [2023-08-29 20:02:13,170 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.401208740120874 [2023-08-29 20:02:13,170 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 863 transitions. [2023-08-29 20:02:13,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 863 transitions. [2023-08-29 20:02:13,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:02:13,170 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 863 transitions. [2023-08-29 20:02:13,172 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 95.88888888888889) internal successors, (863), 9 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:13,181 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 239.0) internal successors, (2390), 10 states have internal predecessors, (2390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:13,181 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 239.0) internal successors, (2390), 10 states have internal predecessors, (2390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:13,181 INFO L175 Difference]: Start difference. First operand has 63 places, 62 transitions, 447 flow. Second operand 9 states and 863 transitions. [2023-08-29 20:02:13,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 85 transitions, 693 flow [2023-08-29 20:02:13,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 85 transitions, 673 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:02:13,186 INFO L231 Difference]: Finished difference. Result has 70 places, 64 transitions, 502 flow [2023-08-29 20:02:13,186 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=502, PETRI_PLACES=70, PETRI_TRANSITIONS=64} [2023-08-29 20:02:13,187 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 12 predicate places. [2023-08-29 20:02:13,187 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 64 transitions, 502 flow [2023-08-29 20:02:13,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.14285714285714) internal successors, (638), 7 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:13,187 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:02:13,188 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:02:13,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-29 20:02:13,188 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err28ASSERT_VIOLATIONMEMORY_LEAK, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-29 20:02:13,188 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:02:13,188 INFO L85 PathProgramCache]: Analyzing trace with hash 647495656, now seen corresponding path program 1 times [2023-08-29 20:02:13,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:02:13,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243450586] [2023-08-29 20:02:13,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:02:13,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:02:13,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:02:13,525 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 20:02:13,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:02:13,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243450586] [2023-08-29 20:02:13,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243450586] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 20:02:13,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938404191] [2023-08-29 20:02:13,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:02:13,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 20:02:13,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:02:13,528 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 20:02:13,555 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 20:02:13,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:02:13,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-29 20:02:13,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:02:13,622 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 20:02:13,640 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-29 20:02:13,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-29 20:02:13,659 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-29 20:02:13,659 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 1 case distinctions, treesize of input 12 treesize of output 18 [2023-08-29 20:02:13,902 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 20:02:13,903 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 165 treesize of output 166 [2023-08-29 20:02:13,923 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-29 20:02:13,924 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 157 treesize of output 164 [2023-08-29 20:02:13,945 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-29 20:02:13,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 149 treesize of output 159 [2023-08-29 20:02:13,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 142 [2023-08-29 20:02:14,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-29 20:02:14,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-29 20:02:14,043 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:02:14,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938404191] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:02:14,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-29 20:02:14,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2023-08-29 20:02:14,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214994726] [2023-08-29 20:02:14,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:02:14,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:02:14,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:02:14,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:02:14,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-08-29 20:02:14,143 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 239 [2023-08-29 20:02:14,143 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 64 transitions, 502 flow. Second operand has 5 states, 5 states have (on average 84.2) internal successors, (421), 5 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:14,144 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:02:14,144 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 239 [2023-08-29 20:02:14,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:02:14,274 INFO L130 PetriNetUnfolder]: 96/380 cut-off events. [2023-08-29 20:02:14,274 INFO L131 PetriNetUnfolder]: For 1035/1035 co-relation queries the response was YES. [2023-08-29 20:02:14,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1460 conditions, 380 events. 96/380 cut-off events. For 1035/1035 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1754 event pairs, 25 based on Foata normal form. 1/368 useless extension candidates. Maximal degree in co-relation 1365. Up to 158 conditions per place. [2023-08-29 20:02:14,277 INFO L137 encePairwiseOnDemand]: 233/239 looper letters, 86 selfloop transitions, 15 changer transitions 0/105 dead transitions. [2023-08-29 20:02:14,277 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 105 transitions, 930 flow [2023-08-29 20:02:14,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:02:14,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:02:14,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 393 transitions. [2023-08-29 20:02:14,279 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4110878661087866 [2023-08-29 20:02:14,279 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 393 transitions. [2023-08-29 20:02:14,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 393 transitions. [2023-08-29 20:02:14,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:02:14,280 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 393 transitions. [2023-08-29 20:02:14,280 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 98.25) internal successors, (393), 4 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:14,282 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 239.0) internal successors, (1195), 5 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:14,282 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 239.0) internal successors, (1195), 5 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:14,282 INFO L175 Difference]: Start difference. First operand has 70 places, 64 transitions, 502 flow. Second operand 4 states and 393 transitions. [2023-08-29 20:02:14,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 105 transitions, 930 flow [2023-08-29 20:02:14,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 105 transitions, 862 flow, removed 16 selfloop flow, removed 4 redundant places. [2023-08-29 20:02:14,289 INFO L231 Difference]: Finished difference. Result has 71 places, 68 transitions, 545 flow [2023-08-29 20:02:14,289 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=457, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=545, PETRI_PLACES=71, PETRI_TRANSITIONS=68} [2023-08-29 20:02:14,289 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 13 predicate places. [2023-08-29 20:02:14,289 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 68 transitions, 545 flow [2023-08-29 20:02:14,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 84.2) internal successors, (421), 5 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:14,290 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:02:14,290 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:02:14,299 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 20:02:14,496 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,SelfDestructingSolverStorable12 [2023-08-29 20:02:14,496 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thr1Err26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err28ASSERT_VIOLATIONMEMORY_LEAK, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-29 20:02:14,497 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:02:14,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1488155006, now seen corresponding path program 1 times [2023-08-29 20:02:14,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:02:14,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835638300] [2023-08-29 20:02:14,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:02:14,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:02:14,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:02:14,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:02:14,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:02:14,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835638300] [2023-08-29 20:02:14,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835638300] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:02:14,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:02:14,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-29 20:02:14,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208625693] [2023-08-29 20:02:14,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:02:14,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-29 20:02:14,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:02:14,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-29 20:02:14,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-08-29 20:02:15,271 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 239 [2023-08-29 20:02:15,272 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 68 transitions, 545 flow. Second operand has 10 states, 10 states have (on average 79.6) internal successors, (796), 10 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:15,272 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:02:15,272 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 239 [2023-08-29 20:02:15,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:02:15,424 INFO L130 PetriNetUnfolder]: 93/353 cut-off events. [2023-08-29 20:02:15,425 INFO L131 PetriNetUnfolder]: For 1216/1216 co-relation queries the response was YES. [2023-08-29 20:02:15,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1400 conditions, 353 events. 93/353 cut-off events. For 1216/1216 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1521 event pairs, 30 based on Foata normal form. 17/351 useless extension candidates. Maximal degree in co-relation 1310. Up to 203 conditions per place. [2023-08-29 20:02:15,427 INFO L137 encePairwiseOnDemand]: 228/239 looper letters, 72 selfloop transitions, 13 changer transitions 0/88 dead transitions. [2023-08-29 20:02:15,428 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 88 transitions, 825 flow [2023-08-29 20:02:15,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:02:15,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:02:15,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 601 transitions. [2023-08-29 20:02:15,430 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35923490735206215 [2023-08-29 20:02:15,430 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 601 transitions. [2023-08-29 20:02:15,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 601 transitions. [2023-08-29 20:02:15,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:02:15,431 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 601 transitions. [2023-08-29 20:02:15,432 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 85.85714285714286) internal successors, (601), 7 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:15,434 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:15,434 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:15,434 INFO L175 Difference]: Start difference. First operand has 71 places, 68 transitions, 545 flow. Second operand 7 states and 601 transitions. [2023-08-29 20:02:15,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 88 transitions, 825 flow [2023-08-29 20:02:15,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 88 transitions, 809 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-29 20:02:15,441 INFO L231 Difference]: Finished difference. Result has 77 places, 70 transitions, 590 flow [2023-08-29 20:02:15,441 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=525, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=590, PETRI_PLACES=77, PETRI_TRANSITIONS=70} [2023-08-29 20:02:15,441 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 19 predicate places. [2023-08-29 20:02:15,441 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 70 transitions, 590 flow [2023-08-29 20:02:15,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 79.6) internal successors, (796), 10 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:15,442 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:02:15,442 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:02:15,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-29 20:02:15,442 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thr1Err28ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err28ASSERT_VIOLATIONMEMORY_LEAK, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-29 20:02:15,443 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:02:15,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1488154871, now seen corresponding path program 1 times [2023-08-29 20:02:15,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:02:15,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853808826] [2023-08-29 20:02:15,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:02:15,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:02:15,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:02:15,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:02:15,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:02:15,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853808826] [2023-08-29 20:02:15,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853808826] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:02:15,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:02:15,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-29 20:02:15,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507524488] [2023-08-29 20:02:15,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:02:15,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-29 20:02:15,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:02:15,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-29 20:02:15,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-08-29 20:02:16,225 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 239 [2023-08-29 20:02:16,226 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 70 transitions, 590 flow. Second operand has 10 states, 10 states have (on average 81.6) internal successors, (816), 10 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:16,226 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:02:16,226 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 239 [2023-08-29 20:02:16,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:02:16,523 INFO L130 PetriNetUnfolder]: 86/364 cut-off events. [2023-08-29 20:02:16,524 INFO L131 PetriNetUnfolder]: For 1226/1226 co-relation queries the response was YES. [2023-08-29 20:02:16,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1520 conditions, 364 events. 86/364 cut-off events. For 1226/1226 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1695 event pairs, 5 based on Foata normal form. 0/359 useless extension candidates. Maximal degree in co-relation 1426. Up to 112 conditions per place. [2023-08-29 20:02:16,526 INFO L137 encePairwiseOnDemand]: 223/239 looper letters, 70 selfloop transitions, 45 changer transitions 0/118 dead transitions. [2023-08-29 20:02:16,526 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 118 transitions, 1123 flow [2023-08-29 20:02:16,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-29 20:02:16,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-29 20:02:16,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1201 transitions. [2023-08-29 20:02:16,530 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3589360430364614 [2023-08-29 20:02:16,530 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1201 transitions. [2023-08-29 20:02:16,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1201 transitions. [2023-08-29 20:02:16,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:02:16,531 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1201 transitions. [2023-08-29 20:02:16,533 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 85.78571428571429) internal successors, (1201), 14 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:16,537 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 239.0) internal successors, (3585), 15 states have internal predecessors, (3585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:16,538 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 239.0) internal successors, (3585), 15 states have internal predecessors, (3585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:16,538 INFO L175 Difference]: Start difference. First operand has 77 places, 70 transitions, 590 flow. Second operand 14 states and 1201 transitions. [2023-08-29 20:02:16,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 118 transitions, 1123 flow [2023-08-29 20:02:16,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 118 transitions, 1109 flow, removed 1 selfloop flow, removed 4 redundant places. [2023-08-29 20:02:16,546 INFO L231 Difference]: Finished difference. Result has 94 places, 92 transitions, 972 flow [2023-08-29 20:02:16,546 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=972, PETRI_PLACES=94, PETRI_TRANSITIONS=92} [2023-08-29 20:02:16,546 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 36 predicate places. [2023-08-29 20:02:16,546 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 92 transitions, 972 flow [2023-08-29 20:02:16,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 81.6) internal successors, (816), 10 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:16,547 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:02:16,547 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:02:16,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-29 20:02:16,547 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thr1Err13ASSERT_VIOLATIONARRAY_INDEX === [thr1Err28ASSERT_VIOLATIONMEMORY_LEAK, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-29 20:02:16,548 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:02:16,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1400682382, now seen corresponding path program 1 times [2023-08-29 20:02:16,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:02:16,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768082107] [2023-08-29 20:02:16,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:02:16,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:02:16,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:02:17,164 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:02:17,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:02:17,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768082107] [2023-08-29 20:02:17,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768082107] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 20:02:17,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333908290] [2023-08-29 20:02:17,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:02:17,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 20:02:17,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:02:17,166 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 20:02:17,168 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 20:02:17,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:02:17,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-29 20:02:17,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:02:17,262 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 20:02:17,288 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-08-29 20:02:17,288 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-08-29 20:02:17,313 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-29 20:02:17,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2023-08-29 20:02:17,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 20:02:17,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 20:02:17,783 INFO L321 Elim1Store]: treesize reduction 130, result has 29.0 percent of original size [2023-08-29 20:02:17,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 200 treesize of output 302 [2023-08-29 20:02:17,832 INFO L321 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2023-08-29 20:02:17,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 175 treesize of output 181 [2023-08-29 20:02:17,856 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-08-29 20:02:17,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 167 treesize of output 157 [2023-08-29 20:02:17,882 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 8 treesize of output 7 [2023-08-29 20:02:18,051 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-08-29 20:02:18,052 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 43 [2023-08-29 20:02:18,110 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 8 treesize of output 7 [2023-08-29 20:02:18,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-08-29 20:02:18,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 11 [2023-08-29 20:02:18,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-08-29 20:02:18,198 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 14 treesize of output 16 [2023-08-29 20:02:18,212 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:02:18,212 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 20:02:18,232 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_316 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_316) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) 0))) is different from false [2023-08-29 20:02:19,017 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 20:02:19,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 113 [2023-08-29 20:02:19,045 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 20:02:19,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 104 treesize of output 120 [2023-08-29 20:02:19,061 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-08-29 20:02:19,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 100 treesize of output 92 [2023-08-29 20:02:19,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 35 [2023-08-29 20:02:19,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2023-08-29 20:02:19,221 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-29 20:02:19,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333908290] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 20:02:19,222 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 20:02:19,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 26 [2023-08-29 20:02:19,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997918448] [2023-08-29 20:02:19,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 20:02:19,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-08-29 20:02:19,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:02:19,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-08-29 20:02:19,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=563, Unknown=2, NotChecked=48, Total=702 [2023-08-29 20:02:19,464 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 239 [2023-08-29 20:02:19,465 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 92 transitions, 972 flow. Second operand has 27 states, 27 states have (on average 47.81481481481482) internal successors, (1291), 27 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:19,465 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:02:19,465 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 239 [2023-08-29 20:02:19,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:02:21,890 INFO L130 PetriNetUnfolder]: 118/571 cut-off events. [2023-08-29 20:02:21,890 INFO L131 PetriNetUnfolder]: For 2873/2873 co-relation queries the response was YES. [2023-08-29 20:02:21,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2841 conditions, 571 events. 118/571 cut-off events. For 2873/2873 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2991 event pairs, 2 based on Foata normal form. 19/589 useless extension candidates. Maximal degree in co-relation 2699. Up to 103 conditions per place. [2023-08-29 20:02:21,895 INFO L137 encePairwiseOnDemand]: 217/239 looper letters, 118 selfloop transitions, 140 changer transitions 0/260 dead transitions. [2023-08-29 20:02:21,895 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 260 transitions, 2895 flow [2023-08-29 20:02:21,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-08-29 20:02:21,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2023-08-29 20:02:21,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 2275 transitions. [2023-08-29 20:02:21,903 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.21152952115295212 [2023-08-29 20:02:21,903 INFO L72 ComplementDD]: Start complementDD. Operand 45 states and 2275 transitions. [2023-08-29 20:02:21,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 2275 transitions. [2023-08-29 20:02:21,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:02:21,904 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 45 states and 2275 transitions. [2023-08-29 20:02:21,909 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 46 states, 45 states have (on average 50.55555555555556) internal successors, (2275), 45 states have internal predecessors, (2275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:21,920 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 46 states, 46 states have (on average 239.0) internal successors, (10994), 46 states have internal predecessors, (10994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:21,922 INFO L81 ComplementDD]: Finished complementDD. Result has 46 states, 46 states have (on average 239.0) internal successors, (10994), 46 states have internal predecessors, (10994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:21,923 INFO L175 Difference]: Start difference. First operand has 94 places, 92 transitions, 972 flow. Second operand 45 states and 2275 transitions. [2023-08-29 20:02:21,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 260 transitions, 2895 flow [2023-08-29 20:02:21,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 260 transitions, 2845 flow, removed 18 selfloop flow, removed 4 redundant places. [2023-08-29 20:02:21,942 INFO L231 Difference]: Finished difference. Result has 153 places, 196 transitions, 2555 flow [2023-08-29 20:02:21,943 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=944, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=2555, PETRI_PLACES=153, PETRI_TRANSITIONS=196} [2023-08-29 20:02:21,943 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 95 predicate places. [2023-08-29 20:02:21,943 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 196 transitions, 2555 flow [2023-08-29 20:02:21,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 47.81481481481482) internal successors, (1291), 27 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:21,944 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:02:21,944 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:02:21,954 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 20:02:22,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 20:02:22,150 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thr1Err28ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err28ASSERT_VIOLATIONMEMORY_LEAK, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-29 20:02:22,150 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:02:22,150 INFO L85 PathProgramCache]: Analyzing trace with hash 777924595, now seen corresponding path program 1 times [2023-08-29 20:02:22,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:02:22,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716817321] [2023-08-29 20:02:22,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:02:22,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:02:22,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:02:22,660 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 20:02:22,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:02:22,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716817321] [2023-08-29 20:02:22,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716817321] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 20:02:22,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630813229] [2023-08-29 20:02:22,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:02:22,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 20:02:22,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:02:22,665 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 20:02:22,668 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 20:02:22,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:02:22,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 32 conjunts are in the unsatisfiable core [2023-08-29 20:02:22,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:02:22,760 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 20:02:22,792 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 20:02:22,792 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 20:02:22,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-29 20:02:22,863 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 14 treesize of output 16 [2023-08-29 20:02:23,232 INFO L321 Elim1Store]: treesize reduction 96, result has 23.8 percent of original size [2023-08-29 20:02:23,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 186 treesize of output 220 [2023-08-29 20:02:23,274 INFO L321 Elim1Store]: treesize reduction 71, result has 27.6 percent of original size [2023-08-29 20:02:23,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 190 treesize of output 214 [2023-08-29 20:02:23,305 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 20:02:23,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 164 treesize of output 178 [2023-08-29 20:02:23,326 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-08-29 20:02:23,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 154 treesize of output 144 [2023-08-29 20:02:23,433 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-29 20:02:23,433 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 2 case distinctions, treesize of input 23 treesize of output 7 [2023-08-29 20:02:23,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-08-29 20:02:23,525 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-29 20:02:23,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 44 [2023-08-29 20:02:23,573 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 20:02:23,574 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 27 treesize of output 31 [2023-08-29 20:02:23,635 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 20:02:23,664 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 20:02:23,664 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 20:02:23,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-08-29 20:02:24,588 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 20:02:24,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 102 treesize of output 116 [2023-08-29 20:02:24,613 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 20:02:24,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 112 [2023-08-29 20:02:24,629 INFO L321 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-08-29 20:02:24,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 92 [2023-08-29 20:02:24,647 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 20:02:24,647 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 1 case distinctions, treesize of input 9 treesize of output 8 [2023-08-29 20:02:24,724 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-29 20:02:24,733 INFO L321 Elim1Store]: treesize reduction 28, result has 12.5 percent of original size [2023-08-29 20:02:24,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 141 treesize of output 130 [2023-08-29 20:02:24,743 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-29 20:02:24,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 137 [2023-08-29 20:02:24,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 133 [2023-08-29 20:02:24,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 134 [2023-08-29 20:02:24,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 125 [2023-08-29 20:02:24,999 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 20:02:25,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630813229] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 20:02:25,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 20:02:25,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 27 [2023-08-29 20:02:25,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189652427] [2023-08-29 20:02:25,001 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 20:02:25,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-29 20:02:25,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:02:25,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-29 20:02:25,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=726, Unknown=2, NotChecked=0, Total=812 [2023-08-29 20:02:28,286 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 239 [2023-08-29 20:02:28,288 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 196 transitions, 2555 flow. Second operand has 29 states, 29 states have (on average 43.793103448275865) internal successors, (1270), 29 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:28,288 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:02:28,288 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 239 [2023-08-29 20:02:28,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:02:30,912 INFO L130 PetriNetUnfolder]: 118/591 cut-off events. [2023-08-29 20:02:30,912 INFO L131 PetriNetUnfolder]: For 4346/4346 co-relation queries the response was YES. [2023-08-29 20:02:30,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3700 conditions, 591 events. 118/591 cut-off events. For 4346/4346 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3160 event pairs, 3 based on Foata normal form. 2/592 useless extension candidates. Maximal degree in co-relation 3538. Up to 141 conditions per place. [2023-08-29 20:02:30,917 INFO L137 encePairwiseOnDemand]: 218/239 looper letters, 110 selfloop transitions, 149 changer transitions 0/261 dead transitions. [2023-08-29 20:02:30,917 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 261 transitions, 3576 flow [2023-08-29 20:02:30,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-08-29 20:02:30,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2023-08-29 20:02:30,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 1517 transitions. [2023-08-29 20:02:30,922 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.19234182832509192 [2023-08-29 20:02:30,923 INFO L72 ComplementDD]: Start complementDD. Operand 33 states and 1517 transitions. [2023-08-29 20:02:30,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 1517 transitions. [2023-08-29 20:02:30,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:02:30,923 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 1517 transitions. [2023-08-29 20:02:30,926 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 34 states, 33 states have (on average 45.96969696969697) internal successors, (1517), 33 states have internal predecessors, (1517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:30,934 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 34 states, 34 states have (on average 239.0) internal successors, (8126), 34 states have internal predecessors, (8126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:30,935 INFO L81 ComplementDD]: Finished complementDD. Result has 34 states, 34 states have (on average 239.0) internal successors, (8126), 34 states have internal predecessors, (8126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:30,935 INFO L175 Difference]: Start difference. First operand has 153 places, 196 transitions, 2555 flow. Second operand 33 states and 1517 transitions. [2023-08-29 20:02:30,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 261 transitions, 3576 flow [2023-08-29 20:02:30,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 261 transitions, 3374 flow, removed 81 selfloop flow, removed 8 redundant places. [2023-08-29 20:02:30,971 INFO L231 Difference]: Finished difference. Result has 184 places, 222 transitions, 3053 flow [2023-08-29 20:02:30,971 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=2383, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=125, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=3053, PETRI_PLACES=184, PETRI_TRANSITIONS=222} [2023-08-29 20:02:30,972 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 126 predicate places. [2023-08-29 20:02:30,972 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 222 transitions, 3053 flow [2023-08-29 20:02:30,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 43.793103448275865) internal successors, (1270), 29 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:30,973 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:02:30,973 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:02:30,983 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 20:02:31,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-08-29 20:02:31,179 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thr1Err28ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err28ASSERT_VIOLATIONMEMORY_LEAK, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-29 20:02:31,179 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:02:31,179 INFO L85 PathProgramCache]: Analyzing trace with hash 366563815, now seen corresponding path program 2 times [2023-08-29 20:02:31,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:02:31,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665949284] [2023-08-29 20:02:31,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:02:31,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:02:31,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:02:31,609 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 20:02:31,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:02:31,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665949284] [2023-08-29 20:02:31,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665949284] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 20:02:31,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704045818] [2023-08-29 20:02:31,609 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 20:02:31,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 20:02:31,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:02:31,611 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 20:02:31,613 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 20:02:31,702 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-29 20:02:31,702 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:02:31,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 30 conjunts are in the unsatisfiable core [2023-08-29 20:02:31,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:02:31,714 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 20:02:31,715 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 20:02:31,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-29 20:02:32,166 INFO L321 Elim1Store]: treesize reduction 42, result has 39.1 percent of original size [2023-08-29 20:02:32,167 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 186 treesize of output 217 [2023-08-29 20:02:32,216 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 20:02:32,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 176 treesize of output 190 [2023-08-29 20:02:32,238 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-08-29 20:02:32,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 166 treesize of output 156 [2023-08-29 20:02:32,365 INFO L321 Elim1Store]: treesize reduction 84, result has 34.9 percent of original size [2023-08-29 20:02:32,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 186 treesize of output 238 [2023-08-29 20:02:32,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-08-29 20:02:32,645 INFO L321 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2023-08-29 20:02:32,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 111 [2023-08-29 20:02:32,759 INFO L321 Elim1Store]: treesize reduction 51, result has 15.0 percent of original size [2023-08-29 20:02:32,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 32 [2023-08-29 20:02:32,777 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-08-29 20:02:32,793 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-29 20:02:32,794 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 7 [2023-08-29 20:02:32,844 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 20:02:32,885 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 26 treesize of output 28 [2023-08-29 20:02:32,915 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 20:02:32,916 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 20:02:32,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-08-29 20:02:33,980 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 20:02:33,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 102 treesize of output 116 [2023-08-29 20:02:34,024 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 20:02:34,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 165 treesize of output 201 [2023-08-29 20:02:34,079 INFO L321 Elim1Store]: treesize reduction 8, result has 83.7 percent of original size [2023-08-29 20:02:34,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 159 treesize of output 189 [2023-08-29 20:02:34,100 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 20:02:34,100 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 1 case distinctions, treesize of input 9 treesize of output 8 [2023-08-29 20:02:35,714 INFO L321 Elim1Store]: treesize reduction 53, result has 50.0 percent of original size [2023-08-29 20:02:35,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 369 treesize of output 425 [2023-08-29 20:02:35,750 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-29 20:02:35,751 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 383 treesize of output 370 [2023-08-29 20:02:35,874 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 20:02:35,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 470 treesize of output 466 [2023-08-29 20:02:35,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-08-29 20:02:35,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2023-08-29 20:02:35,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-08-29 20:02:36,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-08-29 20:02:36,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-08-29 20:02:36,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2023-08-29 20:02:36,060 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-08-29 20:02:36,076 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-08-29 20:02:36,084 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-08-29 20:02:36,341 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 20:02:36,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [704045818] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 20:02:36,342 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 20:02:36,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2023-08-29 20:02:36,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803147124] [2023-08-29 20:02:36,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 20:02:36,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-29 20:02:36,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:02:36,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-29 20:02:36,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2023-08-29 20:02:38,443 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 239 [2023-08-29 20:02:38,445 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 222 transitions, 3053 flow. Second operand has 23 states, 23 states have (on average 63.869565217391305) internal successors, (1469), 23 states have internal predecessors, (1469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:38,445 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:02:38,445 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 239 [2023-08-29 20:02:38,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:02:44,823 INFO L130 PetriNetUnfolder]: 136/706 cut-off events. [2023-08-29 20:02:44,823 INFO L131 PetriNetUnfolder]: For 5852/5852 co-relation queries the response was YES. [2023-08-29 20:02:44,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4797 conditions, 706 events. 136/706 cut-off events. For 5852/5852 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 4087 event pairs, 10 based on Foata normal form. 5/698 useless extension candidates. Maximal degree in co-relation 4623. Up to 275 conditions per place. [2023-08-29 20:02:44,831 INFO L137 encePairwiseOnDemand]: 218/239 looper letters, 189 selfloop transitions, 132 changer transitions 0/323 dead transitions. [2023-08-29 20:02:44,831 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 323 transitions, 4705 flow [2023-08-29 20:02:44,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-08-29 20:02:44,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2023-08-29 20:02:44,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 2577 transitions. [2023-08-29 20:02:44,837 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.276472481493402 [2023-08-29 20:02:44,837 INFO L72 ComplementDD]: Start complementDD. Operand 39 states and 2577 transitions. [2023-08-29 20:02:44,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 2577 transitions. [2023-08-29 20:02:44,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:02:44,838 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 39 states and 2577 transitions. [2023-08-29 20:02:44,841 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 40 states, 39 states have (on average 66.07692307692308) internal successors, (2577), 39 states have internal predecessors, (2577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:44,850 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 40 states, 40 states have (on average 239.0) internal successors, (9560), 40 states have internal predecessors, (9560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:44,851 INFO L81 ComplementDD]: Finished complementDD. Result has 40 states, 40 states have (on average 239.0) internal successors, (9560), 40 states have internal predecessors, (9560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:44,851 INFO L175 Difference]: Start difference. First operand has 184 places, 222 transitions, 3053 flow. Second operand 39 states and 2577 transitions. [2023-08-29 20:02:44,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 323 transitions, 4705 flow [2023-08-29 20:02:44,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 323 transitions, 4567 flow, removed 34 selfloop flow, removed 6 redundant places. [2023-08-29 20:02:44,900 INFO L231 Difference]: Finished difference. Result has 232 places, 272 transitions, 4013 flow [2023-08-29 20:02:44,900 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=2952, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=4013, PETRI_PLACES=232, PETRI_TRANSITIONS=272} [2023-08-29 20:02:44,901 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 174 predicate places. [2023-08-29 20:02:44,901 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 272 transitions, 4013 flow [2023-08-29 20:02:44,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 63.869565217391305) internal successors, (1469), 23 states have internal predecessors, (1469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:44,902 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:02:44,902 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:02:44,907 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 20:02:45,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-08-29 20:02:45,108 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thr1Err8ASSERT_VIOLATIONARRAY_INDEX === [thr1Err28ASSERT_VIOLATIONMEMORY_LEAK, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-29 20:02:45,108 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:02:45,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1061672251, now seen corresponding path program 1 times [2023-08-29 20:02:45,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:02:45,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852197004] [2023-08-29 20:02:45,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:02:45,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:02:45,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:02:45,287 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:02:45,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:02:45,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852197004] [2023-08-29 20:02:45,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852197004] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 20:02:45,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440579105] [2023-08-29 20:02:45,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:02:45,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 20:02:45,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:02:45,290 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 20:02:45,293 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 20:02:45,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:02:45,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-29 20:02:45,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:02:45,550 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 13 treesize of output 9 [2023-08-29 20:02:45,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-08-29 20:02:45,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-08-29 20:02:45,567 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:02:45,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 20:02:45,640 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 20:02:45,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 102 treesize of output 116 [2023-08-29 20:02:45,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 87 [2023-08-29 20:02:45,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 83 [2023-08-29 20:02:45,666 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 20:02:45,667 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 1 case distinctions, treesize of input 9 treesize of output 8 [2023-08-29 20:02:45,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-08-29 20:02:45,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2023-08-29 20:02:45,825 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 20:02:45,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 113 [2023-08-29 20:02:45,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 87 [2023-08-29 20:02:45,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 83 [2023-08-29 20:02:45,889 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:02:45,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440579105] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 20:02:45,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 20:02:45,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2023-08-29 20:02:45,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669229735] [2023-08-29 20:02:45,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 20:02:45,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 20:02:45,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:02:45,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 20:02:45,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-29 20:02:46,036 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 239 [2023-08-29 20:02:46,037 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 272 transitions, 4013 flow. Second operand has 9 states, 9 states have (on average 97.55555555555556) internal successors, (878), 9 states have internal predecessors, (878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:46,037 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:02:46,037 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 239 [2023-08-29 20:02:46,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:02:46,529 INFO L130 PetriNetUnfolder]: 189/1016 cut-off events. [2023-08-29 20:02:46,530 INFO L131 PetriNetUnfolder]: For 9834/9835 co-relation queries the response was YES. [2023-08-29 20:02:46,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7210 conditions, 1016 events. 189/1016 cut-off events. For 9834/9835 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 5878 event pairs, 12 based on Foata normal form. 23/1029 useless extension candidates. Maximal degree in co-relation 6978. Up to 165 conditions per place. [2023-08-29 20:02:46,544 INFO L137 encePairwiseOnDemand]: 232/239 looper letters, 357 selfloop transitions, 67 changer transitions 0/449 dead transitions. [2023-08-29 20:02:46,544 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 449 transitions, 7190 flow [2023-08-29 20:02:46,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-29 20:02:46,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-29 20:02:46,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1161 transitions. [2023-08-29 20:02:46,546 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44161278052491443 [2023-08-29 20:02:46,546 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1161 transitions. [2023-08-29 20:02:46,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1161 transitions. [2023-08-29 20:02:46,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:02:46,547 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1161 transitions. [2023-08-29 20:02:46,549 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 105.54545454545455) internal successors, (1161), 11 states have internal predecessors, (1161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:46,551 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 239.0) internal successors, (2868), 12 states have internal predecessors, (2868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:46,552 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 239.0) internal successors, (2868), 12 states have internal predecessors, (2868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:46,552 INFO L175 Difference]: Start difference. First operand has 232 places, 272 transitions, 4013 flow. Second operand 11 states and 1161 transitions. [2023-08-29 20:02:46,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 449 transitions, 7190 flow [2023-08-29 20:02:46,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 449 transitions, 6976 flow, removed 34 selfloop flow, removed 9 redundant places. [2023-08-29 20:02:46,636 INFO L231 Difference]: Finished difference. Result has 241 places, 303 transitions, 4667 flow [2023-08-29 20:02:46,637 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=3845, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4667, PETRI_PLACES=241, PETRI_TRANSITIONS=303} [2023-08-29 20:02:46,637 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 183 predicate places. [2023-08-29 20:02:46,637 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 303 transitions, 4667 flow [2023-08-29 20:02:46,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 97.55555555555556) internal successors, (878), 9 states have internal predecessors, (878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:46,638 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:02:46,638 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:02:46,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-29 20:02:46,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 20:02:46,846 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thr1Err8ASSERT_VIOLATIONARRAY_INDEX === [thr1Err28ASSERT_VIOLATIONMEMORY_LEAK, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-29 20:02:46,846 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:02:46,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1093657491, now seen corresponding path program 1 times [2023-08-29 20:02:46,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:02:46,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258925657] [2023-08-29 20:02:46,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:02:46,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:02:46,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:02:47,369 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:02:47,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:02:47,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258925657] [2023-08-29 20:02:47,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258925657] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 20:02:47,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562304814] [2023-08-29 20:02:47,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:02:47,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 20:02:47,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:02:47,371 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 20:02:47,374 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 20:02:47,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:02:47,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 28 conjunts are in the unsatisfiable core [2023-08-29 20:02:47,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:02:47,594 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 20:02:47,617 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-29 20:02:47,617 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-29 20:02:47,643 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-29 20:02:47,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-29 20:02:47,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-29 20:02:47,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 7 treesize of output 5 [2023-08-29 20:02:47,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-08-29 20:02:47,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2023-08-29 20:02:47,783 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-29 20:02:47,805 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 20:02:47,805 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 20:02:47,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-29 20:02:47,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 7 treesize of output 5 [2023-08-29 20:02:47,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2023-08-29 20:02:47,857 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 21 treesize of output 21 [2023-08-29 20:02:47,877 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:02:47,877 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 20:02:47,897 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_590 (Array Int Int))) (< (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_590) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65)) is different from false [2023-08-29 20:02:47,968 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 20:02:47,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 102 treesize of output 116 [2023-08-29 20:02:47,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 87 [2023-08-29 20:02:47,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 83 [2023-08-29 20:02:47,996 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 20:02:47,997 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 1 case distinctions, treesize of input 9 treesize of output 8 [2023-08-29 20:02:48,073 INFO L321 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2023-08-29 20:02:48,074 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 1 case distinctions, treesize of input 86 treesize of output 74 [2023-08-29 20:02:48,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2023-08-29 20:02:48,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2023-08-29 20:02:48,088 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-08-29 20:02:48,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2023-08-29 20:02:48,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2023-08-29 20:02:48,390 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 20:02:48,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 102 treesize of output 116 [2023-08-29 20:02:48,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 87 [2023-08-29 20:02:48,407 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 20:02:48,408 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 1 case distinctions, treesize of input 9 treesize of output 8 [2023-08-29 20:02:48,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 65 [2023-08-29 20:02:48,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2023-08-29 20:02:48,990 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-29 20:02:48,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562304814] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 20:02:48,991 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 20:02:48,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2023-08-29 20:02:48,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799121582] [2023-08-29 20:02:48,991 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 20:02:48,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-08-29 20:02:48,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:02:48,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-08-29 20:02:48,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=562, Unknown=1, NotChecked=50, Total=756 [2023-08-29 20:02:49,107 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 239 [2023-08-29 20:02:49,108 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 303 transitions, 4667 flow. Second operand has 28 states, 28 states have (on average 56.214285714285715) internal successors, (1574), 28 states have internal predecessors, (1574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:49,108 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:02:49,108 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 239 [2023-08-29 20:02:49,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:02:50,314 INFO L130 PetriNetUnfolder]: 198/1026 cut-off events. [2023-08-29 20:02:50,314 INFO L131 PetriNetUnfolder]: For 11046/11046 co-relation queries the response was YES. [2023-08-29 20:02:50,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7460 conditions, 1026 events. 198/1026 cut-off events. For 11046/11046 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 5892 event pairs, 12 based on Foata normal form. 6/1024 useless extension candidates. Maximal degree in co-relation 7217. Up to 322 conditions per place. [2023-08-29 20:02:50,328 INFO L137 encePairwiseOnDemand]: 225/239 looper letters, 238 selfloop transitions, 121 changer transitions 0/369 dead transitions. [2023-08-29 20:02:50,328 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 369 transitions, 6036 flow [2023-08-29 20:02:50,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-08-29 20:02:50,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-08-29 20:02:50,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1152 transitions. [2023-08-29 20:02:50,332 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2536886148425457 [2023-08-29 20:02:50,332 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 1152 transitions. [2023-08-29 20:02:50,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 1152 transitions. [2023-08-29 20:02:50,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:02:50,333 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1152 transitions. [2023-08-29 20:02:50,334 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 60.63157894736842) internal successors, (1152), 19 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:50,338 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 239.0) internal successors, (4780), 20 states have internal predecessors, (4780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:50,339 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 239.0) internal successors, (4780), 20 states have internal predecessors, (4780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:50,339 INFO L175 Difference]: Start difference. First operand has 241 places, 303 transitions, 4667 flow. Second operand 19 states and 1152 transitions. [2023-08-29 20:02:50,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 369 transitions, 6036 flow [2023-08-29 20:02:50,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 369 transitions, 5965 flow, removed 17 selfloop flow, removed 5 redundant places. [2023-08-29 20:02:50,432 INFO L231 Difference]: Finished difference. Result has 260 places, 316 transitions, 5131 flow [2023-08-29 20:02:50,433 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=4549, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=5131, PETRI_PLACES=260, PETRI_TRANSITIONS=316} [2023-08-29 20:02:50,433 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 202 predicate places. [2023-08-29 20:02:50,433 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 316 transitions, 5131 flow [2023-08-29 20:02:50,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 56.214285714285715) internal successors, (1574), 28 states have internal predecessors, (1574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:50,434 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:02:50,434 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:02:50,441 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 20:02:50,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 20:02:50,640 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err28ASSERT_VIOLATIONMEMORY_LEAK, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-29 20:02:50,640 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:02:50,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1447896809, now seen corresponding path program 1 times [2023-08-29 20:02:50,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:02:50,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7888129] [2023-08-29 20:02:50,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:02:50,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:02:50,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:02:50,888 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:02:50,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:02:50,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7888129] [2023-08-29 20:02:50,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7888129] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 20:02:50,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421105739] [2023-08-29 20:02:50,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:02:50,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 20:02:50,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:02:50,890 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 20:02:50,919 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 20:02:51,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:02:51,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-29 20:02:51,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:02:51,105 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-29 20:02:51,105 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 1 case distinctions, treesize of input 9 treesize of output 15 [2023-08-29 20:02:51,110 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-29 20:02:51,111 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 7 [2023-08-29 20:02:51,117 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 6 treesize of output 5 [2023-08-29 20:02:51,122 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-29 20:02:51,122 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 7 [2023-08-29 20:02:51,166 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-29 20:02:51,167 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-29 20:02:51,173 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 14 treesize of output 16 [2023-08-29 20:02:51,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 20:02:51,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-29 20:02:51,204 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 20:02:51,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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 20:02:51,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 71 [2023-08-29 20:02:51,252 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 74 [2023-08-29 20:02:51,257 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2023-08-29 20:02:51,308 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:02:51,308 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:02:51,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1421105739] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:02:51,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-29 20:02:51,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 10 [2023-08-29 20:02:51,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486946592] [2023-08-29 20:02:51,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:02:51,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-29 20:02:51,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:02:51,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-29 20:02:51,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2023-08-29 20:02:53,357 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 20:02:54,821 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 239 [2023-08-29 20:02:54,822 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 316 transitions, 5131 flow. Second operand has 8 states, 8 states have (on average 78.75) internal successors, (630), 8 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:54,822 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:02:54,822 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 239 [2023-08-29 20:02:54,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:02:55,094 INFO L130 PetriNetUnfolder]: 181/888 cut-off events. [2023-08-29 20:02:55,095 INFO L131 PetriNetUnfolder]: For 11804/11804 co-relation queries the response was YES. [2023-08-29 20:02:55,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7057 conditions, 888 events. 181/888 cut-off events. For 11804/11804 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 4689 event pairs, 18 based on Foata normal form. 104/987 useless extension candidates. Maximal degree in co-relation 6834. Up to 671 conditions per place. [2023-08-29 20:02:55,106 INFO L137 encePairwiseOnDemand]: 231/239 looper letters, 215 selfloop transitions, 60 changer transitions 0/277 dead transitions. [2023-08-29 20:02:55,107 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 277 transitions, 5104 flow [2023-08-29 20:02:55,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:02:55,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:02:55,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 412 transitions. [2023-08-29 20:02:55,108 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3447698744769874 [2023-08-29 20:02:55,108 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 412 transitions. [2023-08-29 20:02:55,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 412 transitions. [2023-08-29 20:02:55,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:02:55,109 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 412 transitions. [2023-08-29 20:02:55,110 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 82.4) internal successors, (412), 5 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:55,111 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:55,111 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:55,111 INFO L175 Difference]: Start difference. First operand has 260 places, 316 transitions, 5131 flow. Second operand 5 states and 412 transitions. [2023-08-29 20:02:55,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 277 transitions, 5104 flow [2023-08-29 20:02:55,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 277 transitions, 4906 flow, removed 16 selfloop flow, removed 13 redundant places. [2023-08-29 20:02:55,181 INFO L231 Difference]: Finished difference. Result has 237 places, 273 transitions, 4440 flow [2023-08-29 20:02:55,181 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=4320, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4440, PETRI_PLACES=237, PETRI_TRANSITIONS=273} [2023-08-29 20:02:55,181 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 179 predicate places. [2023-08-29 20:02:55,181 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 273 transitions, 4440 flow [2023-08-29 20:02:55,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 78.75) internal successors, (630), 8 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:55,182 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:02:55,182 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:02:55,187 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 20:02:55,382 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,SelfDestructingSolverStorable20 [2023-08-29 20:02:55,383 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thr1Err28ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err28ASSERT_VIOLATIONMEMORY_LEAK, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-29 20:02:55,383 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:02:55,383 INFO L85 PathProgramCache]: Analyzing trace with hash -691111403, now seen corresponding path program 1 times [2023-08-29 20:02:55,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:02:55,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252650541] [2023-08-29 20:02:55,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:02:55,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:02:55,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:02:55,984 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:02:55,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:02:55,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252650541] [2023-08-29 20:02:55,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252650541] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 20:02:55,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331948491] [2023-08-29 20:02:55,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:02:55,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 20:02:55,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:02:55,985 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 20:02:55,987 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 20:02:56,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:02:56,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-29 20:02:56,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:02:56,103 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 20:02:56,104 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 20:02:56,188 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 14 treesize of output 16 [2023-08-29 20:02:56,300 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-29 20:02:56,300 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 7 [2023-08-29 20:02:56,304 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 20:02:56,304 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 13 treesize of output 17 [2023-08-29 20:02:56,323 INFO L321 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2023-08-29 20:02:56,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2023-08-29 20:02:56,327 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 8 treesize of output 7 [2023-08-29 20:02:56,331 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 8 treesize of output 7 [2023-08-29 20:02:56,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 11 [2023-08-29 20:02:56,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-08-29 20:02:56,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-08-29 20:02:56,379 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:02:56,380 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:02:56,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331948491] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:02:56,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-29 20:02:56,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 20 [2023-08-29 20:02:56,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842155547] [2023-08-29 20:02:56,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:02:56,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:02:56,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:02:56,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:02:56,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2023-08-29 20:02:56,507 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 239 [2023-08-29 20:02:56,508 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 273 transitions, 4440 flow. Second operand has 7 states, 7 states have (on average 93.28571428571429) internal successors, (653), 7 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:56,508 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:02:56,508 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 239 [2023-08-29 20:02:56,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:02:56,741 INFO L130 PetriNetUnfolder]: 170/858 cut-off events. [2023-08-29 20:02:56,741 INFO L131 PetriNetUnfolder]: For 11285/11285 co-relation queries the response was YES. [2023-08-29 20:02:56,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6670 conditions, 858 events. 170/858 cut-off events. For 11285/11285 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 4470 event pairs, 44 based on Foata normal form. 6/861 useless extension candidates. Maximal degree in co-relation 6506. Up to 417 conditions per place. [2023-08-29 20:02:56,749 INFO L137 encePairwiseOnDemand]: 231/239 looper letters, 168 selfloop transitions, 89 changer transitions 0/267 dead transitions. [2023-08-29 20:02:56,749 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 267 transitions, 4851 flow [2023-08-29 20:02:56,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:02:56,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:02:56,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 575 transitions. [2023-08-29 20:02:56,754 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40097629009762903 [2023-08-29 20:02:56,754 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 575 transitions. [2023-08-29 20:02:56,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 575 transitions. [2023-08-29 20:02:56,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:02:56,755 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 575 transitions. [2023-08-29 20:02:56,755 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 95.83333333333333) internal successors, (575), 6 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:56,758 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 239.0) internal successors, (1673), 7 states have internal predecessors, (1673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:56,758 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 239.0) internal successors, (1673), 7 states have internal predecessors, (1673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:56,758 INFO L175 Difference]: Start difference. First operand has 237 places, 273 transitions, 4440 flow. Second operand 6 states and 575 transitions. [2023-08-29 20:02:56,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 267 transitions, 4851 flow [2023-08-29 20:02:56,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 267 transitions, 4629 flow, removed 1 selfloop flow, removed 15 redundant places. [2023-08-29 20:02:56,815 INFO L231 Difference]: Finished difference. Result has 226 places, 258 transitions, 4252 flow [2023-08-29 20:02:56,815 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=4006, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4252, PETRI_PLACES=226, PETRI_TRANSITIONS=258} [2023-08-29 20:02:56,815 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 168 predicate places. [2023-08-29 20:02:56,815 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 258 transitions, 4252 flow [2023-08-29 20:02:56,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.28571428571429) internal successors, (653), 7 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:56,816 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:02:56,816 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:02:56,821 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 20:02:57,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 20:02:57,016 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err28ASSERT_VIOLATIONMEMORY_LEAK, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-29 20:02:57,017 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:02:57,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1056531565, now seen corresponding path program 1 times [2023-08-29 20:02:57,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:02:57,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603515890] [2023-08-29 20:02:57,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:02:57,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:02:57,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:02:57,448 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:02:57,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:02:57,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603515890] [2023-08-29 20:02:57,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603515890] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 20:02:57,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177775045] [2023-08-29 20:02:57,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:02:57,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 20:02:57,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:02:57,453 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 20:02:57,458 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 20:02:57,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:02:57,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-29 20:02:57,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:02:57,594 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 20:02:57,614 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-29 20:02:57,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-29 20:02:57,636 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-29 20:02:57,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-29 20:02:57,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-29 20:02:57,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-29 20:02:57,703 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-29 20:02:57,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-29 20:02:57,716 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-29 20:02:57,717 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 1 case distinctions, treesize of input 12 treesize of output 18 [2023-08-29 20:02:57,869 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 20:02:57,869 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 165 treesize of output 166 [2023-08-29 20:02:57,884 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-29 20:02:57,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 157 treesize of output 164 [2023-08-29 20:02:57,900 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-29 20:02:57,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 149 treesize of output 159 [2023-08-29 20:02:57,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 142 [2023-08-29 20:02:57,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-29 20:02:57,974 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-29 20:02:57,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 20:02:58,020 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 20:02:58,020 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 15 [2023-08-29 20:02:58,256 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-29 20:02:58,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177775045] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 20:02:58,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 20:02:58,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 7] total 15 [2023-08-29 20:02:58,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141128226] [2023-08-29 20:02:58,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 20:02:58,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-08-29 20:02:58,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:02:58,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-08-29 20:02:58,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2023-08-29 20:02:58,672 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 239 [2023-08-29 20:02:58,673 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 258 transitions, 4252 flow. Second operand has 17 states, 17 states have (on average 74.70588235294117) internal successors, (1270), 17 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:58,673 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:02:58,673 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 239 [2023-08-29 20:02:58,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:02:58,982 INFO L130 PetriNetUnfolder]: 128/719 cut-off events. [2023-08-29 20:02:58,982 INFO L131 PetriNetUnfolder]: For 10403/10403 co-relation queries the response was YES. [2023-08-29 20:02:58,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5556 conditions, 719 events. 128/719 cut-off events. For 10403/10403 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3582 event pairs, 3 based on Foata normal form. 40/756 useless extension candidates. Maximal degree in co-relation 5400. Up to 386 conditions per place. [2023-08-29 20:02:58,990 INFO L137 encePairwiseOnDemand]: 231/239 looper letters, 162 selfloop transitions, 74 changer transitions 0/244 dead transitions. [2023-08-29 20:02:58,990 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 244 transitions, 4448 flow [2023-08-29 20:02:58,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-29 20:02:58,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-29 20:02:58,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 758 transitions. [2023-08-29 20:02:58,992 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31715481171548116 [2023-08-29 20:02:58,992 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 758 transitions. [2023-08-29 20:02:58,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 758 transitions. [2023-08-29 20:02:58,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:02:58,993 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 758 transitions. [2023-08-29 20:02:58,994 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 75.8) internal successors, (758), 10 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:58,995 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 239.0) internal successors, (2629), 11 states have internal predecessors, (2629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:58,995 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 239.0) internal successors, (2629), 11 states have internal predecessors, (2629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:58,996 INFO L175 Difference]: Start difference. First operand has 226 places, 258 transitions, 4252 flow. Second operand 10 states and 758 transitions. [2023-08-29 20:02:58,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 244 transitions, 4448 flow [2023-08-29 20:02:59,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 244 transitions, 4317 flow, removed 9 selfloop flow, removed 7 redundant places. [2023-08-29 20:02:59,056 INFO L231 Difference]: Finished difference. Result has 221 places, 234 transitions, 3908 flow [2023-08-29 20:02:59,057 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=3760, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3908, PETRI_PLACES=221, PETRI_TRANSITIONS=234} [2023-08-29 20:02:59,057 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 163 predicate places. [2023-08-29 20:02:59,057 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 234 transitions, 3908 flow [2023-08-29 20:02:59,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 74.70588235294117) internal successors, (1270), 17 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:02:59,057 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:02:59,058 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-29 20:02:59,063 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 20:02:59,258 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,SelfDestructingSolverStorable22 [2023-08-29 20:02:59,258 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting thr1Err26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err28ASSERT_VIOLATIONMEMORY_LEAK, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-29 20:02:59,258 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:02:59,259 INFO L85 PathProgramCache]: Analyzing trace with hash -2045968547, now seen corresponding path program 1 times [2023-08-29 20:02:59,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:02:59,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078172646] [2023-08-29 20:02:59,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:02:59,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:02:59,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:02:59,503 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:02:59,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:02:59,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078172646] [2023-08-29 20:02:59,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078172646] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 20:02:59,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489674692] [2023-08-29 20:02:59,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:02:59,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 20:02:59,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:02:59,509 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 20:02:59,532 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 20:02:59,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:02:59,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 19 conjunts are in the unsatisfiable core [2023-08-29 20:02:59,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:02:59,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-29 20:02:59,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-08-29 20:02:59,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-08-29 20:02:59,716 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-29 20:02:59,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-29 20:02:59,735 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 20:02:59,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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 20:02:59,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 20:02:59,923 INFO L321 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2023-08-29 20:02:59,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 171 treesize of output 169 [2023-08-29 20:02:59,939 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-08-29 20:02:59,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 157 treesize of output 160 [2023-08-29 20:02:59,953 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-08-29 20:02:59,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 149 treesize of output 155 [2023-08-29 20:02:59,961 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 144 [2023-08-29 20:03:00,042 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-08-29 20:03:00,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2023-08-29 20:03:00,052 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-29 20:03:00,054 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:03:00,055 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 20:03:00,225 INFO L321 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2023-08-29 20:03:00,225 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 60 [2023-08-29 20:03:00,232 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-08-29 20:03:00,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 42 [2023-08-29 20:03:00,302 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:03:00,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1489674692] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-29 20:03:00,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-29 20:03:00,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9, 10] total 18 [2023-08-29 20:03:00,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479937096] [2023-08-29 20:03:00,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:03:00,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 20:03:00,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:03:00,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 20:03:00,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2023-08-29 20:03:00,501 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 239 [2023-08-29 20:03:00,502 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 234 transitions, 3908 flow. Second operand has 9 states, 9 states have (on average 83.22222222222223) internal successors, (749), 9 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:03:00,502 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:03:00,502 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 239 [2023-08-29 20:03:00,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:03:00,717 INFO L130 PetriNetUnfolder]: 123/691 cut-off events. [2023-08-29 20:03:00,717 INFO L131 PetriNetUnfolder]: For 9200/9200 co-relation queries the response was YES. [2023-08-29 20:03:00,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5320 conditions, 691 events. 123/691 cut-off events. For 9200/9200 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3341 event pairs, 11 based on Foata normal form. 21/709 useless extension candidates. Maximal degree in co-relation 5163. Up to 491 conditions per place. [2023-08-29 20:03:00,723 INFO L137 encePairwiseOnDemand]: 234/239 looper letters, 176 selfloop transitions, 52 changer transitions 0/230 dead transitions. [2023-08-29 20:03:00,724 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 230 transitions, 4303 flow [2023-08-29 20:03:00,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:03:00,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:03:00,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 426 transitions. [2023-08-29 20:03:00,725 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35648535564853556 [2023-08-29 20:03:00,725 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 426 transitions. [2023-08-29 20:03:00,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 426 transitions. [2023-08-29 20:03:00,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:03:00,726 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 426 transitions. [2023-08-29 20:03:00,726 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 85.2) internal successors, (426), 5 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:03:00,727 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:03:00,728 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:03:00,728 INFO L175 Difference]: Start difference. First operand has 221 places, 234 transitions, 3908 flow. Second operand 5 states and 426 transitions. [2023-08-29 20:03:00,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 230 transitions, 4303 flow [2023-08-29 20:03:00,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 230 transitions, 4170 flow, removed 0 selfloop flow, removed 9 redundant places. [2023-08-29 20:03:00,788 INFO L231 Difference]: Finished difference. Result has 212 places, 227 transitions, 3784 flow [2023-08-29 20:03:00,788 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=3680, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3784, PETRI_PLACES=212, PETRI_TRANSITIONS=227} [2023-08-29 20:03:00,789 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 154 predicate places. [2023-08-29 20:03:00,789 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 227 transitions, 3784 flow [2023-08-29 20:03:00,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 83.22222222222223) internal successors, (749), 9 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:03:00,789 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:03:00,789 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-29 20:03:00,799 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 20:03:00,995 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,SelfDestructingSolverStorable23 [2023-08-29 20:03:00,996 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting thr1Err28ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err28ASSERT_VIOLATIONMEMORY_LEAK, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-29 20:03:00,996 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:03:00,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1414867222, now seen corresponding path program 1 times [2023-08-29 20:03:00,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:03:00,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102311391] [2023-08-29 20:03:00,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:03:00,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:03:01,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:03:01,654 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:03:01,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:03:01,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102311391] [2023-08-29 20:03:01,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102311391] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 20:03:01,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897492571] [2023-08-29 20:03:01,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:03:01,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 20:03:01,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:03:01,657 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 20:03:01,672 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 20:03:01,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:03:01,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 45 conjunts are in the unsatisfiable core [2023-08-29 20:03:01,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:03:01,798 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 20:03:01,819 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-29 20:03:01,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-29 20:03:01,838 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-29 20:03:01,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-29 20:03:01,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2023-08-29 20:03:01,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2023-08-29 20:03:01,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-29 20:03:01,970 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 20:03:01,970 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 20:03:01,995 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-29 20:03:02,053 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 14 treesize of output 16 [2023-08-29 20:03:02,298 INFO L321 Elim1Store]: treesize reduction 56, result has 47.2 percent of original size [2023-08-29 20:03:02,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 183 treesize of output 231 [2023-08-29 20:03:02,345 INFO L321 Elim1Store]: treesize reduction 68, result has 30.6 percent of original size [2023-08-29 20:03:02,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 179 treesize of output 206 [2023-08-29 20:03:02,379 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 20:03:02,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 156 treesize of output 170 [2023-08-29 20:03:02,397 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-08-29 20:03:02,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 146 treesize of output 136 [2023-08-29 20:03:03,268 INFO L321 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2023-08-29 20:03:03,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 27 [2023-08-29 20:03:03,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-08-29 20:03:03,285 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-08-29 20:03:03,316 INFO L321 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-08-29 20:03:03,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 27 [2023-08-29 20:03:03,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-08-29 20:03:03,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-08-29 20:03:03,459 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-29 20:03:03,459 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 1 case distinctions, treesize of input 21 treesize of output 5 [2023-08-29 20:03:03,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-08-29 20:03:03,503 INFO L321 Elim1Store]: treesize reduction 53, result has 11.7 percent of original size [2023-08-29 20:03:03,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 27 [2023-08-29 20:03:03,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 20:03:03,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-29 20:03:03,726 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-08-29 20:03:03,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-08-29 20:03:04,654 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-08-29 20:03:04,677 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-29 20:03:04,677 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 7 [2023-08-29 20:03:04,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-08-29 20:03:04,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-08-29 20:03:04,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-08-29 20:03:04,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-08-29 20:03:05,414 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 20:03:05,458 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:03:05,458 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 20:03:05,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-08-29 20:03:06,018 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 20:03:06,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 102 treesize of output 116 [2023-08-29 20:03:06,045 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 20:03:06,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 106 treesize of output 114 [2023-08-29 20:03:06,060 INFO L321 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-08-29 20:03:06,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 92 [2023-08-29 20:03:06,082 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 20:03:06,082 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 1 case distinctions, treesize of input 9 treesize of output 8 [2023-08-29 20:03:06,155 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-29 20:03:06,164 INFO L321 Elim1Store]: treesize reduction 28, result has 12.5 percent of original size [2023-08-29 20:03:06,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 141 treesize of output 130 [2023-08-29 20:03:06,172 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-29 20:03:06,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 137 [2023-08-29 20:03:06,186 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 133 [2023-08-29 20:03:06,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 134 [2023-08-29 20:03:06,200 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 125 [2023-08-29 20:03:06,507 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 20:03:06,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 113 [2023-08-29 20:03:06,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 87 [2023-08-29 20:03:06,899 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:03:06,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897492571] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 20:03:06,900 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 20:03:06,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 37 [2023-08-29 20:03:06,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721208780] [2023-08-29 20:03:06,900 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 20:03:06,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-08-29 20:03:06,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:03:06,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-08-29 20:03:06,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1294, Unknown=24, NotChecked=0, Total=1482 [2023-08-29 20:03:09,370 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 239 [2023-08-29 20:03:09,372 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 227 transitions, 3784 flow. Second operand has 39 states, 39 states have (on average 48.205128205128204) internal successors, (1880), 39 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:03:09,373 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:03:09,373 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 239 [2023-08-29 20:03:09,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:03:13,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 20:03:17,213 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 20:03:27,945 WARN L222 SmtUtils]: Spent 8.09s on a formula simplification. DAG size of input: 56 DAG size of output: 52 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 20:03:29,886 INFO L130 PetriNetUnfolder]: 123/701 cut-off events. [2023-08-29 20:03:29,886 INFO L131 PetriNetUnfolder]: For 9218/9218 co-relation queries the response was YES. [2023-08-29 20:03:29,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5356 conditions, 701 events. 123/701 cut-off events. For 9218/9218 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3460 event pairs, 0 based on Foata normal form. 3/701 useless extension candidates. Maximal degree in co-relation 5201. Up to 144 conditions per place. [2023-08-29 20:03:29,891 INFO L137 encePairwiseOnDemand]: 224/239 looper letters, 127 selfloop transitions, 161 changer transitions 0/290 dead transitions. [2023-08-29 20:03:29,891 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 290 transitions, 4980 flow [2023-08-29 20:03:29,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-08-29 20:03:29,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2023-08-29 20:03:29,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 2297 transitions. [2023-08-29 20:03:29,895 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.20448678002314608 [2023-08-29 20:03:29,895 INFO L72 ComplementDD]: Start complementDD. Operand 47 states and 2297 transitions. [2023-08-29 20:03:29,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 2297 transitions. [2023-08-29 20:03:29,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:03:29,896 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 47 states and 2297 transitions. [2023-08-29 20:03:29,900 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 48 states, 47 states have (on average 48.87234042553192) internal successors, (2297), 47 states have internal predecessors, (2297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:03:29,906 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 48 states, 48 states have (on average 239.0) internal successors, (11472), 48 states have internal predecessors, (11472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:03:29,907 INFO L81 ComplementDD]: Finished complementDD. Result has 48 states, 48 states have (on average 239.0) internal successors, (11472), 48 states have internal predecessors, (11472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:03:29,907 INFO L175 Difference]: Start difference. First operand has 212 places, 227 transitions, 3784 flow. Second operand 47 states and 2297 transitions. [2023-08-29 20:03:29,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 290 transitions, 4980 flow [2023-08-29 20:03:29,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 290 transitions, 4872 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-29 20:03:29,968 INFO L231 Difference]: Finished difference. Result has 257 places, 251 transitions, 4380 flow [2023-08-29 20:03:29,968 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=3680, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=139, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=4380, PETRI_PLACES=257, PETRI_TRANSITIONS=251} [2023-08-29 20:03:29,969 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 199 predicate places. [2023-08-29 20:03:29,969 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 251 transitions, 4380 flow [2023-08-29 20:03:29,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 48.205128205128204) internal successors, (1880), 39 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:03:29,969 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:03:29,969 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2023-08-29 20:03:29,978 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 20:03:30,178 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,SelfDestructingSolverStorable24 [2023-08-29 20:03:30,178 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting thr1Err8ASSERT_VIOLATIONARRAY_INDEX === [thr1Err28ASSERT_VIOLATIONMEMORY_LEAK, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-29 20:03:30,178 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:03:30,179 INFO L85 PathProgramCache]: Analyzing trace with hash -150476878, now seen corresponding path program 2 times [2023-08-29 20:03:30,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:03:30,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381520223] [2023-08-29 20:03:30,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:03:30,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:03:30,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:03:30,938 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:03:30,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:03:30,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381520223] [2023-08-29 20:03:30,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381520223] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 20:03:30,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77244914] [2023-08-29 20:03:30,939 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 20:03:30,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 20:03:30,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:03:30,940 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 20:03:30,941 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 20:03:31,175 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-29 20:03:31,175 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:03:31,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-29 20:03:31,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:03:31,181 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 20:03:31,201 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-29 20:03:31,201 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-29 20:03:31,241 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-08-29 20:03:31,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-08-29 20:03:31,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-08-29 20:03:31,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2023-08-29 20:03:31,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-29 20:03:31,433 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-29 20:03:31,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-29 20:03:31,462 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-29 20:03:31,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-29 20:03:31,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2023-08-29 20:03:31,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2023-08-29 20:03:31,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-29 20:03:31,602 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 20:03:31,602 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 20:03:31,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-29 20:03:31,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 7 treesize of output 5 [2023-08-29 20:03:31,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2023-08-29 20:03:31,657 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 21 treesize of output 21 [2023-08-29 20:03:31,679 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:03:31,679 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 20:03:31,790 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 20:03:31,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 102 treesize of output 116 [2023-08-29 20:03:31,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 87 [2023-08-29 20:03:31,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 83 [2023-08-29 20:03:31,817 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 20:03:31,817 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 1 case distinctions, treesize of input 9 treesize of output 8 [2023-08-29 20:03:31,890 INFO L321 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2023-08-29 20:03:31,890 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 1 case distinctions, treesize of input 86 treesize of output 74 [2023-08-29 20:03:31,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2023-08-29 20:03:31,902 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2023-08-29 20:03:31,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-08-29 20:03:31,916 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2023-08-29 20:03:31,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2023-08-29 20:03:32,188 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 20:03:32,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 113 [2023-08-29 20:03:32,194 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 87 [2023-08-29 20:03:33,280 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 20:03:33,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 113 [2023-08-29 20:03:33,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 87 [2023-08-29 20:03:34,021 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:03:34,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77244914] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 20:03:34,021 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 20:03:34,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 41 [2023-08-29 20:03:34,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125031649] [2023-08-29 20:03:34,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 20:03:34,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-08-29 20:03:34,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:03:34,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-08-29 20:03:34,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=1503, Unknown=1, NotChecked=0, Total=1806 [2023-08-29 20:03:35,012 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 239 [2023-08-29 20:03:35,014 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 251 transitions, 4380 flow. Second operand has 43 states, 43 states have (on average 56.46511627906977) internal successors, (2428), 43 states have internal predecessors, (2428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:03:35,014 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:03:35,014 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 239 [2023-08-29 20:03:35,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:03:37,600 INFO L130 PetriNetUnfolder]: 158/915 cut-off events. [2023-08-29 20:03:37,600 INFO L131 PetriNetUnfolder]: For 12859/12859 co-relation queries the response was YES. [2023-08-29 20:03:37,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7398 conditions, 915 events. 158/915 cut-off events. For 12859/12859 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 4553 event pairs, 0 based on Foata normal form. 21/932 useless extension candidates. Maximal degree in co-relation 7233. Up to 171 conditions per place. [2023-08-29 20:03:37,607 INFO L137 encePairwiseOnDemand]: 228/239 looper letters, 291 selfloop transitions, 176 changer transitions 0/469 dead transitions. [2023-08-29 20:03:37,607 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 469 transitions, 8673 flow [2023-08-29 20:03:37,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-08-29 20:03:37,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2023-08-29 20:03:37,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 1730 transitions. [2023-08-29 20:03:37,611 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2496032318568749 [2023-08-29 20:03:37,611 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 1730 transitions. [2023-08-29 20:03:37,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 1730 transitions. [2023-08-29 20:03:37,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:03:37,612 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 1730 transitions. [2023-08-29 20:03:37,614 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 59.6551724137931) internal successors, (1730), 29 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:03:37,619 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 239.0) internal successors, (7170), 30 states have internal predecessors, (7170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:03:37,619 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 239.0) internal successors, (7170), 30 states have internal predecessors, (7170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:03:37,619 INFO L175 Difference]: Start difference. First operand has 257 places, 251 transitions, 4380 flow. Second operand 29 states and 1730 transitions. [2023-08-29 20:03:37,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 469 transitions, 8673 flow [2023-08-29 20:03:37,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 469 transitions, 7780 flow, removed 156 selfloop flow, removed 34 redundant places. [2023-08-29 20:03:37,705 INFO L231 Difference]: Finished difference. Result has 257 places, 329 transitions, 5750 flow [2023-08-29 20:03:37,706 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=3837, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=5750, PETRI_PLACES=257, PETRI_TRANSITIONS=329} [2023-08-29 20:03:37,707 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 199 predicate places. [2023-08-29 20:03:37,707 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 329 transitions, 5750 flow [2023-08-29 20:03:37,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 56.46511627906977) internal successors, (2428), 43 states have internal predecessors, (2428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:03:37,707 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:03:37,708 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-29 20:03:37,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-08-29 20:03:37,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-08-29 20:03:37,914 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting thr1Err13ASSERT_VIOLATIONARRAY_INDEX === [thr1Err28ASSERT_VIOLATIONMEMORY_LEAK, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-29 20:03:37,914 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:03:37,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1916628184, now seen corresponding path program 1 times [2023-08-29 20:03:37,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:03:37,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482453492] [2023-08-29 20:03:37,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:03:37,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:03:37,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:03:39,008 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:03:39,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:03:39,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482453492] [2023-08-29 20:03:39,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482453492] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 20:03:39,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010510061] [2023-08-29 20:03:39,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:03:39,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 20:03:39,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:03:39,013 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 20:03:39,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-08-29 20:03:39,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:03:39,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 46 conjunts are in the unsatisfiable core [2023-08-29 20:03:39,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:03:39,196 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 20:03:39,221 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-29 20:03:39,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-29 20:03:39,238 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-29 20:03:39,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-29 20:03:39,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-29 20:03:39,259 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 7 treesize of output 5 [2023-08-29 20:03:39,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-08-29 20:03:39,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2023-08-29 20:03:39,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-29 20:03:39,379 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-29 20:03:39,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-29 20:03:39,418 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-08-29 20:03:39,419 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-08-29 20:03:39,546 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 20:03:39,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2023-08-29 20:03:39,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 20:03:39,559 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-08-29 20:03:39,562 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-08-29 20:03:39,613 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2023-08-29 20:03:39,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 37 [2023-08-29 20:03:39,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2023-08-29 20:03:39,674 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-08-29 20:03:39,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-08-29 20:03:39,704 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-29 20:03:39,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2023-08-29 20:03:39,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 20:03:39,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 20:03:40,068 INFO L321 Elim1Store]: treesize reduction 144, result has 21.3 percent of original size [2023-08-29 20:03:40,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 200 treesize of output 278 [2023-08-29 20:03:40,112 INFO L321 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2023-08-29 20:03:40,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 175 treesize of output 181 [2023-08-29 20:03:40,130 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-08-29 20:03:40,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 167 treesize of output 157 [2023-08-29 20:03:40,152 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 8 treesize of output 7 [2023-08-29 20:03:40,292 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 8 treesize of output 7 [2023-08-29 20:03:40,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-08-29 20:03:40,352 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 14 treesize of output 16 [2023-08-29 20:03:40,375 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 16 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:03:40,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 20:03:41,073 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 20:03:41,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 112 treesize of output 128 [2023-08-29 20:03:41,085 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-08-29 20:03:41,086 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 106 treesize of output 98 [2023-08-29 20:03:41,904 INFO L321 Elim1Store]: treesize reduction 20, result has 63.6 percent of original size [2023-08-29 20:03:41,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 195 treesize of output 236 [2023-08-29 20:03:41,932 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 20:03:41,932 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 182 treesize of output 183 [2023-08-29 20:03:42,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 69 [2023-08-29 20:03:42,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 67 [2023-08-29 20:03:42,583 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 20:03:42,584 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 102 treesize of output 116 [2023-08-29 20:03:42,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 87 [2023-08-29 20:03:42,598 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 20:03:42,598 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 1 case distinctions, treesize of input 9 treesize of output 8 [2023-08-29 20:03:42,651 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 6 [2023-08-29 20:03:42,654 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-08-29 20:03:42,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2023-08-29 20:03:42,996 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:03:42,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010510061] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 20:03:42,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 20:03:42,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20, 19] total 53 [2023-08-29 20:03:42,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888282149] [2023-08-29 20:03:42,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 20:03:42,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-08-29 20:03:42,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:03:42,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-08-29 20:03:42,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=380, Invalid=2472, Unknown=10, NotChecked=0, Total=2862 [2023-08-29 20:03:44,027 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 239 [2023-08-29 20:03:44,028 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 329 transitions, 5750 flow. Second operand has 54 states, 54 states have (on average 49.27777777777778) internal successors, (2661), 54 states have internal predecessors, (2661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:03:44,028 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:03:44,028 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 239 [2023-08-29 20:03:44,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:03:47,123 INFO L130 PetriNetUnfolder]: 155/888 cut-off events. [2023-08-29 20:03:47,123 INFO L131 PetriNetUnfolder]: For 12807/12807 co-relation queries the response was YES. [2023-08-29 20:03:47,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6937 conditions, 888 events. 155/888 cut-off events. For 12807/12807 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 4333 event pairs, 0 based on Foata normal form. 3/890 useless extension candidates. Maximal degree in co-relation 6790. Up to 160 conditions per place. [2023-08-29 20:03:47,130 INFO L137 encePairwiseOnDemand]: 226/239 looper letters, 156 selfloop transitions, 232 changer transitions 0/390 dead transitions. [2023-08-29 20:03:47,130 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 390 transitions, 7053 flow [2023-08-29 20:03:47,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2023-08-29 20:03:47,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2023-08-29 20:03:47,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 2554 transitions. [2023-08-29 20:03:47,146 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.20953318565920093 [2023-08-29 20:03:47,146 INFO L72 ComplementDD]: Start complementDD. Operand 51 states and 2554 transitions. [2023-08-29 20:03:47,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 2554 transitions. [2023-08-29 20:03:47,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:03:47,147 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 51 states and 2554 transitions. [2023-08-29 20:03:47,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 52 states, 51 states have (on average 50.07843137254902) internal successors, (2554), 51 states have internal predecessors, (2554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:03:47,159 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 52 states, 52 states have (on average 239.0) internal successors, (12428), 52 states have internal predecessors, (12428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:03:47,160 INFO L81 ComplementDD]: Finished complementDD. Result has 52 states, 52 states have (on average 239.0) internal successors, (12428), 52 states have internal predecessors, (12428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:03:47,160 INFO L175 Difference]: Start difference. First operand has 257 places, 329 transitions, 5750 flow. Second operand 51 states and 2554 transitions. [2023-08-29 20:03:47,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 390 transitions, 7053 flow [2023-08-29 20:03:47,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 390 transitions, 6686 flow, removed 18 selfloop flow, removed 16 redundant places. [2023-08-29 20:03:47,287 INFO L231 Difference]: Finished difference. Result has 290 places, 337 transitions, 6047 flow [2023-08-29 20:03:47,288 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=5255, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=213, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=51, PETRI_FLOW=6047, PETRI_PLACES=290, PETRI_TRANSITIONS=337} [2023-08-29 20:03:47,288 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 232 predicate places. [2023-08-29 20:03:47,288 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 337 transitions, 6047 flow [2023-08-29 20:03:47,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 49.27777777777778) internal successors, (2661), 54 states have internal predecessors, (2661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:03:47,289 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:03:47,289 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2023-08-29 20:03:47,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-08-29 20:03:47,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 20:03:47,495 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting thr1Err28ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err28ASSERT_VIOLATIONMEMORY_LEAK, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-29 20:03:47,496 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:03:47,496 INFO L85 PathProgramCache]: Analyzing trace with hash 658635143, now seen corresponding path program 2 times [2023-08-29 20:03:47,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:03:47,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819252104] [2023-08-29 20:03:47,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:03:47,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:03:47,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:03:48,176 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 10 proven. 17 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-29 20:03:48,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:03:48,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819252104] [2023-08-29 20:03:48,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819252104] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 20:03:48,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655191668] [2023-08-29 20:03:48,176 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 20:03:48,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 20:03:48,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:03:48,177 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 20:03:48,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-08-29 20:03:48,314 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-29 20:03:48,314 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:03:48,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-29 20:03:48,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:03:48,323 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 20:03:48,323 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 20:03:48,587 INFO L321 Elim1Store]: treesize reduction 42, result has 39.1 percent of original size [2023-08-29 20:03:48,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 195 treesize of output 222 [2023-08-29 20:03:48,630 INFO L321 Elim1Store]: treesize reduction 68, result has 30.6 percent of original size [2023-08-29 20:03:48,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 226 [2023-08-29 20:03:48,645 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 20:03:48,645 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 160 treesize of output 161 [2023-08-29 20:03:48,666 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-29 20:03:48,666 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 152 treesize of output 144 [2023-08-29 20:03:48,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2023-08-29 20:03:48,885 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-29 20:03:48,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 19 [2023-08-29 20:03:55,161 WARN L222 SmtUtils]: Spent 6.20s on a formula simplification. DAG size of input: 55 DAG size of output: 32 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 20:03:55,231 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 20:03:55,381 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 70 treesize of output 70 [2023-08-29 20:03:55,394 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-08-29 20:03:55,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 45 [2023-08-29 20:03:55,404 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-08-29 20:03:55,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 39 [2023-08-29 20:03:55,409 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-08-29 20:03:55,420 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-29 20:03:55,420 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 19 treesize of output 13 [2023-08-29 20:03:55,456 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-08-29 20:03:55,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 20:03:55,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-08-29 20:03:55,680 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-29 20:03:55,680 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 200 treesize of output 192 [2023-08-29 20:03:55,692 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-29 20:03:55,693 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 192 treesize of output 184 [2023-08-29 20:03:55,965 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2023-08-29 20:03:55,965 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 34 [2023-08-29 20:03:55,968 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-29 20:03:55,971 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2023-08-29 20:03:55,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 28 [2023-08-29 20:03:56,019 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-08-29 20:03:56,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655191668] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 20:03:56,020 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 20:03:56,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 23 [2023-08-29 20:03:56,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105049957] [2023-08-29 20:03:56,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 20:03:56,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-08-29 20:03:56,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:03:56,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-08-29 20:03:56,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=493, Unknown=9, NotChecked=0, Total=600 [2023-08-29 20:03:56,488 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 239 [2023-08-29 20:03:56,488 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 337 transitions, 6047 flow. Second operand has 25 states, 25 states have (on average 48.84) internal successors, (1221), 25 states have internal predecessors, (1221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:03:56,488 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:03:56,488 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 239 [2023-08-29 20:03:56,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:04:02,988 WARN L222 SmtUtils]: Spent 6.30s on a formula simplification. DAG size of input: 94 DAG size of output: 79 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 20:04:09,943 INFO L130 PetriNetUnfolder]: 155/893 cut-off events. [2023-08-29 20:04:09,943 INFO L131 PetriNetUnfolder]: For 13379/13379 co-relation queries the response was YES. [2023-08-29 20:04:09,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7148 conditions, 893 events. 155/893 cut-off events. For 13379/13379 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 4385 event pairs, 2 based on Foata normal form. 6/898 useless extension candidates. Maximal degree in co-relation 7002. Up to 261 conditions per place. [2023-08-29 20:04:09,952 INFO L137 encePairwiseOnDemand]: 224/239 looper letters, 166 selfloop transitions, 207 changer transitions 0/375 dead transitions. [2023-08-29 20:04:09,952 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 375 transitions, 7186 flow [2023-08-29 20:04:09,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-08-29 20:04:09,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-08-29 20:04:09,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1087 transitions. [2023-08-29 20:04:09,955 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.20673259794598706 [2023-08-29 20:04:09,955 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 1087 transitions. [2023-08-29 20:04:09,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 1087 transitions. [2023-08-29 20:04:09,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:04:09,955 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 1087 transitions. [2023-08-29 20:04:09,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 49.40909090909091) internal successors, (1087), 22 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:04:09,960 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 239.0) internal successors, (5497), 23 states have internal predecessors, (5497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:04:09,960 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 239.0) internal successors, (5497), 23 states have internal predecessors, (5497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:04:09,960 INFO L175 Difference]: Start difference. First operand has 290 places, 337 transitions, 6047 flow. Second operand 22 states and 1087 transitions. [2023-08-29 20:04:09,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 375 transitions, 7186 flow [2023-08-29 20:04:10,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 375 transitions, 6802 flow, removed 47 selfloop flow, removed 28 redundant places. [2023-08-29 20:04:10,053 INFO L231 Difference]: Finished difference. Result has 284 places, 353 transitions, 6382 flow [2023-08-29 20:04:10,054 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=5693, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=191, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=6382, PETRI_PLACES=284, PETRI_TRANSITIONS=353} [2023-08-29 20:04:10,054 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 226 predicate places. [2023-08-29 20:04:10,054 INFO L495 AbstractCegarLoop]: Abstraction has has 284 places, 353 transitions, 6382 flow [2023-08-29 20:04:10,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 48.84) internal successors, (1221), 25 states have internal predecessors, (1221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:04:10,055 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:04:10,055 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2023-08-29 20:04:10,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-08-29 20:04:10,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-08-29 20:04:10,261 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting thr1Err13ASSERT_VIOLATIONARRAY_INDEX === [thr1Err28ASSERT_VIOLATIONMEMORY_LEAK, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-29 20:04:10,262 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:04:10,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1473399847, now seen corresponding path program 1 times [2023-08-29 20:04:10,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:04:10,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792137265] [2023-08-29 20:04:10,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:04:10,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:04:10,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:04:10,617 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:04:10,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:04:10,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792137265] [2023-08-29 20:04:10,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792137265] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 20:04:10,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329485756] [2023-08-29 20:04:10,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:04:10,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 20:04:10,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:04:10,619 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 20:04:10,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-08-29 20:04:10,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:04:10,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 12 conjunts are in the unsatisfiable core [2023-08-29 20:04:10,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:04:10,940 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 13 treesize of output 9 [2023-08-29 20:04:10,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-08-29 20:04:10,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-08-29 20:04:10,968 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:04:10,968 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 20:04:11,022 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 20:04:11,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 102 treesize of output 116 [2023-08-29 20:04:11,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 87 [2023-08-29 20:04:11,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 83 [2023-08-29 20:04:11,045 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 20:04:11,045 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 1 case distinctions, treesize of input 9 treesize of output 8 [2023-08-29 20:04:11,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-08-29 20:04:11,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2023-08-29 20:04:11,175 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 20:04:11,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 113 [2023-08-29 20:04:11,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 87 [2023-08-29 20:04:11,182 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 83 [2023-08-29 20:04:11,288 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 20:04:11,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 113 [2023-08-29 20:04:11,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 87 [2023-08-29 20:04:11,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 83 [2023-08-29 20:04:11,389 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 20:04:11,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 113 [2023-08-29 20:04:11,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 87 [2023-08-29 20:04:11,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 83 [2023-08-29 20:04:11,441 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:04:11,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329485756] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 20:04:11,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 20:04:11,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-08-29 20:04:11,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015440717] [2023-08-29 20:04:11,442 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 20:04:11,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-29 20:04:11,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:04:11,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-29 20:04:11,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2023-08-29 20:04:11,638 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 239 [2023-08-29 20:04:11,639 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 353 transitions, 6382 flow. Second operand has 13 states, 13 states have (on average 100.3076923076923) internal successors, (1304), 13 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:04:11,639 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:04:11,639 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 239 [2023-08-29 20:04:11,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:04:12,557 INFO L130 PetriNetUnfolder]: 228/1353 cut-off events. [2023-08-29 20:04:12,557 INFO L131 PetriNetUnfolder]: For 23677/23678 co-relation queries the response was YES. [2023-08-29 20:04:12,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11425 conditions, 1353 events. 228/1353 cut-off events. For 23677/23678 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 6786 event pairs, 1 based on Foata normal form. 20/1369 useless extension candidates. Maximal degree in co-relation 11279. Up to 240 conditions per place. [2023-08-29 20:04:12,568 INFO L137 encePairwiseOnDemand]: 234/239 looper letters, 584 selfloop transitions, 102 changer transitions 0/704 dead transitions. [2023-08-29 20:04:12,568 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 704 transitions, 14033 flow [2023-08-29 20:04:12,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-08-29 20:04:12,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-08-29 20:04:12,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1872 transitions. [2023-08-29 20:04:12,571 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4351464435146444 [2023-08-29 20:04:12,571 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1872 transitions. [2023-08-29 20:04:12,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1872 transitions. [2023-08-29 20:04:12,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:04:12,572 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1872 transitions. [2023-08-29 20:04:12,574 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 104.0) internal successors, (1872), 18 states have internal predecessors, (1872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:04:12,577 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 239.0) internal successors, (4541), 19 states have internal predecessors, (4541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:04:12,577 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 239.0) internal successors, (4541), 19 states have internal predecessors, (4541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:04:12,577 INFO L175 Difference]: Start difference. First operand has 284 places, 353 transitions, 6382 flow. Second operand 18 states and 1872 transitions. [2023-08-29 20:04:12,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 704 transitions, 14033 flow [2023-08-29 20:04:12,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 704 transitions, 13544 flow, removed 19 selfloop flow, removed 13 redundant places. [2023-08-29 20:04:12,711 INFO L231 Difference]: Finished difference. Result has 294 places, 397 transitions, 7817 flow [2023-08-29 20:04:12,711 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=6160, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=7817, PETRI_PLACES=294, PETRI_TRANSITIONS=397} [2023-08-29 20:04:12,712 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 236 predicate places. [2023-08-29 20:04:12,712 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 397 transitions, 7817 flow [2023-08-29 20:04:12,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 100.3076923076923) internal successors, (1304), 13 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:04:12,713 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:04:12,713 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1] [2023-08-29 20:04:12,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-08-29 20:04:12,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-08-29 20:04:12,920 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting thr1Err13ASSERT_VIOLATIONARRAY_INDEX === [thr1Err28ASSERT_VIOLATIONMEMORY_LEAK, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-29 20:04:12,920 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:04:12,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1055907867, now seen corresponding path program 1 times [2023-08-29 20:04:12,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:04:12,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942554421] [2023-08-29 20:04:12,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:04:12,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:04:12,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:04:14,232 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:04:14,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:04:14,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942554421] [2023-08-29 20:04:14,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942554421] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 20:04:14,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501345084] [2023-08-29 20:04:14,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:04:14,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 20:04:14,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:04:14,237 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-29 20:04:14,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-08-29 20:04:14,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:04:14,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 49 conjunts are in the unsatisfiable core [2023-08-29 20:04:14,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:04:14,469 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 20:04:14,490 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-29 20:04:14,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-29 20:04:14,509 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-29 20:04:14,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-29 20:04:14,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-29 20:04:14,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 7 treesize of output 5 [2023-08-29 20:04:14,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-08-29 20:04:14,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2023-08-29 20:04:14,661 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-29 20:04:14,692 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-29 20:04:14,692 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-29 20:04:14,724 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-29 20:04:14,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-29 20:04:14,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2023-08-29 20:04:14,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2023-08-29 20:04:14,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-29 20:04:14,901 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-29 20:04:14,902 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-29 20:04:14,945 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-08-29 20:04:14,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-08-29 20:04:14,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 20:04:15,217 INFO L321 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2023-08-29 20:04:15,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 171 treesize of output 177 [2023-08-29 20:04:15,233 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-29 20:04:15,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 157 treesize of output 164 [2023-08-29 20:04:15,253 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-29 20:04:15,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 149 treesize of output 159 [2023-08-29 20:04:15,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 142 [2023-08-29 20:04:15,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2023-08-29 20:04:15,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2023-08-29 20:04:15,431 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 20:04:15,431 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 20:04:15,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 7 treesize of output 5 [2023-08-29 20:04:15,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2023-08-29 20:04:15,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-29 20:04:15,503 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 21 treesize of output 21 [2023-08-29 20:04:15,525 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:04:15,525 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 20:04:15,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 98 [2023-08-29 20:04:15,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 94 [2023-08-29 20:04:15,656 WARN L839 $PredicateComparison]: unable to prove that (and (or (< 64 c_~next_alloc_idx~0) (forall ((|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1794 (Array Int Int))) (or (< (mod (+ (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1794) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 4294967296) 65) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0)))) (or (<= c_~next_alloc_idx~0 64) (forall ((|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1794 (Array Int Int)) (v_ArrVal_1792 (Array Int Int))) (or (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0) (< (mod (+ 1 (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_1792) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1794) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)) 4294967296) 65))))) is different from false [2023-08-29 20:04:15,818 WARN L839 $PredicateComparison]: unable to prove that (and (or (<= c_~next_alloc_idx~0 64) (forall ((v_ArrVal_1790 Int) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1794 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189| Int) (v_ArrVal_1792 (Array Int Int))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_1790) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189|) 0)) (< (mod (+ 1 (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189| v_ArrVal_1792) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1794) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)) 4294967296) 65) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0)))) (forall ((v_ArrVal_1790 Int) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1794 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189| Int)) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_1790) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189|) 0)) (< (mod (+ (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1794) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 4294967296) 65) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0)))) is different from false [2023-08-29 20:04:15,843 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1790 Int) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1794 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189| Int) (v_ArrVal_1789 Int)) (or (< (mod (+ (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1794) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 4294967296) 65) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_1789) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_1790) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189|) 0)) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0))) (or (forall ((v_ArrVal_1790 Int) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1794 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189| Int) (v_ArrVal_1792 (Array Int Int)) (v_ArrVal_1789 Int)) (or (< (mod (+ 1 (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189| v_ArrVal_1792) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1794) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)) 4294967296) 65) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_1789) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_1790) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189|) 0)) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0))) (<= c_~next_alloc_idx~0 64))) is different from false [2023-08-29 20:04:17,615 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 20:04:17,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 113 [2023-08-29 20:04:17,656 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 20:04:17,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 270 treesize of output 306 [2023-08-29 20:04:17,928 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 635 treesize of output 625 [2023-08-29 20:04:18,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 589 treesize of output 587 [2023-08-29 20:04:18,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 587 treesize of output 585 [2023-08-29 20:04:18,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 585 treesize of output 583 [2023-08-29 20:04:18,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 583 treesize of output 575 [2023-08-29 20:04:18,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 575 treesize of output 573 [2023-08-29 20:04:18,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 573 treesize of output 571 [2023-08-29 20:04:18,078 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 571 treesize of output 563 [2023-08-29 20:04:18,089 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 563 treesize of output 561 [2023-08-29 20:04:18,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 561 treesize of output 559 [2023-08-29 20:04:18,111 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 559 treesize of output 557 [2023-08-29 20:04:28,027 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 20:04:28,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 113 [2023-08-29 20:04:28,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 87 [2023-08-29 20:04:50,851 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 20:04:50,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 102 treesize of output 116 [2023-08-29 20:04:50,858 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 87 [2023-08-29 20:04:50,867 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 20:04:50,867 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 1 case distinctions, treesize of input 9 treesize of output 8 [2023-08-29 20:04:50,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-08-29 20:04:50,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-08-29 20:04:50,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-08-29 20:05:02,637 WARN L222 SmtUtils]: Spent 6.63s on a formula simplification. DAG size of input: 82 DAG size of output: 77 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 20:05:14,272 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 36 refuted. 13 times theorem prover too weak. 0 trivial. 12 not checked. [2023-08-29 20:05:14,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501345084] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 20:05:14,272 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 20:05:14,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21, 21] total 57 [2023-08-29 20:05:14,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703042449] [2023-08-29 20:05:14,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 20:05:14,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2023-08-29 20:05:14,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:05:14,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2023-08-29 20:05:14,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=502, Invalid=2569, Unknown=21, NotChecked=330, Total=3422 [2023-08-29 20:05:14,774 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 239 [2023-08-29 20:05:14,775 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 397 transitions, 7817 flow. Second operand has 59 states, 59 states have (on average 54.50847457627118) internal successors, (3216), 59 states have internal predecessors, (3216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:05:14,775 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:05:14,775 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 239 [2023-08-29 20:05:14,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:06:21,133 WARN L222 SmtUtils]: Spent 1.04m on a formula simplification. DAG size of input: 401 DAG size of output: 248 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 20:06:23,893 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 20:07:47,808 WARN L222 SmtUtils]: Spent 1.27m on a formula simplification. DAG size of input: 377 DAG size of output: 217 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 20:07:49,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 20:07:51,231 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 20:07:53,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 20:07:54,919 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (forall ((|v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| Int)) (or (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162|) 0)) (not (= (select (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| 1) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) 1))))) (.cse2 (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193| Int) (v_ArrVal_1774 Int) (v_ArrVal_1775 Int)) (let ((.cse57 (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_1774) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_1775))) (or (not (= 0 (select .cse57 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193|))) (forall ((|v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_164| Int) (v_ArrVal_1776 Int)) (let ((.cse58 (store .cse57 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193| v_ArrVal_1776))) (or (not (= (select .cse58 |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_164|) 0)) (forall ((v_ArrVal_1777 Int)) (let ((.cse59 (store .cse58 |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_164| v_ArrVal_1777))) (or (not (= (select .cse59 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193|) 1)) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| Int) (v_ArrVal_1781 Int) (v_ArrVal_1780 Int)) (let ((.cse61 (store (store .cse59 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193| v_ArrVal_1780) |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_164| v_ArrVal_1781))) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| Int)) (let ((.cse60 (store .cse61 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| 1))) (or (not (= 0 (select .cse60 |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162|))) (forall ((v_prenex_189 Int) (v_prenex_197 Int)) (not (= (select (store (store (store .cse60 |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| 1) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| v_prenex_189) |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| v_prenex_197) |c_ULTIMATE.start_main_~#t~0#1.base|) 0)))))) (not (= (select .cse61 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191|) 0))))))))))))))) (.cse0 (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193| Int) (|v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| Int) (v_ArrVal_1770 Int) (v_ArrVal_1781 Int) (|v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_164| Int) (v_ArrVal_1780 Int) (|v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_166| Int) (v_ArrVal_1774 Int) (v_ArrVal_1776 Int) (v_ArrVal_1775 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_195| Int) (v_ArrVal_1777 Int) (v_ArrVal_1769 Int)) (let ((.cse54 (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_195| v_ArrVal_1769))) (let ((.cse52 (store .cse54 |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_166| v_ArrVal_1770))) (let ((.cse56 (store (store .cse52 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_195| v_ArrVal_1774) |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_166| v_ArrVal_1775))) (let ((.cse53 (store .cse56 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193| v_ArrVal_1776))) (let ((.cse55 (store .cse53 |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_164| v_ArrVal_1777))) (let ((.cse51 (store (store .cse55 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193| v_ArrVal_1780) |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_164| v_ArrVal_1781))) (or (not (= (select (store .cse51 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| 1) |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162|) 0)) (not (= (select .cse52 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_195|) 1)) (not (= (select .cse51 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191|) 0)) (not (= (select .cse53 |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_164|) 0)) (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_195|) 0)) (not (= (select .cse54 |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_166|) 0)) (not (= (select .cse55 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193|) 1)) (not (= (select .cse56 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193|) 0))))))))))) (.cse11 (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| Int) (|v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| Int) (v_ArrVal_1781 Int) (v_ArrVal_1780 Int)) (let ((.cse50 (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_1780) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_1781))) (or (not (= (select .cse50 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191|) 0)) (not (= (select (store .cse50 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| 1) |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162|) 0)))))) (.cse5 (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193| Int) (|v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| Int) (v_ArrVal_1781 Int) (|v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_164| Int) (v_ArrVal_1780 Int) (v_ArrVal_1774 Int) (v_ArrVal_1776 Int) (v_ArrVal_1775 Int) (v_ArrVal_1777 Int)) (let ((.cse49 (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_1774) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_1775))) (let ((.cse48 (store .cse49 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193| v_ArrVal_1776))) (let ((.cse47 (store .cse48 |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_164| v_ArrVal_1777))) (let ((.cse46 (store (store .cse47 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193| v_ArrVal_1780) |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_164| v_ArrVal_1781))) (or (not (= 0 (select (store .cse46 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| 1) |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162|))) (not (= (select .cse47 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193|) 1)) (not (= (select .cse48 |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_164|) 0)) (not (= (select .cse46 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191|) 0)) (not (= 0 (select .cse49 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193|)))))))))) (.cse19 (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193| Int) (|v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| Int) (v_ArrVal_1781 Int) (|v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_164| Int) (v_ArrVal_1780 Int) (v_ArrVal_1776 Int) (v_ArrVal_1775 Int) (v_ArrVal_1777 Int)) (let ((.cse43 (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_1775))) (let ((.cse42 (store .cse43 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193| v_ArrVal_1776))) (let ((.cse45 (store .cse42 |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_164| v_ArrVal_1777))) (let ((.cse44 (store (store .cse45 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193| v_ArrVal_1780) |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_164| v_ArrVal_1781))) (or (not (= (select .cse42 |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_164|) 0)) (not (= (select .cse43 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193|) 0)) (not (= (select (store .cse44 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| 1) |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162|) 0)) (not (= (select .cse45 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193|) 1)) (not (= (select .cse44 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191|) 0))))))))) (.cse6 (< (mod (+ c_~next_alloc_idx~0 5) 4294967296) 65)) (.cse3 (< (mod (+ c_~next_alloc_idx~0 3) 4294967296) 65)) (.cse9 (not (= (select |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) 1))) (.cse27 (not (= (select |c_#valid| |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) 1))) (.cse1 (<= c_~next_alloc_idx~0 64)) (.cse29 (< (select |c_#length| |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) 4)) (.cse10 (= c_~next_alloc_idx~0 0)) (.cse8 (< (mod (+ c_~next_alloc_idx~0 7) 4294967296) 65)) (.cse7 (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193| Int) (|v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| Int) (v_ArrVal_1770 Int) (v_ArrVal_1781 Int) (|v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_164| Int) (v_ArrVal_1780 Int) (|v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_166| Int) (v_ArrVal_1774 Int) (v_ArrVal_1776 Int) (v_ArrVal_1775 Int) (v_ArrVal_1777 Int)) (let ((.cse39 (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_166| v_ArrVal_1770))) (let ((.cse41 (store (store .cse39 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_1774) |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_166| v_ArrVal_1775))) (let ((.cse38 (store .cse41 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193| v_ArrVal_1776))) (let ((.cse40 (store .cse38 |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_164| v_ArrVal_1777))) (let ((.cse37 (store (store .cse40 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193| v_ArrVal_1780) |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_164| v_ArrVal_1781))) (or (not (= (select .cse37 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191|) 0)) (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_166|) 0)) (not (= (select .cse38 |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_164|) 0)) (not (= (select .cse39 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) 1)) (not (= (select .cse40 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193|) 1)) (not (= (select .cse41 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193|) 0)) (not (= (select (store .cse37 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| 1) |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162|) 0))))))))))) (and (or .cse0 .cse1) .cse2 (or .cse3 .cse4) (or .cse1 .cse4) (or .cse5 .cse6) (or .cse7 .cse1) (or .cse1 (forall ((|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1794 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189| Int) (v_ArrVal_1792 (Array Int Int))) (or (< (mod (+ 1 (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189| v_ArrVal_1792) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1794) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)) 4294967296) 65) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0) (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189|) 0))))) (or (and .cse2 (or .cse8 .cse5)) .cse9 .cse10) (forall ((v_ArrVal_1790 Int) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1794 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189| Int) (v_ArrVal_1789 Int)) (or (< (mod (+ (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1794) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 4294967296) 65) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_1789) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_1790) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189|) 0)) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0))) (or .cse11 .cse1) (or (and (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_195| Int)) (or (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_195|) 0)) (forall ((|v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_166| Int) (v_ArrVal_1769 Int)) (let ((.cse18 (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_195| v_ArrVal_1769))) (or (forall ((v_ArrVal_1770 Int)) (let ((.cse12 (store .cse18 |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_166| v_ArrVal_1770))) (or (not (= (select .cse12 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_195|) 1)) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193| Int) (v_ArrVal_1774 Int) (v_ArrVal_1775 Int)) (let ((.cse17 (store (store .cse12 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_195| v_ArrVal_1774) |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_166| v_ArrVal_1775))) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_164| Int) (v_ArrVal_1776 Int)) (let ((.cse13 (store .cse17 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193| v_ArrVal_1776))) (or (not (= (select .cse13 |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_164|) 0)) (forall ((v_ArrVal_1777 Int)) (let ((.cse14 (store .cse13 |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_164| v_ArrVal_1777))) (or (not (= (select .cse14 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193|) 1)) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| Int) (v_ArrVal_1781 Int) (v_ArrVal_1780 Int)) (let ((.cse15 (store (store .cse14 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193| v_ArrVal_1780) |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_164| v_ArrVal_1781))) (or (not (= (select .cse15 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191|) 0)) (forall ((|v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| Int)) (let ((.cse16 (store .cse15 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| 1))) (or (not (= (select .cse16 |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162|) 0)) (forall ((v_prenex_189 Int) (v_prenex_197 Int)) (not (= (select (store (store (store .cse16 |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| 1) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| v_prenex_189) |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| v_prenex_197) |c_ULTIMATE.start_main_~#t~0#1.base|) 0))))))))))))))) (not (= (select .cse17 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193|) 0)))))))) (not (= (select .cse18 |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_166|) 0))))))) (or .cse8 .cse0)) .cse10) (or .cse19 .cse1) (or .cse5 .cse9 .cse1) (or .cse3 .cse11) (or .cse5 .cse1) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193| Int) (v_ArrVal_1775 Int)) (let ((.cse20 (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_1775))) (or (not (= (select .cse20 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193|) 0)) (forall ((|v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_164| Int) (v_ArrVal_1776 Int)) (let ((.cse21 (store .cse20 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193| v_ArrVal_1776))) (or (not (= (select .cse21 |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_164|) 0)) (forall ((v_ArrVal_1777 Int)) (let ((.cse22 (store .cse21 |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_164| v_ArrVal_1777))) (or (not (= (select .cse22 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193|) 1)) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| Int) (v_ArrVal_1781 Int) (v_ArrVal_1780 Int)) (let ((.cse24 (store (store .cse22 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193| v_ArrVal_1780) |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_164| v_ArrVal_1781))) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| Int)) (let ((.cse23 (store .cse24 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| 1))) (or (forall ((v_prenex_189 Int) (v_prenex_197 Int)) (not (= 0 (select (store (store (store .cse23 |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| 1) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| v_prenex_189) |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| v_prenex_197) |c_ULTIMATE.start_main_~#t~0#1.base|)))) (not (= (select .cse23 |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162|) 0))))) (not (= (select .cse24 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191|) 0)))))))))))))) (or (forall ((v_ArrVal_1790 Int) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1794 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189| Int) (v_ArrVal_1792 (Array Int Int)) (v_ArrVal_1789 Int)) (or (< (mod (+ 1 (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189| v_ArrVal_1792) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1794) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)) 4294967296) 65) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_1789) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_1790) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189|) 0)) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0))) .cse1) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| Int) (v_ArrVal_1781 Int) (v_ArrVal_1780 Int)) (let ((.cse26 (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_1780) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_1781))) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| Int)) (let ((.cse25 (store .cse26 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| 1))) (or (forall ((v_prenex_189 Int) (v_prenex_197 Int)) (not (= (select (store (store (store .cse25 |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| 1) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| v_prenex_189) |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| v_prenex_197) |c_ULTIMATE.start_main_~#t~0#1.base|) 0))) (not (= (select .cse25 |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162|) 0))))) (not (= (select .cse26 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191|) 0))))) (or .cse19 .cse6) (or .cse27 .cse9 .cse1) (or (and (or (forall ((v_ArrVal_1790 Int) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1787 (Array Int Int)) (v_ArrVal_1786 (Array Int Int)) (v_ArrVal_1794 (Array Int Int)) (|~#top~0.base| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189| Int) (v_ArrVal_1792 (Array Int Int)) (v_ArrVal_1789 Int)) (or (not (= (select |c_#valid| |~#top~0.base|) 1)) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_1789) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_1790) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189|) 0)) (< (select |c_#length| |~#top~0.base|) 4) (< (mod (+ (select (select (store (store (store (store |c_#memory_int| |~#top~0.base| v_ArrVal_1787) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_1786) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189| v_ArrVal_1792) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1794) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 4294967296) 65) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0))) .cse1) (forall ((|~#top~0.base| Int)) (or (not (= (select |c_#valid| |~#top~0.base|) 1)) (forall ((v_ArrVal_1790 Int) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1787 (Array Int Int)) (v_ArrVal_1786 (Array Int Int)) (v_ArrVal_1794 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189| Int) (v_ArrVal_1789 Int)) (or (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_1789) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_1790) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189|) 0)) (< (mod (+ (select (select (store (let ((.cse28 (store (store |c_#memory_int| |~#top~0.base| v_ArrVal_1787) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_1786))) (store .cse28 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189| (store (select .cse28 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1794) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 4294967296) 65) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0))) (< (select |c_#length| |~#top~0.base|) 4)))) .cse27 .cse29) (forall ((|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1794 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189| Int)) (or (< (mod (+ (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1794) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 4294967296) 65) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0) (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189|) 0)))) (or (and (forall ((v_prenex_189 Int) (v_prenex_197 Int)) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_prenex_189) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_prenex_197) |c_ULTIMATE.start_main_~#t~0#1.base|) 0))) .cse3) .cse27 .cse9) (forall ((|v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| Int)) (let ((.cse30 (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| 1))) (or (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162|) 0)) (not (= (select .cse30 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) 1)) (forall ((v_prenex_189 Int) (v_prenex_197 Int)) (not (= (select (store (store .cse30 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_prenex_189) |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| v_prenex_197) |c_ULTIMATE.start_main_~#t~0#1.base|) 0)))))) (or (forall ((v_ArrVal_1790 Int) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1788 (Array Int Int)) (v_ArrVal_1794 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189| Int) (v_ArrVal_1792 (Array Int Int)) (v_ArrVal_1789 Int)) (or (< (mod (+ (select (select (store (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_1788) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189| v_ArrVal_1792) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1794) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 4294967296) 65) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_1789) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_1790) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189|) 0)) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0))) .cse27 .cse1 .cse29) (or .cse10 (and (forall ((|v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_166| Int)) (or (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_166|) 0)) (forall ((v_ArrVal_1770 Int)) (let ((.cse36 (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_166| v_ArrVal_1770))) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193| Int) (v_ArrVal_1774 Int) (v_ArrVal_1775 Int)) (let ((.cse35 (store (store .cse36 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_1774) |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_166| v_ArrVal_1775))) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_164| Int) (v_ArrVal_1776 Int)) (let ((.cse31 (store .cse35 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193| v_ArrVal_1776))) (or (not (= (select .cse31 |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_164|) 0)) (forall ((v_ArrVal_1777 Int)) (let ((.cse32 (store .cse31 |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_164| v_ArrVal_1777))) (or (not (= (select .cse32 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193|) 1)) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| Int) (v_ArrVal_1781 Int) (v_ArrVal_1780 Int)) (let ((.cse33 (store (store .cse32 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193| v_ArrVal_1780) |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_164| v_ArrVal_1781))) (or (not (= (select .cse33 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191|) 0)) (forall ((|v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| Int)) (let ((.cse34 (store .cse33 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| 1))) (or (forall ((v_prenex_189 Int) (v_prenex_197 Int)) (not (= (select (store (store (store .cse34 |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| 1) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| v_prenex_189) |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| v_prenex_197) |c_ULTIMATE.start_main_~#t~0#1.base|) 0))) (not (= (select .cse34 |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162|) 0)))))))))))))) (not (= (select .cse35 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193|) 0))))) (not (= (select .cse36 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) 1))))))) (or .cse8 .cse7))))) is different from false [2023-08-29 20:07:56,995 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 20:07:57,073 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| Int) (|v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| Int) (v_ArrVal_1781 Int) (v_ArrVal_1780 Int)) (let ((.cse14 (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_1780) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_1781))) (or (not (= (select .cse14 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191|) 0)) (not (= (select (store .cse14 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| 1) |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162|) 0)))))) (.cse5 (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193| Int) (|v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| Int) (v_ArrVal_1781 Int) (|v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_164| Int) (v_ArrVal_1780 Int) (v_ArrVal_1774 Int) (v_ArrVal_1776 Int) (v_ArrVal_1775 Int) (v_ArrVal_1777 Int)) (let ((.cse13 (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_1774) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_1775))) (let ((.cse12 (store .cse13 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193| v_ArrVal_1776))) (let ((.cse11 (store .cse12 |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_164| v_ArrVal_1777))) (let ((.cse10 (store (store .cse11 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193| v_ArrVal_1780) |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_164| v_ArrVal_1781))) (or (not (= 0 (select (store .cse10 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| 1) |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162|))) (not (= (select .cse11 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193|) 1)) (not (= (select .cse12 |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_164|) 0)) (not (= (select .cse10 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191|) 0)) (not (= 0 (select .cse13 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193|)))))))))) (.cse7 (<= c_~next_alloc_idx~0 64))) (and (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193| Int) (v_ArrVal_1774 Int) (v_ArrVal_1775 Int)) (let ((.cse0 (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_1774) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_1775))) (or (not (= 0 (select .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193|))) (forall ((|v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_164| Int) (v_ArrVal_1776 Int)) (let ((.cse1 (store .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193| v_ArrVal_1776))) (or (not (= (select .cse1 |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_164|) 0)) (forall ((v_ArrVal_1777 Int)) (let ((.cse2 (store .cse1 |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_164| v_ArrVal_1777))) (or (not (= (select .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193|) 1)) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| Int) (v_ArrVal_1781 Int) (v_ArrVal_1780 Int)) (let ((.cse4 (store (store .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193| v_ArrVal_1780) |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_164| v_ArrVal_1781))) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| Int)) (let ((.cse3 (store .cse4 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| 1))) (or (not (= 0 (select .cse3 |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162|))) (forall ((v_prenex_189 Int) (v_prenex_197 Int)) (not (= (select (store (store (store .cse3 |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| 1) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| v_prenex_189) |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| v_prenex_197) |c_ULTIMATE.start_main_~#t~0#1.base|) 0)))))) (not (= (select .cse4 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191|) 0)))))))))))))) (or .cse5 (< (mod (+ c_~next_alloc_idx~0 5) 4294967296) 65)) (forall ((v_ArrVal_1790 Int) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1794 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189| Int) (v_ArrVal_1789 Int)) (or (< (mod (+ (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1794) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 4294967296) 65) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_1789) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_1790) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189|) 0)) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0))) (or .cse6 .cse7) (or (< (mod (+ c_~next_alloc_idx~0 3) 4294967296) 65) .cse6) (or .cse5 .cse7) (or (forall ((v_ArrVal_1790 Int) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1794 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189| Int) (v_ArrVal_1792 (Array Int Int)) (v_ArrVal_1789 Int)) (or (< (mod (+ 1 (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189| v_ArrVal_1792) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1794) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)) 4294967296) 65) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_1789) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_1790) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189|) 0)) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0))) .cse7) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| Int) (v_ArrVal_1781 Int) (v_ArrVal_1780 Int)) (let ((.cse9 (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_1780) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_1781))) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| Int)) (let ((.cse8 (store .cse9 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| 1))) (or (forall ((v_prenex_189 Int) (v_prenex_197 Int)) (not (= (select (store (store (store .cse8 |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| 1) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| v_prenex_189) |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| v_prenex_197) |c_ULTIMATE.start_main_~#t~0#1.base|) 0))) (not (= (select .cse8 |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162|) 0))))) (not (= (select .cse9 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191|) 0))))))) is different from false [2023-08-29 20:07:59,483 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193| Int) (|v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| Int) (v_ArrVal_1781 Int) (|v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_164| Int) (v_ArrVal_1780 Int) (v_ArrVal_1776 Int) (v_ArrVal_1775 Int) (v_ArrVal_1777 Int)) (let ((.cse12 (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_1775))) (let ((.cse11 (store .cse12 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193| v_ArrVal_1776))) (let ((.cse14 (store .cse11 |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_164| v_ArrVal_1777))) (let ((.cse13 (store (store .cse14 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193| v_ArrVal_1780) |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_164| v_ArrVal_1781))) (or (not (= (select .cse11 |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_164|) 0)) (not (= (select .cse12 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193|) 0)) (not (= (select (store .cse13 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| 1) |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162|) 0)) (not (= (select .cse14 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193|) 1)) (not (= (select .cse13 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191|) 0))))))))) (.cse9 (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| Int) (|v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| Int) (v_ArrVal_1781 Int)) (let ((.cse10 (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_1781))) (or (not (= (select (store .cse10 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| 1) |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162|) 0)) (not (= 0 (select .cse10 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191|))))))) (.cse0 (<= c_~next_alloc_idx~0 64))) (and (or .cse0 (forall ((v_ArrVal_1790 Int) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1794 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189| Int) (v_ArrVal_1792 (Array Int Int))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_1790) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189|) 0)) (< (mod (+ 1 (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189| v_ArrVal_1792) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1794) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)) 4294967296) 65) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0)))) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| Int) (v_ArrVal_1781 Int)) (let ((.cse2 (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_1781))) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| Int)) (let ((.cse1 (store .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| 1))) (or (not (= (select .cse1 |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162|) 0)) (forall ((v_prenex_189 Int) (v_prenex_197 Int)) (not (= (select (store (store (store .cse1 |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| 1) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| v_prenex_189) |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| v_prenex_197) |c_ULTIMATE.start_main_~#t~0#1.base|) 0)))))) (not (= 0 (select .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191|)))))) (or .cse3 .cse0) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193| Int) (v_ArrVal_1775 Int)) (let ((.cse4 (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_1775))) (or (not (= (select .cse4 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193|) 0)) (forall ((|v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_164| Int) (v_ArrVal_1776 Int)) (let ((.cse5 (store .cse4 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193| v_ArrVal_1776))) (or (not (= (select .cse5 |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_164|) 0)) (forall ((v_ArrVal_1777 Int)) (let ((.cse6 (store .cse5 |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_164| v_ArrVal_1777))) (or (not (= (select .cse6 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193|) 1)) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| Int) (v_ArrVal_1781 Int) (v_ArrVal_1780 Int)) (let ((.cse8 (store (store .cse6 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193| v_ArrVal_1780) |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_164| v_ArrVal_1781))) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| Int)) (let ((.cse7 (store .cse8 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| 1))) (or (forall ((v_prenex_189 Int) (v_prenex_197 Int)) (not (= 0 (select (store (store (store .cse7 |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| 1) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| v_prenex_189) |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| v_prenex_197) |c_ULTIMATE.start_main_~#t~0#1.base|)))) (not (= (select .cse7 |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162|) 0))))) (not (= (select .cse8 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191|) 0)))))))))))))) (or .cse3 (< (mod (+ c_~next_alloc_idx~0 5) 4294967296) 65)) (or .cse9 (< (mod (+ c_~next_alloc_idx~0 3) 4294967296) 65)) (forall ((v_ArrVal_1790 Int) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1794 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189| Int)) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_1790) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189|) 0)) (< (mod (+ (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1794) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 4294967296) 65) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0))) (or .cse9 .cse0))) is different from false [2023-08-29 20:08:22,440 WARN L222 SmtUtils]: Spent 17.90s on a formula simplification. DAG size of input: 123 DAG size of output: 102 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 20:08:30,726 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (forall ((|v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| Int)) (or (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162|) 0)) (not (= (select (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| 1) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) 1))))) (.cse0 (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| Int) (|v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| Int) (v_ArrVal_1781 Int) (|v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_164| Int) (v_ArrVal_1780 Int) (v_ArrVal_1777 Int)) (let ((.cse19 (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_164| v_ArrVal_1777))) (let ((.cse20 (store (store .cse19 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_1780) |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_164| v_ArrVal_1781))) (or (not (= (select .cse19 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) 1)) (not (= (select (store .cse20 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| 1) |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162|) 0)) (not (= (select .cse20 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191|) 0)) (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_164|) 0))))))) (.cse9 (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| Int) (|v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| Int)) (or (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191|) 0)) (not (= (select (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| 1) |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162|) 0))))) (.cse2 (< (mod (+ c_~next_alloc_idx~0 3) 4294967296) 65)) (.cse14 (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193| Int) (|v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| Int) (v_ArrVal_1781 Int) (|v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_164| Int) (v_ArrVal_1780 Int) (v_ArrVal_1776 Int) (v_ArrVal_1777 Int)) (let ((.cse16 (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193| v_ArrVal_1776))) (let ((.cse18 (store .cse16 |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_164| v_ArrVal_1777))) (let ((.cse17 (store (store .cse18 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193| v_ArrVal_1780) |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_164| v_ArrVal_1781))) (or (not (= (select .cse16 |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_164|) 0)) (not (= (select .cse17 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191|) 0)) (not (= (select .cse18 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193|) 1)) (not (= (select (store .cse17 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| 1) |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162|) 0)) (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193|) 0)))))))) (.cse5 (< (mod (+ c_~next_alloc_idx~0 5) 4294967296) 65)) (.cse1 (<= c_~next_alloc_idx~0 64))) (and (or .cse0 .cse1) (or .cse2 .cse3) (or .cse1 .cse3) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| Int)) (or (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191|) 0)) (forall ((|v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| Int)) (let ((.cse4 (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| 1))) (or (forall ((v_prenex_189 Int) (v_prenex_197 Int)) (not (= (select (store (store (store .cse4 |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| 1) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| v_prenex_189) |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| v_prenex_197) |c_ULTIMATE.start_main_~#t~0#1.base|) 0))) (not (= (select .cse4 |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162|) 0))))))) (or .cse0 .cse5) (or .cse1 (forall ((|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1794 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189| Int) (v_ArrVal_1792 (Array Int Int))) (or (< (mod (+ 1 (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189| v_ArrVal_1792) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1794) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)) 4294967296) 65) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0) (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189|) 0))))) (forall ((|v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_164| Int)) (or (forall ((v_ArrVal_1777 Int)) (let ((.cse6 (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_164| v_ArrVal_1777))) (or (not (= (select .cse6 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) 1)) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| Int) (v_ArrVal_1781 Int) (v_ArrVal_1780 Int)) (let ((.cse7 (store (store .cse6 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_1780) |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_164| v_ArrVal_1781))) (or (not (= (select .cse7 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191|) 0)) (forall ((|v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| Int)) (let ((.cse8 (store .cse7 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| 1))) (or (not (= (select .cse8 |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162|) 0)) (forall ((v_prenex_189 Int) (v_prenex_197 Int)) (not (= (select (store (store (store .cse8 |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| 1) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| v_prenex_189) |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| v_prenex_197) |c_ULTIMATE.start_main_~#t~0#1.base|) 0)))))))))))) (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_164|) 0)))) (or .cse9 .cse1) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193| Int)) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_164| Int) (v_ArrVal_1776 Int)) (let ((.cse10 (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193| v_ArrVal_1776))) (or (not (= (select .cse10 |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_164|) 0)) (forall ((v_ArrVal_1777 Int)) (let ((.cse13 (store .cse10 |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_164| v_ArrVal_1777))) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| Int) (v_ArrVal_1781 Int) (v_ArrVal_1780 Int)) (let ((.cse12 (store (store .cse13 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193| v_ArrVal_1780) |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_164| v_ArrVal_1781))) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| Int)) (let ((.cse11 (store .cse12 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| 1))) (or (forall ((v_prenex_189 Int) (v_prenex_197 Int)) (not (= (select (store (store (store .cse11 |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| 1) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| v_prenex_189) |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| v_prenex_197) |c_ULTIMATE.start_main_~#t~0#1.base|) 0))) (not (= (select .cse11 |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162|) 0))))) (not (= (select .cse12 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191|) 0))))) (not (= (select .cse13 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193|) 1)))))))) (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193|) 0)))) (or .cse14 .cse1) (or .cse9 .cse2) (forall ((|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1794 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189| Int)) (or (< (mod (+ (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1794) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 4294967296) 65) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0) (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189|) 0)))) (or .cse14 .cse5) (or (< 64 c_~next_alloc_idx~0) (forall ((|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1794 (Array Int Int))) (or (< (mod (+ (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1794) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 4294967296) 65) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0)))) (forall ((|v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| Int)) (let ((.cse15 (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| 1))) (or (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162|) 0)) (not (= (select .cse15 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) 1)) (forall ((v_prenex_189 Int) (v_prenex_197 Int)) (not (= (select (store (store .cse15 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_prenex_189) |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| v_prenex_197) |c_ULTIMATE.start_main_~#t~0#1.base|) 0)))))) (or .cse1 (forall ((|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1794 (Array Int Int)) (v_ArrVal_1792 (Array Int Int))) (or (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0) (< (mod (+ 1 (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_1792) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1794) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)) 4294967296) 65)))))) is different from false [2023-08-29 20:08:31,597 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (not (= (select |c_#valid| |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) 1))) (.cse2 (<= c_~next_alloc_idx~0 64)) (.cse1 (not (= (select |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) 1))) (.cse0 (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| Int) (|v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| Int) (v_ArrVal_1781 Int) (v_ArrVal_1780 Int)) (let ((.cse6 (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_1780) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_1781))) (or (not (= (select .cse6 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191|) 0)) (not (= (select (store .cse6 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| 1) |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162|) 0))))))) (and (or .cse0 .cse1 .cse2) (or .cse3 .cse1 .cse2) (or (and (forall ((v_prenex_189 Int) (v_prenex_197 Int)) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_prenex_189) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_prenex_197) |c_ULTIMATE.start_main_~#t~0#1.base|) 0))) (< (mod (+ c_~next_alloc_idx~0 3) 4294967296) 65)) .cse3 .cse1) (or (< 64 c_~next_alloc_idx~0) (forall ((|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1794 (Array Int Int))) (or (< (mod (+ (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1794) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 4294967296) 65) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0)))) (or .cse2 (forall ((|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1794 (Array Int Int)) (v_ArrVal_1792 (Array Int Int))) (or (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0) (< (mod (+ 1 (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_1792) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1794) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)) 4294967296) 65)))) (or .cse1 (and (or .cse0 (< (mod (+ c_~next_alloc_idx~0 5) 4294967296) 65)) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| Int) (v_ArrVal_1781 Int) (v_ArrVal_1780 Int)) (let ((.cse5 (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_1780) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_1781))) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| Int)) (let ((.cse4 (store .cse5 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| 1))) (or (forall ((v_prenex_189 Int) (v_prenex_197 Int)) (not (= (select (store (store (store .cse4 |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| 1) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| v_prenex_189) |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| v_prenex_197) |c_ULTIMATE.start_main_~#t~0#1.base|) 0))) (not (= (select .cse4 |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162|) 0))))) (not (= (select .cse5 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191|) 0))))))))) is different from false [2023-08-29 20:08:53,166 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 20:08:54,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 20:09:28,944 WARN L222 SmtUtils]: Spent 19.41s on a formula simplification. DAG size of input: 156 DAG size of output: 137 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 20:09:30,985 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 20:09:33,073 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 20:09:35,077 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 20:09:37,112 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 20:09:39,119 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 20:09:41,127 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 20:09:43,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 20:09:45,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 20:09:47,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 20:09:49,305 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 20:09:50,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 20:09:53,041 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 20:09:55,688 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 20:09:57,701 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 20:10:25,712 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 20:10:47,548 WARN L222 SmtUtils]: Spent 15.23s on a formula simplification. DAG size of input: 156 DAG size of output: 138 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 20:10:49,577 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 20:10:51,583 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 20:10:53,593 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 20:10:55,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 20:10:57,732 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 20:10:59,805 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 20:11:01,816 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 20:11:03,833 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 20:11:05,842 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 20:11:07,847 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 20:11:09,851 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 20:11:11,856 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 20:11:13,858 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 20:11:15,861 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 20:11:17,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 20:11:20,095 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 20:11:22,132 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 20:11:24,142 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 20:11:25,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 20:11:27,908 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 20:11:29,949 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 20:11:31,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 20:11:34,057 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 20:11:36,090 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 20:11:38,103 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 20:11:40,112 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 20:11:42,534 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 20:11:44,627 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 20:11:46,705 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 20:11:48,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 20:11:50,808 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 20:11:52,813 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 20:11:54,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 [1] [2023-08-29 20:11:57,050 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 20:11:59,064 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 20:12:01,103 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 20:12:03,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 20:12:05,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 [1] [2023-08-29 20:12:07,233 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 20:12:08,614 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 [1] [2023-08-29 20:12:10,631 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 20:12:12,682 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 20:12:15,197 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 20:12:17,200 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 20:12:19,203 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 20:12:21,813 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 20:12:23,853 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 20:12:25,858 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 20:12:27,996 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 20:12:30,014 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 20:12:32,040 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 20:12:34,053 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 20:12:36,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 20:12:38,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 20:12:40,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 20:12:42,185 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 20:12:44,195 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 20:12:47,056 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 20:12:49,118 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 20:12:51,123 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 20:12:53,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 20:12:55,078 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 20:12:57,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 20:12:58,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 20:13:01,221 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 20:13:23,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 [1] [2023-08-29 20:13:25,075 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 20:13:27,095 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 20:13:29,123 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 20:13:31,729 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 20:13:33,745 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 20:13:35,781 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 20:13:37,898 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 20:13:39,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 20:13:41,934 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 20:13:43,635 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 20:13:43,780 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| Int) (|v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| Int) (v_ArrVal_1781 Int) (v_ArrVal_1780 Int)) (let ((.cse4 (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_1780) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_1781))) (or (not (= (select .cse4 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191|) 0)) (not (= (select (store .cse4 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| 1) |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162|) 0)))))) (.cse1 (<= c_~next_alloc_idx~0 64))) (and (forall ((v_ArrVal_1790 Int) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1794 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189| Int) (v_ArrVal_1789 Int)) (or (< (mod (+ (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1794) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 4294967296) 65) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_1789) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_1790) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189|) 0)) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0))) (or .cse0 .cse1) (or (< (mod (+ c_~next_alloc_idx~0 3) 4294967296) 65) .cse0) (or (forall ((v_ArrVal_1790 Int) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1794 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189| Int) (v_ArrVal_1792 (Array Int Int)) (v_ArrVal_1789 Int)) (or (< (mod (+ 1 (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189| v_ArrVal_1792) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1794) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)) 4294967296) 65) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_1789) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_1790) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189|) 0)) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0))) .cse1) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| Int) (v_ArrVal_1781 Int) (v_ArrVal_1780 Int)) (let ((.cse3 (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_1780) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_1781))) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| Int)) (let ((.cse2 (store .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| 1))) (or (forall ((v_prenex_189 Int) (v_prenex_197 Int)) (not (= (select (store (store (store .cse2 |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| 1) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| v_prenex_189) |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| v_prenex_197) |c_ULTIMATE.start_main_~#t~0#1.base|) 0))) (not (= (select .cse2 |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162|) 0))))) (not (= (select .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191|) 0))))))) is different from false [2023-08-29 20:13:45,787 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 20:13:47,995 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 20:13:49,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 20:13:51,734 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 20:13:53,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 20:13:56,066 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 20:13:58,071 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 20:14:00,077 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 20:14:02,096 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 20:14:04,424 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 20:14:06,598 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 20:14:08,969 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 20:14:10,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 20:14:12,985 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 20:14:14,999 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 20:14:17,049 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 20:14:47,880 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 [1] [2023-08-29 20:14:50,210 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 20:14:52,249 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 20:14:54,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 20:14:56,269 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 20:14:58,302 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 20:15:00,555 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 20:15:02,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 20:15:02,974 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (forall ((|v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| Int)) (or (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162|) 0)) (not (= (select (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| 1) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) 1))))) (.cse0 (< (mod (+ c_~next_alloc_idx~0 3) 4294967296) 65)) (.cse3 (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| Int) (|v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| Int) (v_ArrVal_1781 Int) (v_ArrVal_1780 Int)) (let ((.cse7 (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_1780) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_1781))) (or (not (= (select .cse7 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191|) 0)) (not (= (select (store .cse7 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| 1) |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162|) 0)))))) (.cse2 (<= c_~next_alloc_idx~0 64))) (and (or .cse0 .cse1) (or .cse2 .cse1) (forall ((v_ArrVal_1790 Int) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1794 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189| Int) (v_ArrVal_1789 Int)) (or (< (mod (+ (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1794) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 4294967296) 65) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_1789) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_1790) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189|) 0)) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0))) (or .cse3 .cse2) (or .cse0 .cse3) (or (forall ((v_ArrVal_1790 Int) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1794 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189| Int) (v_ArrVal_1792 (Array Int Int)) (v_ArrVal_1789 Int)) (or (< (mod (+ 1 (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189| v_ArrVal_1792) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1794) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)) 4294967296) 65) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_1789) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_1790) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189|) 0)) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0))) .cse2) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| Int) (v_ArrVal_1781 Int) (v_ArrVal_1780 Int)) (let ((.cse5 (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_1780) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_1781))) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| Int)) (let ((.cse4 (store .cse5 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| 1))) (or (forall ((v_prenex_189 Int) (v_prenex_197 Int)) (not (= (select (store (store (store .cse4 |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| 1) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| v_prenex_189) |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| v_prenex_197) |c_ULTIMATE.start_main_~#t~0#1.base|) 0))) (not (= (select .cse4 |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162|) 0))))) (not (= (select .cse5 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191|) 0))))) (forall ((|v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| Int)) (let ((.cse6 (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| 1))) (or (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162|) 0)) (not (= (select .cse6 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) 1)) (forall ((v_prenex_189 Int) (v_prenex_197 Int)) (not (= (select (store (store .cse6 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_prenex_189) |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| v_prenex_197) |c_ULTIMATE.start_main_~#t~0#1.base|) 0)))))))) is different from false [2023-08-29 20:15:02,989 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse5 (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193| Int) (|v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| Int) (v_ArrVal_1781 Int) (|v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_164| Int) (v_ArrVal_1780 Int) (v_ArrVal_1774 Int) (v_ArrVal_1776 Int) (v_ArrVal_1775 Int) (v_ArrVal_1777 Int)) (let ((.cse21 (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_1774) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_1775))) (let ((.cse20 (store .cse21 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193| v_ArrVal_1776))) (let ((.cse19 (store .cse20 |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_164| v_ArrVal_1777))) (let ((.cse18 (store (store .cse19 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193| v_ArrVal_1780) |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_164| v_ArrVal_1781))) (or (not (= 0 (select (store .cse18 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| 1) |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162|))) (not (= (select .cse19 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193|) 1)) (not (= (select .cse20 |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_164|) 0)) (not (= (select .cse18 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191|) 0)) (not (= 0 (select .cse21 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193|)))))))))) (.cse13 (< (mod (+ c_~next_alloc_idx~0 3) 4294967296) 65)) (.cse11 (not (= (select |c_#valid| |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) 1))) (.cse12 (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| Int) (|v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| Int) (v_ArrVal_1781 Int)) (let ((.cse17 (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_1781))) (or (not (= (select (store .cse17 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| 1) |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162|) 0)) (not (= 0 (select .cse17 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191|))))))) (.cse7 (<= c_~next_alloc_idx~0 64)) (.cse6 (not (= (select |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) 1))) (.cse8 (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| Int) (|v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| Int) (v_ArrVal_1781 Int) (v_ArrVal_1780 Int)) (let ((.cse16 (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_1780) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_1781))) (or (not (= (select .cse16 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191|) 0)) (not (= (select (store .cse16 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| 1) |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162|) 0))))))) (and (or (and (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193| Int) (v_ArrVal_1774 Int) (v_ArrVal_1775 Int)) (let ((.cse0 (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_1774) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_1775))) (or (not (= 0 (select .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193|))) (forall ((|v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_164| Int) (v_ArrVal_1776 Int)) (let ((.cse1 (store .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193| v_ArrVal_1776))) (or (not (= (select .cse1 |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_164|) 0)) (forall ((v_ArrVal_1777 Int)) (let ((.cse2 (store .cse1 |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_164| v_ArrVal_1777))) (or (not (= (select .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193|) 1)) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| Int) (v_ArrVal_1781 Int) (v_ArrVal_1780 Int)) (let ((.cse4 (store (store .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_193| v_ArrVal_1780) |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_164| v_ArrVal_1781))) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| Int)) (let ((.cse3 (store .cse4 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| 1))) (or (not (= 0 (select .cse3 |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162|))) (forall ((v_prenex_189 Int) (v_prenex_197 Int)) (not (= (select (store (store (store .cse3 |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| 1) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| v_prenex_189) |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| v_prenex_197) |c_ULTIMATE.start_main_~#t~0#1.base|) 0)))))) (not (= (select .cse4 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191|) 0)))))))))))))) (or (< (mod (+ c_~next_alloc_idx~0 7) 4294967296) 65) .cse5)) .cse6 (= c_~next_alloc_idx~0 0)) (or .cse7 (forall ((v_ArrVal_1790 Int) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1794 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189| Int) (v_ArrVal_1792 (Array Int Int))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_1790) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189|) 0)) (< (mod (+ 1 (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189| v_ArrVal_1792) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1794) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)) 4294967296) 65) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0)))) (or .cse8 .cse6 .cse7) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| Int) (v_ArrVal_1781 Int)) (let ((.cse10 (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_1781))) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| Int)) (let ((.cse9 (store .cse10 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| 1))) (or (not (= (select .cse9 |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162|) 0)) (forall ((v_prenex_189 Int) (v_prenex_197 Int)) (not (= (select (store (store (store .cse9 |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| 1) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| v_prenex_189) |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| v_prenex_197) |c_ULTIMATE.start_main_~#t~0#1.base|) 0)))))) (not (= 0 (select .cse10 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191|)))))) (or .cse5 .cse6 .cse7) (or .cse11 .cse6 .cse7) (or .cse12 .cse13) (forall ((v_ArrVal_1790 Int) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1794 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189| Int)) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_1790) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189|) 0)) (< (mod (+ (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1794) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_189|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 4294967296) 65) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0))) (or (and (forall ((v_prenex_189 Int) (v_prenex_197 Int)) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_prenex_189) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_prenex_197) |c_ULTIMATE.start_main_~#t~0#1.base|) 0))) .cse13) .cse11 .cse6) (or .cse12 .cse7) (or .cse6 (and (or .cse8 (< (mod (+ c_~next_alloc_idx~0 5) 4294967296) 65)) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| Int) (v_ArrVal_1781 Int) (v_ArrVal_1780 Int)) (let ((.cse15 (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_1780) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_1781))) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| Int)) (let ((.cse14 (store .cse15 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| 1))) (or (forall ((v_prenex_189 Int) (v_prenex_197 Int)) (not (= (select (store (store (store .cse14 |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| 1) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191| v_prenex_189) |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162| v_prenex_197) |c_ULTIMATE.start_main_~#t~0#1.base|) 0))) (not (= (select .cse14 |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_162|) 0))))) (not (= (select .cse15 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_191|) 0))))))))) is different from false [2023-08-29 20:15:04,999 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 20:15:06,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 20:15:08,578 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 20:15:10,582 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 20:15:12,770 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 20:15:14,802 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 20:15:16,842 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 20:15:23,814 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 20:15:25,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-29 20:15:28,051 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 20:15:30,061 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 20:15:32,120 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] Killed by 15