./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-ext/37_stack_lock_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/37_stack_lock_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 a8bcba962b15df67a0e136eef2e702f216cc120b7626a7b8dc8877f6ecaf3765 --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:04:36,868 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:04:36,870 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:04:36,916 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:04:36,918 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:04:36,921 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:04:36,923 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:04:36,925 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:04:36,927 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:04:36,928 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:04:36,929 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:04:36,931 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:04:36,932 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:04:36,936 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:04:36,937 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:04:36,941 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:04:36,942 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:04:36,944 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:04:36,945 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:04:36,950 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:04:36,951 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:04:36,964 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:04:36,965 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:04:36,965 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:04:36,972 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:04:36,972 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:04:36,972 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:04:36,974 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:04:36,975 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:04:36,975 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:04:36,976 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:04:36,981 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:04:36,982 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:04:36,983 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:04:36,983 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:04:36,984 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:04:36,984 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:04:36,984 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:04:36,985 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:04:36,985 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:04:36,986 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:04:36,987 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:04:37,019 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:04:37,019 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:04:37,020 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:04:37,020 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:04:37,021 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:04:37,021 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:04:37,021 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:04:37,022 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:04:37,022 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:04:37,022 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:04:37,023 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:04:37,023 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:04:37,023 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:04:37,024 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:04:37,024 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:04:37,024 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:04:37,024 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:04:37,024 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:04:37,024 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:04:37,025 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:04:37,025 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:04:37,025 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:04:37,025 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:04:37,025 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:04:37,026 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:04:37,026 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:04:37,026 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:04:37,026 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:04:37,026 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 20:04:37,027 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 20:04:37,027 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:04:37,027 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:04:37,027 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:04:37,028 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:04:37,028 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 -> a8bcba962b15df67a0e136eef2e702f216cc120b7626a7b8dc8877f6ecaf3765 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:04:37,339 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:04:37,360 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:04:37,362 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:04:37,363 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:04:37,363 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:04:37,365 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur.i [2023-08-29 20:04:38,586 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:04:38,889 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:04:38,890 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur.i [2023-08-29 20:04:38,900 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f05969b2a/6d606acc7d3444bc8d07c884ccad0ff5/FLAGca7c5ce21 [2023-08-29 20:04:38,912 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f05969b2a/6d606acc7d3444bc8d07c884ccad0ff5 [2023-08-29 20:04:38,914 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:04:38,915 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:04:38,916 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:04:38,916 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:04:38,918 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:04:38,919 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:04:38" (1/1) ... [2023-08-29 20:04:38,920 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f8dee6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:04:38, skipping insertion in model container [2023-08-29 20:04:38,920 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:04:38" (1/1) ... [2023-08-29 20:04:38,925 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:04:38,964 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:04:39,251 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/37_stack_lock_p0_vs_concur.i[30726,30739] [2023-08-29 20:04:39,258 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:04:39,269 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:04:39,326 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/37_stack_lock_p0_vs_concur.i[30726,30739] [2023-08-29 20:04:39,329 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:04:39,385 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:04:39,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:04:39 WrapperNode [2023-08-29 20:04:39,386 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:04:39,387 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:04:39,387 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:04:39,387 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:04:39,393 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:04:39" (1/1) ... [2023-08-29 20:04:39,419 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:04:39" (1/1) ... [2023-08-29 20:04:39,444 INFO L138 Inliner]: procedures = 171, calls = 26, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 85 [2023-08-29 20:04:39,444 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:04:39,445 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:04:39,445 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:04:39,446 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:04:39,453 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:04:39" (1/1) ... [2023-08-29 20:04:39,454 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:04:39" (1/1) ... [2023-08-29 20:04:39,465 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:04:39" (1/1) ... [2023-08-29 20:04:39,466 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:04:39" (1/1) ... [2023-08-29 20:04:39,474 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:04:39" (1/1) ... [2023-08-29 20:04:39,482 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:04:39" (1/1) ... [2023-08-29 20:04:39,483 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:04:39" (1/1) ... [2023-08-29 20:04:39,487 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:04:39" (1/1) ... [2023-08-29 20:04:39,490 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:04:39,494 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:04:39,495 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:04:39,495 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:04:39,496 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:04:39" (1/1) ... [2023-08-29 20:04:39,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:04:39,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:04:39,522 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:04:39,541 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:04:39,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-29 20:04:39,550 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-08-29 20:04:39,551 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-08-29 20:04:39,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 20:04:39,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:04:39,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:04:39,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:04:39,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-29 20:04:39,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:04:39,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:04:39,553 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:04:39,650 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:04:39,652 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:04:39,834 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:04:39,955 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:04:39,955 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-29 20:04:39,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:04:39 BoogieIcfgContainer [2023-08-29 20:04:39,958 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:04:39,959 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:04:39,972 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:04:39,975 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:04:39,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:04:38" (1/3) ... [2023-08-29 20:04:39,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29d56e43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:04:39, skipping insertion in model container [2023-08-29 20:04:39,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:04:39" (2/3) ... [2023-08-29 20:04:39,977 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29d56e43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:04:39, skipping insertion in model container [2023-08-29 20:04:39,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:04:39" (3/3) ... [2023-08-29 20:04:39,978 INFO L112 eAbstractionObserver]: Analyzing ICFG 37_stack_lock_p0_vs_concur.i [2023-08-29 20:04:39,992 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:04:39,993 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2023-08-29 20:04:39,994 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:04:40,094 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:04:40,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 95 transitions, 195 flow [2023-08-29 20:04:40,194 INFO L130 PetriNetUnfolder]: 7/110 cut-off events. [2023-08-29 20:04:40,199 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:04:40,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 110 events. 7/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 208 event pairs, 0 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 78. Up to 4 conditions per place. [2023-08-29 20:04:40,204 INFO L82 GeneralOperation]: Start removeDead. Operand has 92 places, 95 transitions, 195 flow [2023-08-29 20:04:40,209 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 95 transitions, 195 flow [2023-08-29 20:04:40,213 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:04:40,226 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 95 transitions, 195 flow [2023-08-29 20:04:40,232 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 95 transitions, 195 flow [2023-08-29 20:04:40,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 95 transitions, 195 flow [2023-08-29 20:04:40,268 INFO L130 PetriNetUnfolder]: 7/110 cut-off events. [2023-08-29 20:04:40,268 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:04:40,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 110 events. 7/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 208 event pairs, 0 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 78. Up to 4 conditions per place. [2023-08-29 20:04:40,272 INFO L119 LiptonReduction]: Number of co-enabled transitions 2196 [2023-08-29 20:04:42,574 INFO L134 LiptonReduction]: Checked pairs total: 5898 [2023-08-29 20:04:42,574 INFO L136 LiptonReduction]: Total number of compositions: 93 [2023-08-29 20:04:42,593 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:04:42,600 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;@78e8c2b5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:04:42,600 INFO L358 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2023-08-29 20:04:42,605 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2023-08-29 20:04:42,605 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:04:42,606 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:04:42,607 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-29 20:04:42,607 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err11ASSERT_VIOLATIONARRAY_INDEX, thr1Err8ASSERT_VIOLATIONARRAY_INDEX (and 30 more)] === [2023-08-29 20:04:42,611 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:04:42,611 INFO L85 PathProgramCache]: Analyzing trace with hash 14975, now seen corresponding path program 1 times [2023-08-29 20:04:42,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:04:42,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641503678] [2023-08-29 20:04:42,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:04:42,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:04:42,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:04:42,784 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:04:42,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:04:42,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641503678] [2023-08-29 20:04:42,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641503678] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:04:42,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:04:42,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:04:42,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025202268] [2023-08-29 20:04:42,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:04:42,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:04:42,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:04:42,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:04:42,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:04:42,853 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 188 [2023-08-29 20:04:42,855 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 39 transitions, 83 flow. Second operand has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:04:42,855 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:04:42,856 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 188 [2023-08-29 20:04:42,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:04:42,961 INFO L130 PetriNetUnfolder]: 137/327 cut-off events. [2023-08-29 20:04:42,962 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:04:42,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 646 conditions, 327 events. 137/327 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1381 event pairs, 66 based on Foata normal form. 0/182 useless extension candidates. Maximal degree in co-relation 617. Up to 166 conditions per place. [2023-08-29 20:04:42,965 INFO L137 encePairwiseOnDemand]: 177/188 looper letters, 45 selfloop transitions, 4 changer transitions 0/53 dead transitions. [2023-08-29 20:04:42,965 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 53 transitions, 209 flow [2023-08-29 20:04:42,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:04:42,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:04:42,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 281 transitions. [2023-08-29 20:04:42,977 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49822695035460995 [2023-08-29 20:04:42,978 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 281 transitions. [2023-08-29 20:04:42,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 281 transitions. [2023-08-29 20:04:42,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:04:42,981 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 281 transitions. [2023-08-29 20:04:42,984 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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:04:42,987 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 188.0) internal successors, (752), 4 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call 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:42,988 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 188.0) internal successors, (752), 4 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call 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:42,989 INFO L175 Difference]: Start difference. First operand has 40 places, 39 transitions, 83 flow. Second operand 3 states and 281 transitions. [2023-08-29 20:04:42,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 53 transitions, 209 flow [2023-08-29 20:04:42,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 53 transitions, 209 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:04:42,994 INFO L231 Difference]: Finished difference. Result has 35 places, 33 transitions, 95 flow [2023-08-29 20:04:42,995 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=95, PETRI_PLACES=35, PETRI_TRANSITIONS=33} [2023-08-29 20:04:42,999 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -5 predicate places. [2023-08-29 20:04:42,999 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 33 transitions, 95 flow [2023-08-29 20:04:43,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:04:43,000 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:04:43,000 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-29 20:04:43,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 20:04:43,000 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err11ASSERT_VIOLATIONARRAY_INDEX, thr1Err8ASSERT_VIOLATIONARRAY_INDEX (and 30 more)] === [2023-08-29 20:04:43,001 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:04:43,001 INFO L85 PathProgramCache]: Analyzing trace with hash 14976, now seen corresponding path program 1 times [2023-08-29 20:04:43,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:04:43,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839957561] [2023-08-29 20:04:43,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:04:43,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:04:43,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:04:43,116 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:04:43,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:04:43,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839957561] [2023-08-29 20:04:43,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839957561] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:04:43,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:04:43,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:04:43,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534685308] [2023-08-29 20:04:43,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:04:43,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:04:43,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:04:43,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:04:43,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:04:43,155 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 188 [2023-08-29 20:04:43,156 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 33 transitions, 95 flow. Second operand has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call 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:43,156 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:04:43,156 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 188 [2023-08-29 20:04:43,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:04:43,216 INFO L130 PetriNetUnfolder]: 99/248 cut-off events. [2023-08-29 20:04:43,217 INFO L131 PetriNetUnfolder]: For 90/90 co-relation queries the response was YES. [2023-08-29 20:04:43,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 584 conditions, 248 events. 99/248 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 992 event pairs, 71 based on Foata normal form. 37/215 useless extension candidates. Maximal degree in co-relation 552. Up to 224 conditions per place. [2023-08-29 20:04:43,221 INFO L137 encePairwiseOnDemand]: 186/188 looper letters, 25 selfloop transitions, 1 changer transitions 0/32 dead transitions. [2023-08-29 20:04:43,221 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 32 transitions, 145 flow [2023-08-29 20:04:43,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:04:43,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:04:43,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 253 transitions. [2023-08-29 20:04:43,227 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44858156028368795 [2023-08-29 20:04:43,227 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 253 transitions. [2023-08-29 20:04:43,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 253 transitions. [2023-08-29 20:04:43,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:04:43,227 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 253 transitions. [2023-08-29 20:04:43,229 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:04:43,231 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 188.0) internal successors, (752), 4 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call 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:43,232 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 188.0) internal successors, (752), 4 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call 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:43,232 INFO L175 Difference]: Start difference. First operand has 35 places, 33 transitions, 95 flow. Second operand 3 states and 253 transitions. [2023-08-29 20:04:43,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 32 transitions, 145 flow [2023-08-29 20:04:43,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 32 transitions, 137 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:04:43,236 INFO L231 Difference]: Finished difference. Result has 34 places, 32 transitions, 87 flow [2023-08-29 20:04:43,236 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=87, PETRI_PLACES=34, PETRI_TRANSITIONS=32} [2023-08-29 20:04:43,237 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -6 predicate places. [2023-08-29 20:04:43,237 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 32 transitions, 87 flow [2023-08-29 20:04:43,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call 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:43,237 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:04:43,238 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-29 20:04:43,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-29 20:04:43,238 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err11ASSERT_VIOLATIONARRAY_INDEX, thr1Err8ASSERT_VIOLATIONARRAY_INDEX (and 30 more)] === [2023-08-29 20:04:43,238 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:04:43,238 INFO L85 PathProgramCache]: Analyzing trace with hash 954557266, now seen corresponding path program 1 times [2023-08-29 20:04:43,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:04:43,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982706152] [2023-08-29 20:04:43,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:04:43,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:04:43,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:04:43,413 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:04:43,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:04:43,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982706152] [2023-08-29 20:04:43,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982706152] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:04:43,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:04:43,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:04:43,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787609670] [2023-08-29 20:04:43,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:04:43,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:04:43,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:04:43,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:04:43,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:04:43,446 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 188 [2023-08-29 20:04:43,447 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 32 transitions, 87 flow. Second operand has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call 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:43,447 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:04:43,447 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 188 [2023-08-29 20:04:43,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:04:43,505 INFO L130 PetriNetUnfolder]: 89/222 cut-off events. [2023-08-29 20:04:43,505 INFO L131 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2023-08-29 20:04:43,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 497 conditions, 222 events. 89/222 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 827 event pairs, 16 based on Foata normal form. 7/150 useless extension candidates. Maximal degree in co-relation 488. Up to 179 conditions per place. [2023-08-29 20:04:43,507 INFO L137 encePairwiseOnDemand]: 183/188 looper letters, 25 selfloop transitions, 3 changer transitions 0/34 dead transitions. [2023-08-29 20:04:43,507 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 34 transitions, 153 flow [2023-08-29 20:04:43,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:04:43,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:04:43,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 246 transitions. [2023-08-29 20:04:43,510 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43617021276595747 [2023-08-29 20:04:43,510 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 246 transitions. [2023-08-29 20:04:43,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 246 transitions. [2023-08-29 20:04:43,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:04:43,510 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 246 transitions. [2023-08-29 20:04:43,511 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call 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:43,512 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 188.0) internal successors, (752), 4 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call 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:43,513 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 188.0) internal successors, (752), 4 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call 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:43,513 INFO L175 Difference]: Start difference. First operand has 34 places, 32 transitions, 87 flow. Second operand 3 states and 246 transitions. [2023-08-29 20:04:43,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 34 transitions, 153 flow [2023-08-29 20:04:43,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 34 transitions, 152 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:04:43,514 INFO L231 Difference]: Finished difference. Result has 33 places, 30 transitions, 88 flow [2023-08-29 20:04:43,514 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=33, PETRI_TRANSITIONS=30} [2023-08-29 20:04:43,515 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -7 predicate places. [2023-08-29 20:04:43,515 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 30 transitions, 88 flow [2023-08-29 20:04:43,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call 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:43,515 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:04:43,516 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:04:43,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-29 20:04:43,516 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err11ASSERT_VIOLATIONARRAY_INDEX, thr1Err8ASSERT_VIOLATIONARRAY_INDEX (and 30 more)] === [2023-08-29 20:04:43,516 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:04:43,516 INFO L85 PathProgramCache]: Analyzing trace with hash -473498101, now seen corresponding path program 1 times [2023-08-29 20:04:43,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:04:43,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107963542] [2023-08-29 20:04:43,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:04:43,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:04:43,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:04:43,556 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:04:43,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:04:43,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107963542] [2023-08-29 20:04:43,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107963542] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:04:43,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:04:43,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:04:43,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335247670] [2023-08-29 20:04:43,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:04:43,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:04:43,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:04:43,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:04:43,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:04:43,591 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 188 [2023-08-29 20:04:43,592 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 30 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call 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:43,592 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:04:43,592 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 188 [2023-08-29 20:04:43,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:04:43,636 INFO L130 PetriNetUnfolder]: 64/159 cut-off events. [2023-08-29 20:04:43,636 INFO L131 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2023-08-29 20:04:43,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 386 conditions, 159 events. 64/159 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 504 event pairs, 7 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 377. Up to 109 conditions per place. [2023-08-29 20:04:43,637 INFO L137 encePairwiseOnDemand]: 179/188 looper letters, 20 selfloop transitions, 5 changer transitions 0/28 dead transitions. [2023-08-29 20:04:43,637 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 28 transitions, 140 flow [2023-08-29 20:04:43,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:04:43,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:04:43,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 228 transitions. [2023-08-29 20:04:43,642 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40425531914893614 [2023-08-29 20:04:43,642 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 228 transitions. [2023-08-29 20:04:43,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 228 transitions. [2023-08-29 20:04:43,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:04:43,643 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 228 transitions. [2023-08-29 20:04:43,643 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call 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:43,644 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 188.0) internal successors, (752), 4 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call 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:43,645 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 188.0) internal successors, (752), 4 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call 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:43,646 INFO L175 Difference]: Start difference. First operand has 33 places, 30 transitions, 88 flow. Second operand 3 states and 228 transitions. [2023-08-29 20:04:43,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 28 transitions, 140 flow [2023-08-29 20:04:43,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 28 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:04:43,648 INFO L231 Difference]: Finished difference. Result has 27 places, 24 transitions, 80 flow [2023-08-29 20:04:43,648 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=27, PETRI_TRANSITIONS=24} [2023-08-29 20:04:43,649 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -13 predicate places. [2023-08-29 20:04:43,649 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 24 transitions, 80 flow [2023-08-29 20:04:43,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call 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:43,650 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:04:43,650 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:04:43,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-29 20:04:43,650 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err8ASSERT_VIOLATIONARRAY_INDEX === [thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err11ASSERT_VIOLATIONARRAY_INDEX, thr1Err8ASSERT_VIOLATIONARRAY_INDEX (and 30 more)] === [2023-08-29 20:04:43,651 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:04:43,651 INFO L85 PathProgramCache]: Analyzing trace with hash 234874569, now seen corresponding path program 1 times [2023-08-29 20:04:43,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:04:43,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685888040] [2023-08-29 20:04:43,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:04:43,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:04:43,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:04:43,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:04:43,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:04:43,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685888040] [2023-08-29 20:04:43,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685888040] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:04:43,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:04:43,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:04:43,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167870838] [2023-08-29 20:04:43,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:04:43,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:04:43,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:04:43,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:04:43,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:04:43,845 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 188 [2023-08-29 20:04:43,846 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 24 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call 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:43,846 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:04:43,846 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 188 [2023-08-29 20:04:43,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:04:43,911 INFO L130 PetriNetUnfolder]: 67/171 cut-off events. [2023-08-29 20:04:43,911 INFO L131 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2023-08-29 20:04:43,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 413 conditions, 171 events. 67/171 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 531 event pairs, 4 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 404. Up to 119 conditions per place. [2023-08-29 20:04:43,912 INFO L137 encePairwiseOnDemand]: 180/188 looper letters, 28 selfloop transitions, 6 changer transitions 0/38 dead transitions. [2023-08-29 20:04:43,912 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 38 transitions, 184 flow [2023-08-29 20:04:43,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:04:43,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:04:43,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 331 transitions. [2023-08-29 20:04:43,914 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4401595744680851 [2023-08-29 20:04:43,914 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 331 transitions. [2023-08-29 20:04:43,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 331 transitions. [2023-08-29 20:04:43,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:04:43,915 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 331 transitions. [2023-08-29 20:04:43,916 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 82.75) internal successors, (331), 4 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call 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:43,917 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 188.0) internal successors, (940), 5 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call 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:43,917 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 188.0) internal successors, (940), 5 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call 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:43,918 INFO L175 Difference]: Start difference. First operand has 27 places, 24 transitions, 80 flow. Second operand 4 states and 331 transitions. [2023-08-29 20:04:43,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 38 transitions, 184 flow [2023-08-29 20:04:43,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 38 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:04:43,919 INFO L231 Difference]: Finished difference. Result has 30 places, 29 transitions, 119 flow [2023-08-29 20:04:43,919 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=119, PETRI_PLACES=30, PETRI_TRANSITIONS=29} [2023-08-29 20:04:43,920 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -10 predicate places. [2023-08-29 20:04:43,920 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 29 transitions, 119 flow [2023-08-29 20:04:43,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call 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:43,921 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:04:43,921 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:04:43,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-29 20:04:43,921 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err8ASSERT_VIOLATIONARRAY_INDEX === [thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err11ASSERT_VIOLATIONARRAY_INDEX, thr1Err8ASSERT_VIOLATIONARRAY_INDEX (and 30 more)] === [2023-08-29 20:04:43,922 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:04:43,922 INFO L85 PathProgramCache]: Analyzing trace with hash 536139218, now seen corresponding path program 1 times [2023-08-29 20:04:43,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:04:43,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095645177] [2023-08-29 20:04:43,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:04:43,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:04:43,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:04:44,143 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:04:44,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:04:44,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095645177] [2023-08-29 20:04:44,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095645177] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 20:04:44,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240439020] [2023-08-29 20:04:44,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:04:44,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 20:04:44,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:04:44,157 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:04:44,181 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:04:44,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:04:44,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 15 conjunts are in the unsatisfiable core [2023-08-29 20:04:44,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:04:44,311 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:44,350 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 20:04:44,351 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:44,427 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:44,432 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:44,438 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:44,482 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-29 20:04:44,493 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:04:44,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 20:04:44,515 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_55 (Array Int Int))) (< (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_55) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65)) is different from false [2023-08-29 20:04:44,678 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 20:04:44,679 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:44,699 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:44,717 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:44,739 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 20:04:44,740 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:44,838 INFO L321 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2023-08-29 20:04:44,839 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 70 treesize of output 58 [2023-08-29 20:04:44,844 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:44,857 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:44,876 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 20:04:44,876 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 54 treesize of output 50 [2023-08-29 20:04:44,887 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:04:45,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-29 20:04:45,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [240439020] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 20:04:45,009 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 20:04:45,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2023-08-29 20:04:45,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728994192] [2023-08-29 20:04:45,010 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 20:04:45,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-29 20:04:45,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:04:45,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-29 20:04:45,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=118, Unknown=1, NotChecked=22, Total=182 [2023-08-29 20:04:45,084 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 188 [2023-08-29 20:04:45,085 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 29 transitions, 119 flow. Second operand has 14 states, 14 states have (on average 47.857142857142854) internal successors, (670), 14 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call 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:45,085 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:04:45,085 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 188 [2023-08-29 20:04:45,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:04:45,362 INFO L130 PetriNetUnfolder]: 96/257 cut-off events. [2023-08-29 20:04:45,362 INFO L131 PetriNetUnfolder]: For 90/90 co-relation queries the response was YES. [2023-08-29 20:04:45,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 703 conditions, 257 events. 96/257 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 938 event pairs, 4 based on Foata normal form. 11/255 useless extension candidates. Maximal degree in co-relation 691. Up to 80 conditions per place. [2023-08-29 20:04:45,364 INFO L137 encePairwiseOnDemand]: 176/188 looper letters, 50 selfloop transitions, 19 changer transitions 0/71 dead transitions. [2023-08-29 20:04:45,364 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 71 transitions, 393 flow [2023-08-29 20:04:45,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-29 20:04:45,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-29 20:04:45,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 483 transitions. [2023-08-29 20:04:45,366 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2854609929078014 [2023-08-29 20:04:45,366 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 483 transitions. [2023-08-29 20:04:45,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 483 transitions. [2023-08-29 20:04:45,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:04:45,367 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 483 transitions. [2023-08-29 20:04:45,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 53.666666666666664) internal successors, (483), 9 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call 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:45,370 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 188.0) internal successors, (1880), 10 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:04:45,370 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 188.0) internal successors, (1880), 10 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:04:45,370 INFO L175 Difference]: Start difference. First operand has 30 places, 29 transitions, 119 flow. Second operand 9 states and 483 transitions. [2023-08-29 20:04:45,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 71 transitions, 393 flow [2023-08-29 20:04:45,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 71 transitions, 388 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:04:45,373 INFO L231 Difference]: Finished difference. Result has 42 places, 44 transitions, 265 flow [2023-08-29 20:04:45,373 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=265, PETRI_PLACES=42, PETRI_TRANSITIONS=44} [2023-08-29 20:04:45,373 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 2 predicate places. [2023-08-29 20:04:45,374 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 44 transitions, 265 flow [2023-08-29 20:04:45,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 47.857142857142854) internal successors, (670), 14 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call 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:45,374 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:04:45,374 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:04:45,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-29 20:04:45,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-08-29 20:04:45,580 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err14ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err11ASSERT_VIOLATIONARRAY_INDEX, thr1Err8ASSERT_VIOLATIONARRAY_INDEX (and 30 more)] === [2023-08-29 20:04:45,581 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:04:45,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1409846729, now seen corresponding path program 1 times [2023-08-29 20:04:45,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:04:45,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388905511] [2023-08-29 20:04:45,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:04:45,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:04:45,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:04:45,620 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:04:45,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:04:45,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388905511] [2023-08-29 20:04:45,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388905511] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:04:45,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:04:45,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:04:45,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030410605] [2023-08-29 20:04:45,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:04:45,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:04:45,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:04:45,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:04:45,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:04:45,667 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 188 [2023-08-29 20:04:45,668 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 44 transitions, 265 flow. Second operand has 4 states, 4 states have (on average 73.75) internal successors, (295), 4 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call 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:45,668 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:04:45,668 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 188 [2023-08-29 20:04:45,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:04:45,768 INFO L130 PetriNetUnfolder]: 90/276 cut-off events. [2023-08-29 20:04:45,768 INFO L131 PetriNetUnfolder]: For 453/453 co-relation queries the response was YES. [2023-08-29 20:04:45,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 980 conditions, 276 events. 90/276 cut-off events. For 453/453 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1099 event pairs, 14 based on Foata normal form. 0/272 useless extension candidates. Maximal degree in co-relation 962. Up to 104 conditions per place. [2023-08-29 20:04:45,770 INFO L137 encePairwiseOnDemand]: 179/188 looper letters, 49 selfloop transitions, 24 changer transitions 0/77 dead transitions. [2023-08-29 20:04:45,770 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 77 transitions, 599 flow [2023-08-29 20:04:45,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:04:45,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:04:45,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 401 transitions. [2023-08-29 20:04:45,772 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42659574468085104 [2023-08-29 20:04:45,772 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 401 transitions. [2023-08-29 20:04:45,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 401 transitions. [2023-08-29 20:04:45,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:04:45,773 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 401 transitions. [2023-08-29 20:04:45,774 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 80.2) internal successors, (401), 5 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call 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:45,775 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 188.0) internal successors, (1128), 6 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call 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:45,775 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 188.0) internal successors, (1128), 6 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call 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:45,775 INFO L175 Difference]: Start difference. First operand has 42 places, 44 transitions, 265 flow. Second operand 5 states and 401 transitions. [2023-08-29 20:04:45,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 77 transitions, 599 flow [2023-08-29 20:04:45,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 77 transitions, 586 flow, removed 5 selfloop flow, removed 1 redundant places. [2023-08-29 20:04:45,785 INFO L231 Difference]: Finished difference. Result has 49 places, 63 transitions, 512 flow [2023-08-29 20:04:45,785 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=512, PETRI_PLACES=49, PETRI_TRANSITIONS=63} [2023-08-29 20:04:45,785 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 9 predicate places. [2023-08-29 20:04:45,786 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 63 transitions, 512 flow [2023-08-29 20:04:45,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 73.75) internal successors, (295), 4 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call 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:45,786 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:04:45,786 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:04:45,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-29 20:04:45,786 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err11ASSERT_VIOLATIONARRAY_INDEX, thr1Err8ASSERT_VIOLATIONARRAY_INDEX (and 30 more)] === [2023-08-29 20:04:45,787 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:04:45,787 INFO L85 PathProgramCache]: Analyzing trace with hash -842289400, now seen corresponding path program 1 times [2023-08-29 20:04:45,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:04:45,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501155893] [2023-08-29 20:04:45,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:04:45,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:04:45,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:04:45,992 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:04:45,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:04:45,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501155893] [2023-08-29 20:04:45,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501155893] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 20:04:45,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696832391] [2023-08-29 20:04:45,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:04:45,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 20:04:45,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:04:45,994 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:04:46,012 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:04:46,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:04:46,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-29 20:04:46,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:04:46,071 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:46,092 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-29 20:04:46,092 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:46,124 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:46,128 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:04:46,128 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:04:46,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696832391] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:04:46,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-29 20:04:46,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 6 [2023-08-29 20:04:46,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866266871] [2023-08-29 20:04:46,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:04:46,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:04:46,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:04:46,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:04:46,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-08-29 20:04:46,195 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 188 [2023-08-29 20:04:46,196 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 63 transitions, 512 flow. Second operand has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call 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:46,196 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:04:46,197 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 188 [2023-08-29 20:04:46,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:04:46,252 INFO L130 PetriNetUnfolder]: 65/227 cut-off events. [2023-08-29 20:04:46,253 INFO L131 PetriNetUnfolder]: For 614/614 co-relation queries the response was YES. [2023-08-29 20:04:46,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 984 conditions, 227 events. 65/227 cut-off events. For 614/614 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 873 event pairs, 6 based on Foata normal form. 19/245 useless extension candidates. Maximal degree in co-relation 963. Up to 164 conditions per place. [2023-08-29 20:04:46,255 INFO L137 encePairwiseOnDemand]: 183/188 looper letters, 44 selfloop transitions, 16 changer transitions 0/64 dead transitions. [2023-08-29 20:04:46,255 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 64 transitions, 642 flow [2023-08-29 20:04:46,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:04:46,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:04:46,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 285 transitions. [2023-08-29 20:04:46,257 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37898936170212766 [2023-08-29 20:04:46,257 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 285 transitions. [2023-08-29 20:04:46,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 285 transitions. [2023-08-29 20:04:46,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:04:46,257 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 285 transitions. [2023-08-29 20:04:46,258 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 71.25) internal successors, (285), 4 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call 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:46,259 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 188.0) internal successors, (940), 5 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call 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:46,260 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 188.0) internal successors, (940), 5 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call 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:46,260 INFO L175 Difference]: Start difference. First operand has 49 places, 63 transitions, 512 flow. Second operand 4 states and 285 transitions. [2023-08-29 20:04:46,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 64 transitions, 642 flow [2023-08-29 20:04:46,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 64 transitions, 636 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-08-29 20:04:46,265 INFO L231 Difference]: Finished difference. Result has 51 places, 61 transitions, 524 flow [2023-08-29 20:04:46,265 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=524, PETRI_PLACES=51, PETRI_TRANSITIONS=61} [2023-08-29 20:04:46,266 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 11 predicate places. [2023-08-29 20:04:46,266 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 61 transitions, 524 flow [2023-08-29 20:04:46,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call 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:46,266 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:04:46,267 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:04:46,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-29 20:04:46,472 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,SelfDestructingSolverStorable7 [2023-08-29 20:04:46,472 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err14ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err11ASSERT_VIOLATIONARRAY_INDEX, thr1Err8ASSERT_VIOLATIONARRAY_INDEX (and 30 more)] === [2023-08-29 20:04:46,473 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:04:46,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1928770240, now seen corresponding path program 1 times [2023-08-29 20:04:46,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:04:46,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418306088] [2023-08-29 20:04:46,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:04:46,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:04:46,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:04:46,695 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:04:46,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:04:46,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418306088] [2023-08-29 20:04:46,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418306088] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 20:04:46,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386430790] [2023-08-29 20:04:46,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:04:46,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 20:04:46,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:04:46,701 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:04:46,725 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:04:46,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:04:46,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-29 20:04:46,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:04:46,802 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:46,833 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 20:04:46,833 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:46,860 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:46,865 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:46,868 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:46,906 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:04:46,933 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:04:46,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 20:04:47,078 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 20:04:47,078 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:47,088 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:47,095 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:47,108 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 20:04:47,108 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:47,173 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:04:47,176 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:47,191 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 45 treesize of output 37 [2023-08-29 20:04:47,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 20 treesize of output 18 [2023-08-29 20:04:47,306 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:04:47,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [386430790] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 20:04:47,306 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 20:04:47,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 13 [2023-08-29 20:04:47,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920468710] [2023-08-29 20:04:47,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 20:04:47,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-29 20:04:47,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:04:47,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-29 20:04:47,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=162, Unknown=3, NotChecked=0, Total=210 [2023-08-29 20:04:47,395 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 188 [2023-08-29 20:04:47,396 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 61 transitions, 524 flow. Second operand has 15 states, 15 states have (on average 43.266666666666666) internal successors, (649), 15 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call 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:47,396 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:04:47,396 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 188 [2023-08-29 20:04:47,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:04:47,800 INFO L130 PetriNetUnfolder]: 73/274 cut-off events. [2023-08-29 20:04:47,800 INFO L131 PetriNetUnfolder]: For 808/808 co-relation queries the response was YES. [2023-08-29 20:04:47,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1227 conditions, 274 events. 73/274 cut-off events. For 808/808 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1013 event pairs, 4 based on Foata normal form. 10/283 useless extension candidates. Maximal degree in co-relation 1204. Up to 83 conditions per place. [2023-08-29 20:04:47,802 INFO L137 encePairwiseOnDemand]: 176/188 looper letters, 65 selfloop transitions, 35 changer transitions 0/102 dead transitions. [2023-08-29 20:04:47,802 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 102 transitions, 1005 flow [2023-08-29 20:04:47,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-29 20:04:47,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-29 20:04:47,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 692 transitions. [2023-08-29 20:04:47,805 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2453900709219858 [2023-08-29 20:04:47,805 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 692 transitions. [2023-08-29 20:04:47,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 692 transitions. [2023-08-29 20:04:47,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:04:47,806 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 692 transitions. [2023-08-29 20:04:47,807 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 46.13333333333333) internal successors, (692), 15 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:04:47,810 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 188.0) internal successors, (3008), 16 states have internal predecessors, (3008), 0 states have call successors, (0), 0 states have call 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:47,811 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 188.0) internal successors, (3008), 16 states have internal predecessors, (3008), 0 states have call successors, (0), 0 states have call 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:47,811 INFO L175 Difference]: Start difference. First operand has 51 places, 61 transitions, 524 flow. Second operand 15 states and 692 transitions. [2023-08-29 20:04:47,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 102 transitions, 1005 flow [2023-08-29 20:04:47,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 102 transitions, 967 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 20:04:47,816 INFO L231 Difference]: Finished difference. Result has 66 places, 72 transitions, 730 flow [2023-08-29 20:04:47,817 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=730, PETRI_PLACES=66, PETRI_TRANSITIONS=72} [2023-08-29 20:04:47,817 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 26 predicate places. [2023-08-29 20:04:47,817 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 72 transitions, 730 flow [2023-08-29 20:04:47,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 43.266666666666666) internal successors, (649), 15 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call 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:47,818 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:04:47,818 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:04:47,833 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:04:48,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 20:04:48,026 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err8ASSERT_VIOLATIONARRAY_INDEX === [thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err11ASSERT_VIOLATIONARRAY_INDEX, thr1Err8ASSERT_VIOLATIONARRAY_INDEX (and 30 more)] === [2023-08-29 20:04:48,026 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:04:48,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1386724612, now seen corresponding path program 1 times [2023-08-29 20:04:48,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:04:48,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641241491] [2023-08-29 20:04:48,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:04:48,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:04:48,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:04:48,408 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:04:48,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:04:48,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641241491] [2023-08-29 20:04:48,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641241491] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 20:04:48,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876751668] [2023-08-29 20:04:48,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:04:48,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 20:04:48,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:04:48,411 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:04:48,439 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:04:48,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:04:48,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-29 20:04:48,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:04:48,502 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:48,530 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-29 20:04:48,530 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:48,553 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:48,558 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:04:48,603 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:48,630 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 20:04:48,631 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:48,678 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:48,684 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:48,688 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:48,722 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:48,740 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:04:48,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 20:04:48,851 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:48,862 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:48,906 WARN L839 $PredicateComparison]: unable to prove that (and (or (<= c_~next_alloc_idx~0 64) (forall ((v_ArrVal_180 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_183 (Array Int Int))) (or (< (mod (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_180) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_183) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0)))) (or (< 64 c_~next_alloc_idx~0) (forall ((|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_183 (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_183) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0))))) is different from false [2023-08-29 20:04:49,111 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_179 Int) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_183 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_140| Int)) (or (< (mod (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_140| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_140|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_183) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_140|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_179) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_140|) 0)) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0))) (< 64 c_~next_alloc_idx~0)) (or (forall ((v_ArrVal_180 (Array Int Int)) (v_ArrVal_179 Int) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_183 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_140| Int)) (or (< (mod (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_140| v_ArrVal_180) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_183) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_140|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_179) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_140|) 0)) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0))) (<= c_~next_alloc_idx~0 64))) is different from false [2023-08-29 20:04:49,368 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 20:04:49,369 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:49,377 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:49,422 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 9 treesize of output 1 [2023-08-29 20:04:49,432 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 20:04:49,432 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 1 case distinctions, treesize of input 20 treesize of output 21 [2023-08-29 20:04:49,437 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:04:49,455 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:04:49,480 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:04:49,486 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:04:49,722 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 4 not checked. [2023-08-29 20:04:49,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876751668] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 20:04:49,723 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 20:04:49,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 20 [2023-08-29 20:04:49,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133681439] [2023-08-29 20:04:49,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 20:04:49,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-29 20:04:49,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:04:49,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-29 20:04:49,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=305, Unknown=5, NotChecked=74, Total=462 [2023-08-29 20:04:49,808 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 188 [2023-08-29 20:04:49,809 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 72 transitions, 730 flow. Second operand has 22 states, 22 states have (on average 48.40909090909091) internal successors, (1065), 22 states have internal predecessors, (1065), 0 states have call successors, (0), 0 states have call 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:49,809 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:04:49,810 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 188 [2023-08-29 20:04:49,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:04:50,727 WARN L839 $PredicateComparison]: unable to prove that (and (or (and (<= c_~next_alloc_idx~0 62) (< (mod (+ c_~next_alloc_idx~0 2) 4294967296) 65) (forall ((v_ArrVal_179 Int)) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_179) |c_ULTIMATE.start_main_~#t~0#1.base|) 0)))) (not (= (select |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) 1))) (forall ((v_ArrVal_183 (Array Int Int))) (< (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_183) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65))) is different from false [2023-08-29 20:04:50,867 INFO L130 PetriNetUnfolder]: 105/380 cut-off events. [2023-08-29 20:04:50,867 INFO L131 PetriNetUnfolder]: For 1804/1804 co-relation queries the response was YES. [2023-08-29 20:04:50,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1899 conditions, 380 events. 105/380 cut-off events. For 1804/1804 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1674 event pairs, 2 based on Foata normal form. 16/395 useless extension candidates. Maximal degree in co-relation 1872. Up to 117 conditions per place. [2023-08-29 20:04:50,871 INFO L137 encePairwiseOnDemand]: 175/188 looper letters, 72 selfloop transitions, 71 changer transitions 0/145 dead transitions. [2023-08-29 20:04:50,871 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 145 transitions, 1643 flow [2023-08-29 20:04:50,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-08-29 20:04:50,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-08-29 20:04:50,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 975 transitions. [2023-08-29 20:04:50,874 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27295632698768196 [2023-08-29 20:04:50,874 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 975 transitions. [2023-08-29 20:04:50,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 975 transitions. [2023-08-29 20:04:50,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:04:50,875 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 975 transitions. [2023-08-29 20:04:50,877 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 51.31578947368421) internal successors, (975), 19 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call 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:50,881 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 188.0) internal successors, (3760), 20 states have internal predecessors, (3760), 0 states have call successors, (0), 0 states have call 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:50,881 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 188.0) internal successors, (3760), 20 states have internal predecessors, (3760), 0 states have call successors, (0), 0 states have call 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:50,882 INFO L175 Difference]: Start difference. First operand has 66 places, 72 transitions, 730 flow. Second operand 19 states and 975 transitions. [2023-08-29 20:04:50,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 145 transitions, 1643 flow [2023-08-29 20:04:50,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 145 transitions, 1576 flow, removed 24 selfloop flow, removed 5 redundant places. [2023-08-29 20:04:50,890 INFO L231 Difference]: Finished difference. Result has 87 places, 110 transitions, 1319 flow [2023-08-29 20:04:50,890 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=663, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1319, PETRI_PLACES=87, PETRI_TRANSITIONS=110} [2023-08-29 20:04:50,890 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 47 predicate places. [2023-08-29 20:04:50,890 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 110 transitions, 1319 flow [2023-08-29 20:04:50,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 48.40909090909091) internal successors, (1065), 22 states have internal predecessors, (1065), 0 states have call successors, (0), 0 states have call 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:50,891 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:04:50,891 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2023-08-29 20:04:50,899 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:04:51,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 20:04:51,097 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err8ASSERT_VIOLATIONARRAY_INDEX === [thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err11ASSERT_VIOLATIONARRAY_INDEX, thr1Err8ASSERT_VIOLATIONARRAY_INDEX (and 30 more)] === [2023-08-29 20:04:51,097 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:04:51,097 INFO L85 PathProgramCache]: Analyzing trace with hash -610401514, now seen corresponding path program 2 times [2023-08-29 20:04:51,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:04:51,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716507654] [2023-08-29 20:04:51,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:04:51,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:04:51,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:04:51,839 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:04:51,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:04:51,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716507654] [2023-08-29 20:04:51,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716507654] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 20:04:51,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788720991] [2023-08-29 20:04:51,840 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 20:04:51,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 20:04:51,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:04:51,842 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:04:51,864 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:04:52,034 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-29 20:04:52,034 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:04:52,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 32 conjunts are in the unsatisfiable core [2023-08-29 20:04:52,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:04:52,043 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:52,071 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-29 20:04:52,071 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:52,093 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:04:52,095 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:52,147 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:52,176 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-29 20:04:52,177 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 18 [2023-08-29 20:04:52,218 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:04:52,222 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:52,302 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-08-29 20:04:52,302 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:52,358 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 20:04:52,358 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:04:52,479 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-29 20:04:52,509 INFO L321 Elim1Store]: treesize reduction 44, result has 38.0 percent of original size [2023-08-29 20:04:52,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 51 [2023-08-29 20:04:52,532 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:52,535 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:52,588 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-08-29 20:04:52,588 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 21 treesize of output 30 [2023-08-29 20:04:52,615 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:04:52,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 20:04:52,767 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:52,772 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:53,581 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:54,034 WARN L839 $PredicateComparison]: unable to prove that (and (or (and (or (< 62 c_~next_alloc_idx~0) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| Int) (v_ArrVal_253 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_146| Int) (v_ArrVal_257 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_146| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_146|) 0 c_~next_alloc_idx~0)))) (let ((.cse1 (select .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|))) (or (< |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| 0) (< (mod (select (select (store (store .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| (store .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| (+ c_~next_alloc_idx~0 2))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_257) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 4294967296) 65) (not (= (select (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_146| v_ArrVal_253) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) 0)) (not (= (+ (select .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 1) 0)) (< 0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|)))))) (or (<= c_~next_alloc_idx~0 62) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| Int) (v_ArrVal_253 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| Int) (v_ArrVal_254 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_146| Int) (v_ArrVal_257 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_146| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_146|) 0 c_~next_alloc_idx~0)))) (or (< (mod (select (select (store (store .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| v_ArrVal_254) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_257) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 4294967296) 65) (< |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| 0) (not (= (select (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_146| v_ArrVal_253) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) 0)) (not (= (+ (select (select .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 1) 0)) (< 0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|)))))) (< 64 c_~next_alloc_idx~0)) (or (<= c_~next_alloc_idx~0 64) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| Int) (v_ArrVal_253 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| Int) (v_ArrVal_251 (Array Int Int)) (v_ArrVal_254 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_146| Int) (v_ArrVal_257 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_146| v_ArrVal_251))) (or (< (mod (select (select (store (store .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| v_ArrVal_254) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_257) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 4294967296) 65) (< |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| 0) (not (= (select (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_146| v_ArrVal_253) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) 0)) (< 0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) (not (= (+ (select (select .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 1) 0))))))) is different from false [2023-08-29 20:04:54,241 WARN L839 $PredicateComparison]: unable to prove that (and (or (< 64 c_~next_alloc_idx~0) (and (or (< 62 c_~next_alloc_idx~0) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| Int) (v_ArrVal_253 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_146| Int) (v_ArrVal_248 Int) (v_ArrVal_257 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_146| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_146|) 0 c_~next_alloc_idx~0)))) (let ((.cse1 (select .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|))) (or (< |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| 0) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_248) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_146| v_ArrVal_253) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) 0)) (< (mod (select (select (store (store .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| (store .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| (+ c_~next_alloc_idx~0 2))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_257) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 4294967296) 65) (not (= (+ (select .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 1) 0)) (< 0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|)))))) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| Int) (v_ArrVal_253 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| Int) (v_ArrVal_254 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_146| Int) (v_ArrVal_257 (Array Int Int)) (v_ArrVal_248 Int)) (let ((.cse2 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_146| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_146|) 0 c_~next_alloc_idx~0)))) (or (< (mod (select (select (store (store .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| v_ArrVal_254) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_257) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 4294967296) 65) (< |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| 0) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_248) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_146| v_ArrVal_253) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) 0)) (not (= (+ (select (select .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 1) 0)) (< 0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|)))) (<= c_~next_alloc_idx~0 62)))) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| Int) (v_ArrVal_253 Int) (v_ArrVal_251 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| Int) (v_ArrVal_254 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_146| Int) (v_ArrVal_248 Int) (v_ArrVal_257 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_146| v_ArrVal_251))) (or (< (mod (select (select (store (store .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| v_ArrVal_254) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_257) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 4294967296) 65) (< |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| 0) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_248) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_146| v_ArrVal_253) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) 0)) (< 0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) (not (= (+ (select (select .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 1) 0))))) (<= c_~next_alloc_idx~0 64))) is different from false [2023-08-29 20:04:54,783 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 20:04:54,784 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:54,793 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:54,837 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 9 treesize of output 1 [2023-08-29 20:04:54,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 20:04:54,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 20:04:54,858 INFO L321 Elim1Store]: treesize reduction 17, result has 50.0 percent of original size [2023-08-29 20:04:54,858 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 50 treesize of output 54 [2023-08-29 20:04:54,868 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 0 case distinctions, treesize of input 42 treesize of output 34 [2023-08-29 20:04:54,874 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:04:54,879 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:04:54,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 20:04:54,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 20:04:54,917 INFO L321 Elim1Store]: treesize reduction 14, result has 63.2 percent of original size [2023-08-29 20:04:54,918 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 3 case distinctions, treesize of input 65 treesize of output 58 [2023-08-29 20:04:54,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 20:04:54,934 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 20:04:54,934 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 49 treesize of output 45 [2023-08-29 20:04:54,944 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:04:55,010 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 52 treesize of output 48 [2023-08-29 20:04:55,016 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:04:55,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 11 treesize of output 9 [2023-08-29 20:04:55,030 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 24 treesize of output 22 [2023-08-29 20:04:55,545 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2023-08-29 20:04:55,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [788720991] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 20:04:55,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 20:04:55,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 33 [2023-08-29 20:04:55,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477290157] [2023-08-29 20:04:55,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 20:04:55,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-08-29 20:04:55,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:04:55,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-08-29 20:04:55,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=907, Unknown=10, NotChecked=126, Total=1190 [2023-08-29 20:04:55,623 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 188 [2023-08-29 20:04:55,625 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 110 transitions, 1319 flow. Second operand has 35 states, 35 states have (on average 48.31428571428572) internal successors, (1691), 35 states have internal predecessors, (1691), 0 states have call successors, (0), 0 states have call 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:55,625 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:04:55,625 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 188 [2023-08-29 20:04:55,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:05:01,690 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|))) (let ((.cse2 (not (= (+ c_~next_alloc_idx~0 3) 0))) (.cse1 (<= c_~next_alloc_idx~0 64)) (.cse3 (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_148| Int)) (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_148|) 0)))) (.cse4 (select .cse5 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)) (.cse6 (< (+ 4294967291 (* (div (+ c_~next_alloc_idx~0 (- 61)) 4294967296) 4294967296)) c_~next_alloc_idx~0)) (.cse0 (not (= (select |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) 1)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= 5 .cse4) (or .cse2 .cse0) (or .cse3 .cse1) (or (< |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0) (and (or (forall ((v_ArrVal_254 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (< (mod (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_254) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_257) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65)) .cse1) (or (forall ((v_ArrVal_257 (Array Int Int))) (< (mod (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store .cse5 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_257) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65)) (< 64 c_~next_alloc_idx~0)))) (<= 5 .cse4) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_148| Int)) (or (forall ((v_ArrVal_253 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_146| Int) (v_ArrVal_248 Int)) (or (= |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_146| |c_ULTIMATE.start_main_~#t~0#1.base|) (not (= (select (store (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_148| v_ArrVal_248) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_146| v_ArrVal_253) |c_ULTIMATE.start_main_~#t~0#1.base|) 0)))) (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_148|) 0)))) (or (forall ((v_ArrVal_253 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_146| Int) (v_ArrVal_248 Int)) (or (= |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_146| |c_ULTIMATE.start_main_~#t~0#1.base|) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_248) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_146| v_ArrVal_253) |c_ULTIMATE.start_main_~#t~0#1.base|) 0)))) .cse0) (<= 0 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) (not (= |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (or .cse6 .cse3) (<= |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0) (<= .cse4 5) (or .cse6 .cse0)))) is different from false [2023-08-29 20:05:02,887 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|))) (let ((.cse0 (< 62 c_~next_alloc_idx~0)) (.cse3 (+ c_~next_alloc_idx~0 2)) (.cse4 (<= c_~next_alloc_idx~0 62)) (.cse11 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store .cse12 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0))) (.cse9 (< |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0)) (.cse6 (< 64 c_~next_alloc_idx~0)) (.cse8 (<= c_~next_alloc_idx~0 64)) (.cse7 (not (= (select |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) 1)))) (and (or (and (or .cse0 (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| Int) (v_ArrVal_253 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_146| Int) (v_ArrVal_257 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_146| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_146|) 0 c_~next_alloc_idx~0)))) (let ((.cse2 (select .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|))) (or (< |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| 0) (< (mod (select (select (store (store .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| (store .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| .cse3)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_257) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 4294967296) 65) (not (= (select (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_146| v_ArrVal_253) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) 0)) (not (= (+ (select .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 1) 0)) (< 0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|)))))) (or .cse4 (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| Int) (v_ArrVal_253 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| Int) (v_ArrVal_254 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_146| Int) (v_ArrVal_257 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_146| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_146|) 0 c_~next_alloc_idx~0)))) (or (< (mod (select (select (store (store .cse5 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| v_ArrVal_254) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_257) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 4294967296) 65) (< |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| 0) (not (= (select (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_146| v_ArrVal_253) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) 0)) (not (= (+ (select (select .cse5 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 1) 0)) (< 0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|)))))) .cse6) (or .cse7 .cse8) (or .cse9 .cse6 .cse7 (and (or .cse0 (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| Int) (v_ArrVal_253 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| Int) (v_ArrVal_257 (Array Int Int))) (let ((.cse10 (select .cse11 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|))) (or (not (= (+ (select .cse10 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 1) 0)) (< (mod (select (select (store (store .cse11 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| (store .cse10 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| .cse3)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_257) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 4294967296) 65) (< |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| 0) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_253) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) 0)) (< 0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|))))) (or .cse4 (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| Int) (v_ArrVal_253 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| Int) (v_ArrVal_254 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (or (not (= (+ (select (select .cse11 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 1) 0)) (< |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| 0) (< (mod (select (select (store (store .cse11 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| v_ArrVal_254) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_257) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 4294967296) 65) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_253) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) 0)) (< 0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|)))))) (= 5 (select .cse12 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)) (or (not (= (+ c_~next_alloc_idx~0 3) 0)) .cse7) (or .cse9 (and (or (forall ((v_ArrVal_254 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (< (mod (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_254) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_257) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65)) .cse8) (or (forall ((v_ArrVal_257 (Array Int Int))) (< (mod (select (select (store .cse11 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_257) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65)) .cse6))) (or (forall ((v_ArrVal_253 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_146| Int) (v_ArrVal_248 Int)) (or (= |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_146| |c_ULTIMATE.start_main_~#t~0#1.base|) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_248) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_146| v_ArrVal_253) |c_ULTIMATE.start_main_~#t~0#1.base|) 0)))) .cse7) (<= 0 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| Int) (v_ArrVal_254 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (or (< |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| 0) (< (mod (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| v_ArrVal_254) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_257) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 4294967296) 65) (< 0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) 0)) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 1) 0)))) .cse8) (or .cse8 (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| Int) (v_ArrVal_253 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| Int) (v_ArrVal_251 (Array Int Int)) (v_ArrVal_254 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_146| Int) (v_ArrVal_257 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_146| v_ArrVal_251))) (or (< (mod (select (select (store (store .cse13 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| v_ArrVal_254) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_257) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 4294967296) 65) (< |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| 0) (not (= (select (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_146| v_ArrVal_253) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) 0)) (< 0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) (not (= (+ (select (select .cse13 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 1) 0)))))) (not (= |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| Int) (v_ArrVal_257 (Array Int Int))) (let ((.cse14 (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|))) (or (< (mod (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| (store .cse14 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_257) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 4294967296) 65) (< |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| 0) (< 0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) 0)) (not (= (+ (select .cse14 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 1) 0))))) .cse6) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| Int) (v_ArrVal_253 Int) (v_ArrVal_251 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| Int) (v_ArrVal_254 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_251))) (or (< |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| 0) (not (= (+ (select (select .cse15 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 1) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_253) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) 0)) (< 0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) (< (mod (select (select (store (store .cse15 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| v_ArrVal_254) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_257) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 4294967296) 65)))) .cse9 .cse7 .cse8) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| Int) (v_ArrVal_253 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| Int) (v_ArrVal_257 (Array Int Int))) (let ((.cse16 (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|))) (or (< (mod (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| (store .cse16 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_257) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 4294967296) 65) (< |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| 0) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_253) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) 0)) (< 0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) (not (= (+ (select .cse16 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 1) 0))))) .cse6) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| Int) (v_ArrVal_253 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| Int) (v_ArrVal_254 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (or (< |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| 0) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_253) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) 0)) (< (mod (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| v_ArrVal_254) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_257) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 4294967296) 65) (< 0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 1) 0)))) .cse8) (<= |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0) (exists ((v_prenex_7 Int)) (= (select (select |c_#memory_int| v_prenex_7) 0) 3)) (or (< (+ 4294967291 (* (div (+ c_~next_alloc_idx~0 (- 61)) 4294967296) 4294967296)) c_~next_alloc_idx~0) .cse7)))) is different from false [2023-08-29 20:05:03,072 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|))) (let ((.cse5 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store .cse6 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0))) (.cse3 (< 64 c_~next_alloc_idx~0)) (.cse2 (< |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0)) (.cse1 (<= c_~next_alloc_idx~0 64)) (.cse0 (not (= (select |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) 1)))) (and (or .cse0 .cse1) (or .cse2 .cse3 .cse0 (and (or (< 62 c_~next_alloc_idx~0) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| Int) (v_ArrVal_253 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| Int) (v_ArrVal_257 (Array Int Int))) (let ((.cse4 (select .cse5 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|))) (or (not (= (+ (select .cse4 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 1) 0)) (< (mod (select (select (store (store .cse5 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| (store .cse4 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| (+ c_~next_alloc_idx~0 2))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_257) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 4294967296) 65) (< |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| 0) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_253) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) 0)) (< 0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|))))) (or (<= c_~next_alloc_idx~0 62) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| Int) (v_ArrVal_253 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| Int) (v_ArrVal_254 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (or (not (= (+ (select (select .cse5 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 1) 0)) (< |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| 0) (< (mod (select (select (store (store .cse5 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| v_ArrVal_254) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_257) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 4294967296) 65) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_253) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) 0)) (< 0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|)))))) (= 5 (select .cse6 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)) (or (not (= (+ c_~next_alloc_idx~0 3) 0)) .cse0) (or .cse2 (and (or (forall ((v_ArrVal_254 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (< (mod (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_254) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_257) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65)) .cse1) (or (forall ((v_ArrVal_257 (Array Int Int))) (< (mod (select (select (store .cse5 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_257) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65)) .cse3))) (or (forall ((v_ArrVal_253 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_146| Int) (v_ArrVal_248 Int)) (or (= |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_146| |c_ULTIMATE.start_main_~#t~0#1.base|) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_248) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_146| v_ArrVal_253) |c_ULTIMATE.start_main_~#t~0#1.base|) 0)))) .cse0) (<= 0 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| Int) (v_ArrVal_254 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (or (< |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| 0) (< (mod (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| v_ArrVal_254) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_257) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 4294967296) 65) (< 0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) 0)) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 1) 0)))) .cse1) (not (= |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| Int) (v_ArrVal_257 (Array Int Int))) (let ((.cse7 (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|))) (or (< (mod (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| (store .cse7 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_257) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 4294967296) 65) (< |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| 0) (< 0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) 0)) (not (= (+ (select .cse7 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 1) 0))))) .cse3) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| Int) (v_ArrVal_253 Int) (v_ArrVal_251 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| Int) (v_ArrVal_254 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_251))) (or (< |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| 0) (not (= (+ (select (select .cse8 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 1) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_253) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) 0)) (< 0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) (< (mod (select (select (store (store .cse8 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| v_ArrVal_254) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_257) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 4294967296) 65)))) .cse2 .cse0 .cse1) (<= |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0) (exists ((v_prenex_7 Int)) (= (select (select |c_#memory_int| v_prenex_7) 0) 3)) (or (< (+ 4294967291 (* (div (+ c_~next_alloc_idx~0 (- 61)) 4294967296) 4294967296)) c_~next_alloc_idx~0) .cse0)))) is different from false [2023-08-29 20:05:03,115 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (<= c_~next_alloc_idx~0 64)) (.cse3 (< 64 c_~next_alloc_idx~0))) (and (or (and (or (< 62 c_~next_alloc_idx~0) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| Int) (v_ArrVal_253 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_146| Int) (v_ArrVal_257 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_146| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_146|) 0 c_~next_alloc_idx~0)))) (let ((.cse1 (select .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|))) (or (< |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| 0) (< (mod (select (select (store (store .cse0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| (store .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| (+ c_~next_alloc_idx~0 2))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_257) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 4294967296) 65) (not (= (select (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_146| v_ArrVal_253) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) 0)) (not (= (+ (select .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 1) 0)) (< 0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|)))))) (or (<= c_~next_alloc_idx~0 62) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| Int) (v_ArrVal_253 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| Int) (v_ArrVal_254 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_146| Int) (v_ArrVal_257 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_146| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_146|) 0 c_~next_alloc_idx~0)))) (or (< (mod (select (select (store (store .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| v_ArrVal_254) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_257) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 4294967296) 65) (< |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| 0) (not (= (select (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_146| v_ArrVal_253) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) 0)) (not (= (+ (select (select .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 1) 0)) (< 0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|)))))) .cse3) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| Int) (v_ArrVal_254 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (or (< |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| 0) (< (mod (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| v_ArrVal_254) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_257) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 4294967296) 65) (< 0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) 0)) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 1) 0)))) .cse4) (or .cse4 (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| Int) (v_ArrVal_253 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| Int) (v_ArrVal_251 (Array Int Int)) (v_ArrVal_254 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_146| Int) (v_ArrVal_257 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_146| v_ArrVal_251))) (or (< (mod (select (select (store (store .cse5 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| v_ArrVal_254) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_257) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 4294967296) 65) (< |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| 0) (not (= (select (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_146| v_ArrVal_253) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) 0)) (< 0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) (not (= (+ (select (select .cse5 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 1) 0)))))) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| Int) (v_ArrVal_257 (Array Int Int))) (let ((.cse6 (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|))) (or (< (mod (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| (store .cse6 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_257) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 4294967296) 65) (< |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| 0) (< 0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) 0)) (not (= (+ (select .cse6 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 1) 0))))) .cse3))) is different from false [2023-08-29 20:05:03,168 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|))) (let ((.cse5 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store .cse9 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0))) (.cse3 (< 64 c_~next_alloc_idx~0)) (.cse2 (< |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0)) (.cse1 (<= c_~next_alloc_idx~0 64)) (.cse6 (select .cse9 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)) (.cse0 (not (= (select |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) 1)))) (and (or .cse0 .cse1) (or .cse2 .cse3 .cse0 (and (or (< 62 c_~next_alloc_idx~0) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| Int) (v_ArrVal_253 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| Int) (v_ArrVal_257 (Array Int Int))) (let ((.cse4 (select .cse5 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|))) (or (not (= (+ (select .cse4 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 1) 0)) (< (mod (select (select (store (store .cse5 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| (store .cse4 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| (+ c_~next_alloc_idx~0 2))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_257) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 4294967296) 65) (< |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| 0) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_253) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) 0)) (< 0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|))))) (or (<= c_~next_alloc_idx~0 62) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| Int) (v_ArrVal_253 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| Int) (v_ArrVal_254 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (or (not (= (+ (select (select .cse5 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 1) 0)) (< |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| 0) (< (mod (select (select (store (store .cse5 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| v_ArrVal_254) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_257) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 4294967296) 65) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_253) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) 0)) (< 0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|)))))) (= 5 .cse6) (or (not (= (+ c_~next_alloc_idx~0 3) 0)) .cse0) (or .cse2 (and (or (forall ((v_ArrVal_254 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (< (mod (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_254) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_257) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65)) .cse1) (or (forall ((v_ArrVal_257 (Array Int Int))) (< (mod (select (select (store .cse5 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_257) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65)) .cse3))) (<= 5 .cse6) (or (forall ((v_ArrVal_253 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_146| Int) (v_ArrVal_248 Int)) (or (= |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_146| |c_ULTIMATE.start_main_~#t~0#1.base|) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_248) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_146| v_ArrVal_253) |c_ULTIMATE.start_main_~#t~0#1.base|) 0)))) .cse0) (<= 0 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| Int) (v_ArrVal_254 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (or (< |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| 0) (< (mod (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| v_ArrVal_254) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_257) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 4294967296) 65) (< 0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) 0)) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 1) 0)))) .cse1) (not (= |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| Int) (v_ArrVal_257 (Array Int Int))) (let ((.cse7 (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|))) (or (< (mod (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| (store .cse7 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_257) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 4294967296) 65) (< |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| 0) (< 0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) 0)) (not (= (+ (select .cse7 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 1) 0))))) .cse3) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| Int) (v_ArrVal_253 Int) (v_ArrVal_251 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| Int) (v_ArrVal_254 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_251))) (or (< |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| 0) (not (= (+ (select (select .cse8 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 1) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_253) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) 0)) (< 0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) (< (mod (select (select (store (store .cse8 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| v_ArrVal_254) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_257) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 4294967296) 65)))) .cse2 .cse0 .cse1) (<= |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0) (<= .cse6 5) (or (< (+ 4294967291 (* (div (+ c_~next_alloc_idx~0 (- 61)) 4294967296) 4294967296)) c_~next_alloc_idx~0) .cse0)))) is different from false [2023-08-29 20:05:05,684 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse17 (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|))) (let ((.cse0 (< 62 c_~next_alloc_idx~0)) (.cse3 (+ c_~next_alloc_idx~0 2)) (.cse4 (<= c_~next_alloc_idx~0 62)) (.cse11 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store .cse17 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0))) (.cse9 (< |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0)) (.cse6 (< 64 c_~next_alloc_idx~0)) (.cse8 (<= c_~next_alloc_idx~0 64)) (.cse12 (select .cse17 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)) (.cse7 (not (= (select |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) 1)))) (and (or (and (or .cse0 (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| Int) (v_ArrVal_253 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_146| Int) (v_ArrVal_257 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_146| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_146|) 0 c_~next_alloc_idx~0)))) (let ((.cse2 (select .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|))) (or (< |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| 0) (< (mod (select (select (store (store .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| (store .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| .cse3)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_257) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 4294967296) 65) (not (= (select (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_146| v_ArrVal_253) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) 0)) (not (= (+ (select .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 1) 0)) (< 0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|)))))) (or .cse4 (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| Int) (v_ArrVal_253 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| Int) (v_ArrVal_254 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_146| Int) (v_ArrVal_257 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_146| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_146|) 0 c_~next_alloc_idx~0)))) (or (< (mod (select (select (store (store .cse5 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| v_ArrVal_254) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_257) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 4294967296) 65) (< |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| 0) (not (= (select (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_146| v_ArrVal_253) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) 0)) (not (= (+ (select (select .cse5 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 1) 0)) (< 0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|)))))) .cse6) (or .cse7 .cse8) (or .cse9 .cse6 .cse7 (and (or .cse0 (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| Int) (v_ArrVal_253 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| Int) (v_ArrVal_257 (Array Int Int))) (let ((.cse10 (select .cse11 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|))) (or (not (= (+ (select .cse10 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 1) 0)) (< (mod (select (select (store (store .cse11 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| (store .cse10 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| .cse3)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_257) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 4294967296) 65) (< |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| 0) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_253) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) 0)) (< 0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|))))) (or .cse4 (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| Int) (v_ArrVal_253 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| Int) (v_ArrVal_254 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (or (not (= (+ (select (select .cse11 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 1) 0)) (< |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| 0) (< (mod (select (select (store (store .cse11 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| v_ArrVal_254) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_257) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 4294967296) 65) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_253) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) 0)) (< 0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|)))))) (or (not (= (+ c_~next_alloc_idx~0 3) 0)) .cse7) (or .cse9 (and (or (forall ((v_ArrVal_254 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (< (mod (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_254) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_257) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65)) .cse8) (or (forall ((v_ArrVal_257 (Array Int Int))) (< (mod (select (select (store .cse11 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_257) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65)) .cse6))) (<= 5 .cse12) (or (forall ((v_ArrVal_253 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_146| Int) (v_ArrVal_248 Int)) (or (= |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_146| |c_ULTIMATE.start_main_~#t~0#1.base|) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_248) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_146| v_ArrVal_253) |c_ULTIMATE.start_main_~#t~0#1.base|) 0)))) .cse7) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| Int) (v_ArrVal_254 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (or (< |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| 0) (< (mod (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| v_ArrVal_254) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_257) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 4294967296) 65) (< 0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) 0)) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 1) 0)))) .cse8) (or .cse8 (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| Int) (v_ArrVal_253 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| Int) (v_ArrVal_251 (Array Int Int)) (v_ArrVal_254 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_146| Int) (v_ArrVal_257 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_146| v_ArrVal_251))) (or (< (mod (select (select (store (store .cse13 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| v_ArrVal_254) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_257) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 4294967296) 65) (< |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| 0) (not (= (select (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_146| v_ArrVal_253) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) 0)) (< 0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) (not (= (+ (select (select .cse13 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 1) 0)))))) (not (= |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| Int) (v_ArrVal_257 (Array Int Int))) (let ((.cse14 (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|))) (or (< (mod (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| (store .cse14 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_257) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 4294967296) 65) (< |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| 0) (< 0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) 0)) (not (= (+ (select .cse14 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 1) 0))))) .cse6) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| Int) (v_ArrVal_253 Int) (v_ArrVal_251 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| Int) (v_ArrVal_254 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_251))) (or (< |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| 0) (not (= (+ (select (select .cse15 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 1) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_253) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) 0)) (< 0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) (< (mod (select (select (store (store .cse15 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| v_ArrVal_254) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_257) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 4294967296) 65)))) .cse9 .cse7 .cse8) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| Int) (v_ArrVal_253 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| Int) (v_ArrVal_257 (Array Int Int))) (let ((.cse16 (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|))) (or (< (mod (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| (store .cse16 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_257) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 4294967296) 65) (< |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| 0) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_253) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) 0)) (< 0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) (not (= (+ (select .cse16 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 1) 0))))) .cse6) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| Int) (v_ArrVal_253 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| Int) (v_ArrVal_254 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (or (< |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118| 0) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_253) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) 0)) (< (mod (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144| v_ArrVal_254) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_257) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 4294967296) 65) (< 0 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_144|) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset_118|) 1) 0)))) .cse8) (<= .cse12 5) (or (< (+ 4294967291 (* (div (+ c_~next_alloc_idx~0 (- 61)) 4294967296) 4294967296)) c_~next_alloc_idx~0) .cse7)))) is different from false [2023-08-29 20:05:08,443 INFO L130 PetriNetUnfolder]: 174/635 cut-off events. [2023-08-29 20:05:08,443 INFO L131 PetriNetUnfolder]: For 5415/5415 co-relation queries the response was YES. [2023-08-29 20:05:08,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3839 conditions, 635 events. 174/635 cut-off events. For 5415/5415 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 3119 event pairs, 4 based on Foata normal form. 37/671 useless extension candidates. Maximal degree in co-relation 3803. Up to 186 conditions per place. [2023-08-29 20:05:08,449 INFO L137 encePairwiseOnDemand]: 171/188 looper letters, 118 selfloop transitions, 166 changer transitions 0/286 dead transitions. [2023-08-29 20:05:08,449 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 286 transitions, 3924 flow [2023-08-29 20:05:08,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-08-29 20:05:08,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2023-08-29 20:05:08,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 2364 transitions. [2023-08-29 20:05:08,457 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2675418741511996 [2023-08-29 20:05:08,457 INFO L72 ComplementDD]: Start complementDD. Operand 47 states and 2364 transitions. [2023-08-29 20:05:08,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 2364 transitions. [2023-08-29 20:05:08,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:05:08,458 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 47 states and 2364 transitions. [2023-08-29 20:05:08,463 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 48 states, 47 states have (on average 50.297872340425535) internal successors, (2364), 47 states have internal predecessors, (2364), 0 states have call successors, (0), 0 states have call 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:08,473 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 48 states, 48 states have (on average 188.0) internal successors, (9024), 48 states have internal predecessors, (9024), 0 states have call successors, (0), 0 states have call 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:08,474 INFO L81 ComplementDD]: Finished complementDD. Result has 48 states, 48 states have (on average 188.0) internal successors, (9024), 48 states have internal predecessors, (9024), 0 states have call successors, (0), 0 states have call 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:08,474 INFO L175 Difference]: Start difference. First operand has 87 places, 110 transitions, 1319 flow. Second operand 47 states and 2364 transitions. [2023-08-29 20:05:08,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 286 transitions, 3924 flow [2023-08-29 20:05:08,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 286 transitions, 3691 flow, removed 98 selfloop flow, removed 7 redundant places. [2023-08-29 20:05:08,495 INFO L231 Difference]: Finished difference. Result has 144 places, 223 transitions, 3230 flow [2023-08-29 20:05:08,495 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=1128, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=3230, PETRI_PLACES=144, PETRI_TRANSITIONS=223} [2023-08-29 20:05:08,496 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 104 predicate places. [2023-08-29 20:05:08,496 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 223 transitions, 3230 flow [2023-08-29 20:05:08,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 48.31428571428572) internal successors, (1691), 35 states have internal predecessors, (1691), 0 states have call successors, (0), 0 states have call 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:08,497 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:05:08,497 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2023-08-29 20:05:08,505 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:05:08,702 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,SelfDestructingSolverStorable10 [2023-08-29 20:05:08,703 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err11ASSERT_VIOLATIONARRAY_INDEX === [thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err11ASSERT_VIOLATIONARRAY_INDEX, thr1Err8ASSERT_VIOLATIONARRAY_INDEX (and 30 more)] === [2023-08-29 20:05:08,703 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:05:08,703 INFO L85 PathProgramCache]: Analyzing trace with hash -11763719, now seen corresponding path program 1 times [2023-08-29 20:05:08,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:05:08,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999224093] [2023-08-29 20:05:08,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:05:08,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:05:08,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:05:09,580 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:05:09,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:05:09,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999224093] [2023-08-29 20:05:09,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999224093] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 20:05:09,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076706364] [2023-08-29 20:05:09,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:05:09,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 20:05:09,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:05:09,583 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:05:09,584 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:05:09,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:05:09,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 34 conjunts are in the unsatisfiable core [2023-08-29 20:05:09,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:05:09,708 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:05:09,735 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-29 20:05:09,736 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:05:09,772 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:05:09,775 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:05:09,848 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:05:09,902 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-29 20:05:09,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:05:10,009 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-29 20:05:10,010 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 2 case distinctions, treesize of input 23 treesize of output 27 [2023-08-29 20:05:10,022 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:05:10,130 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:05:10,177 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 20:05:10,177 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:05:10,245 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-08-29 20:05:10,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 19 treesize of output 26 [2023-08-29 20:05:10,258 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:05:10,260 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:05:10,355 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-08-29 20:05:10,355 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 30 treesize of output 39 [2023-08-29 20:05:10,402 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:05:10,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 20:05:10,529 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:05:10,535 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:05:10,572 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_333 (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_333) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 4294967296) 65) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0))) (< 64 c_~next_alloc_idx~0)) (or (<= c_~next_alloc_idx~0 64) (forall ((|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_330 (Array Int Int)) (v_ArrVal_333 (Array Int Int))) (or (< (mod (+ (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_330) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_333) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 4294967296) 65) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0))))) is different from false [2023-08-29 20:05:10,750 WARN L839 $PredicateComparison]: unable to prove that (and (or (<= c_~next_alloc_idx~0 64) (forall ((|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_330 (Array Int Int)) (v_ArrVal_329 Int) (v_ArrVal_333 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| Int)) (or (< (mod (+ (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| v_ArrVal_330) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_333) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 4294967296) 65) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_329) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) 0)) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0)))) (or (forall ((|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_329 Int) (v_ArrVal_333 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| Int)) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_329) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) 0)) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0) (< (mod (+ (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_333) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 4294967296) 65))) (< 64 c_~next_alloc_idx~0))) is different from false [2023-08-29 20:05:10,955 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 97 treesize of output 93 [2023-08-29 20:05:11,021 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (< |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0)) (.cse2 (not (= (select |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) 1)))) (and (or .cse0 (and (or (< 62 c_~next_alloc_idx~0) (forall ((v_ArrVal_328 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_329 Int) (v_ArrVal_333 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| Int)) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_329) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) 0)) (< (mod (+ (select (select (store (let ((.cse1 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_328))) (store .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| (store (select .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| (+ c_~next_alloc_idx~0 2)))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_333) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 4294967296) 65) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0)))) (or (<= c_~next_alloc_idx~0 62) (forall ((v_ArrVal_328 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_330 (Array Int Int)) (v_ArrVal_329 Int) (v_ArrVal_333 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| Int)) (or (< (mod (+ (select (select (store (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_328) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| v_ArrVal_330) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_333) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 4294967296) 65) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_329) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) 0)) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0))))) (< 64 c_~next_alloc_idx~0) .cse2) (or (forall ((v_ArrVal_327 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_330 (Array Int Int)) (v_ArrVal_329 Int) (v_ArrVal_333 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| Int)) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_329) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) 0)) (< (mod (+ (select (select (store (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_327) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| v_ArrVal_330) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_333) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 4294967296) 65) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0))) .cse0 .cse2 (<= c_~next_alloc_idx~0 64)))) is different from false [2023-08-29 20:05:12,369 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 20:05:12,369 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:05:12,375 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:05:12,385 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 20:05:12,386 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:05:12,471 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:05:12,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-08-29 20:05:12,545 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 20:05:12,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 281 treesize of output 322 [2023-08-29 20:05:12,558 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 223 treesize of output 221 [2023-08-29 20:05:12,570 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 221 treesize of output 219 [2023-08-29 20:05:12,580 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 219 treesize of output 215 [2023-08-29 20:05:12,591 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 215 treesize of output 213 [2023-08-29 20:05:12,602 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 213 treesize of output 211 [2023-08-29 20:05:20,964 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 6 refuted. 3 times theorem prover too weak. 0 trivial. 13 not checked. [2023-08-29 20:05:20,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2076706364] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 20:05:20,965 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 20:05:20,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 35 [2023-08-29 20:05:20,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877598565] [2023-08-29 20:05:20,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 20:05:20,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-08-29 20:05:20,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:05:20,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-08-29 20:05:20,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=938, Unknown=14, NotChecked=198, Total=1332 [2023-08-29 20:05:20,969 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 188 [2023-08-29 20:05:20,971 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 223 transitions, 3230 flow. Second operand has 37 states, 37 states have (on average 48.32432432432432) internal successors, (1788), 37 states have internal predecessors, (1788), 0 states have call successors, (0), 0 states have call 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:20,971 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:05:20,971 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 188 [2023-08-29 20:05:20,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:05:22,435 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse5 (<= c_~next_alloc_idx~0 64)) (.cse4 (< 64 c_~next_alloc_idx~0)) (.cse3 (<= c_~next_alloc_idx~0 62)) (.cse0 (< 62 c_~next_alloc_idx~0)) (.cse2 (+ c_~next_alloc_idx~0 2))) (and (or (and (or .cse0 (forall ((v_ArrVal_328 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_329 Int) (v_ArrVal_333 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_153| Int)) (or (not (= (select (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_153| v_ArrVal_329) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) 0)) (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_153|) 0)) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_153|) 0) 1) 0)) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0) (< (mod (+ (select (select (store (let ((.cse1 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_153| v_ArrVal_328))) (store .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| (store (select .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| .cse2))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_333) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 4294967296) 65)))) (or .cse3 (forall ((v_ArrVal_328 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_329 Int) (v_ArrVal_330 (Array Int Int)) (v_ArrVal_333 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_153| Int)) (or (not (= (select (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_153| v_ArrVal_329) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) 0)) (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_153|) 0)) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_153|) 0) 1) 0)) (< (mod (+ (select (select (store (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_153| v_ArrVal_328) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| v_ArrVal_330) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_333) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 4294967296) 65) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0))))) .cse4) (or .cse4 (forall ((|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_333 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| Int)) (or (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) 0)) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0) (< (mod (+ (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_333) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 4294967296) 65)))) (or .cse5 (forall ((|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_330 (Array Int Int)) (v_ArrVal_329 Int) (v_ArrVal_333 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| Int)) (or (< (mod (+ (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| v_ArrVal_330) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_333) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 4294967296) 65) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_329) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) 0)) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0)))) (or (= |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0) (exists ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_150| Int)) (and (= (select (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_150|) 0) 1) (not (= |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_150| |c_ULTIMATE.start_main_~#t~0#1.base|))))) (= 5 (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_155| Int)) (or (forall ((v_prenex_84 Int) (v_prenex_80 Int) (v_prenex_83 Int)) (let ((.cse6 (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_155| v_prenex_84))) (or (not (= (select .cse6 v_prenex_83) 0)) (= |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_155| v_prenex_83) (not (= (select (store .cse6 v_prenex_83 v_prenex_80) |c_ULTIMATE.start_main_~#t~0#1.base|) 0))))) (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_155|) 0)))) (<= 0 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) (or (forall ((|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_327 (Array Int Int)) (v_ArrVal_329 Int) (v_ArrVal_330 (Array Int Int)) (v_ArrVal_333 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| Int) (v_ArrVal_325 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_153| Int)) (let ((.cse7 (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_325))) (or (< (mod (+ (select (select (store (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_153| v_ArrVal_327) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| v_ArrVal_330) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_333) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 4294967296) 65) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_153|) 0) 1) 0)) (not (= (select (store .cse7 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_153| v_ArrVal_329) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) 0)) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0) (not (= (select .cse7 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_153|) 0))))) .cse5) (not (= |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (or .cse5 (forall ((|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_327 (Array Int Int)) (v_ArrVal_329 Int) (v_ArrVal_330 (Array Int Int)) (v_ArrVal_333 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_153| Int)) (or (not (= (select (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_153| v_ArrVal_329) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) 0)) (< (mod (+ (select (select (store (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_153| v_ArrVal_327) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| v_ArrVal_330) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_333) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 4294967296) 65) (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_153|) 0)) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_153|) 0) 1) 0)) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0)))) (or .cse5 (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_155| Int)) (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_155|) 0)))) (or (not (= (+ c_~next_alloc_idx~0 1) 0)) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_155| Int) (v_prenex_84 Int) (v_prenex_80 Int) (v_prenex_83 Int)) (let ((.cse8 (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_155| v_prenex_84))) (or (not (= (select .cse8 v_prenex_83) 0)) (not (= (select (store .cse8 v_prenex_83 v_prenex_80) |c_ULTIMATE.start_main_~#t~0#1.base|) 0)) (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_155|) 0)))))) (or (< (mod (+ c_~next_alloc_idx~0 5) 4294967296) 65) (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_155| Int) (v_prenex_84 Int) (v_prenex_80 Int) (v_prenex_83 Int) (v_prenex_82 Int)) (let ((.cse9 (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_155| v_prenex_84))) (or (not (= (select .cse9 v_prenex_83) 0)) (= |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_155| v_prenex_83) (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_155|) 0)) (not (= (select (store .cse9 v_prenex_83 v_prenex_80) v_prenex_82) 0)))))) (or (forall ((|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_329 Int) (v_ArrVal_333 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| Int)) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_329) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) 0)) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0) (< (mod (+ (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_333) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 4294967296) 65))) .cse4) (or (forall ((|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_330 (Array Int Int)) (v_ArrVal_333 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| Int)) (or (< (mod (+ (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| v_ArrVal_330) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_333) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 4294967296) 65) (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) 0)) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0))) .cse5) (or .cse4 (and (or (forall ((v_ArrVal_328 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_329 Int) (v_ArrVal_330 (Array Int Int)) (v_ArrVal_333 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| Int) (v_ArrVal_325 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_153| Int)) (let ((.cse10 (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_325))) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_153|) 0) 1) 0)) (< (mod (+ (select (select (store (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_153| v_ArrVal_328) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| v_ArrVal_330) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_333) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 4294967296) 65) (not (= (select (store .cse10 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_153| v_ArrVal_329) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) 0)) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0) (not (= (select .cse10 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_153|) 0))))) .cse3) (or .cse0 (forall ((v_ArrVal_328 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_329 Int) (v_ArrVal_333 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| Int) (v_ArrVal_325 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_153| Int)) (let ((.cse11 (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_325))) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_153|) 0) 1) 0)) (not (= (select (store .cse11 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_153| v_ArrVal_329) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) 0)) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0) (not (= (select .cse11 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_153|) 0)) (< (mod (+ (select (select (store (let ((.cse12 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_153| v_ArrVal_328))) (store .cse12 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| (store (select .cse12 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| .cse2))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_333) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 4294967296) 65))))))))) is different from false [2023-08-29 20:05:22,468 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (<= c_~next_alloc_idx~0 64)) (.cse2 (< 64 c_~next_alloc_idx~0))) (and (or .cse0 (forall ((|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_330 (Array Int Int)) (v_ArrVal_329 Int) (v_ArrVal_333 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| Int)) (or (< (mod (+ (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| v_ArrVal_330) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_333) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 4294967296) 65) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_329) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) 0)) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0)))) (or (= |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0) (exists ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_150| Int)) (and (= (select (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_150|) 0) 1) (not (= |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_150| |c_ULTIMATE.start_main_~#t~0#1.base|))))) (= 5 (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)) (<= 0 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) (or (forall ((|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_327 (Array Int Int)) (v_ArrVal_329 Int) (v_ArrVal_330 (Array Int Int)) (v_ArrVal_333 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| Int) (v_ArrVal_325 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_153| Int)) (let ((.cse1 (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_325))) (or (< (mod (+ (select (select (store (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_153| v_ArrVal_327) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| v_ArrVal_330) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_333) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 4294967296) 65) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_153|) 0) 1) 0)) (not (= (select (store .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_153| v_ArrVal_329) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) 0)) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0) (not (= (select .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_153|) 0))))) .cse0) (not (= |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (or (forall ((|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_329 Int) (v_ArrVal_333 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| Int)) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_329) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) 0)) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0) (< (mod (+ (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_333) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 4294967296) 65))) .cse2) (or .cse2 (and (or (forall ((v_ArrVal_328 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_329 Int) (v_ArrVal_330 (Array Int Int)) (v_ArrVal_333 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| Int) (v_ArrVal_325 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_153| Int)) (let ((.cse3 (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_325))) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_153|) 0) 1) 0)) (< (mod (+ (select (select (store (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_153| v_ArrVal_328) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| v_ArrVal_330) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_333) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 4294967296) 65) (not (= (select (store .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_153| v_ArrVal_329) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) 0)) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0) (not (= (select .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_153|) 0))))) (<= c_~next_alloc_idx~0 62)) (or (< 62 c_~next_alloc_idx~0) (forall ((v_ArrVal_328 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_329 Int) (v_ArrVal_333 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| Int) (v_ArrVal_325 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_153| Int)) (let ((.cse4 (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_325))) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_153|) 0) 1) 0)) (not (= (select (store .cse4 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_153| v_ArrVal_329) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) 0)) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0) (not (= (select .cse4 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_153|) 0)) (< (mod (+ (select (select (store (let ((.cse5 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_153| v_ArrVal_328))) (store .cse5 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| (store (select .cse5 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| (+ c_~next_alloc_idx~0 2)))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_333) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 4294967296) 65))))))))) is different from false [2023-08-29 20:05:23,374 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (<= c_~next_alloc_idx~0 64)) (.cse2 (< 64 c_~next_alloc_idx~0))) (and (or .cse0 (forall ((|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_330 (Array Int Int)) (v_ArrVal_329 Int) (v_ArrVal_333 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| Int)) (or (< (mod (+ (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| v_ArrVal_330) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_333) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 4294967296) 65) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_329) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) 0)) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0)))) (or (forall ((|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_327 (Array Int Int)) (v_ArrVal_329 Int) (v_ArrVal_330 (Array Int Int)) (v_ArrVal_333 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| Int) (v_ArrVal_325 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_153| Int)) (let ((.cse1 (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_325))) (or (< (mod (+ (select (select (store (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_153| v_ArrVal_327) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| v_ArrVal_330) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_333) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 4294967296) 65) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_153|) 0) 1) 0)) (not (= (select (store .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_153| v_ArrVal_329) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) 0)) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0) (not (= (select .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_153|) 0))))) .cse0) (or (forall ((|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_329 Int) (v_ArrVal_333 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| Int)) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_329) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) 0)) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0) (< (mod (+ (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_333) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 4294967296) 65))) .cse2) (or .cse2 (and (or (forall ((v_ArrVal_328 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_329 Int) (v_ArrVal_330 (Array Int Int)) (v_ArrVal_333 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| Int) (v_ArrVal_325 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_153| Int)) (let ((.cse3 (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_325))) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_153|) 0) 1) 0)) (< (mod (+ (select (select (store (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_153| v_ArrVal_328) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| v_ArrVal_330) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_333) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 4294967296) 65) (not (= (select (store .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_153| v_ArrVal_329) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) 0)) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0) (not (= (select .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_153|) 0))))) (<= c_~next_alloc_idx~0 62)) (or (< 62 c_~next_alloc_idx~0) (forall ((v_ArrVal_328 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_329 Int) (v_ArrVal_333 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| Int) (v_ArrVal_325 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_153| Int)) (let ((.cse4 (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_325))) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_153|) 0) 1) 0)) (not (= (select (store .cse4 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_153| v_ArrVal_329) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) 0)) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0) (not (= (select .cse4 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_153|) 0)) (< (mod (+ (select (select (store (let ((.cse5 (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_153| v_ArrVal_328))) (store .cse5 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| (store (select .cse5 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| (+ c_~next_alloc_idx~0 2)))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_333) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 4294967296) 65))))))))) is different from false [2023-08-29 20:05:24,812 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (< 64 c_~next_alloc_idx~0)) (.cse0 (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|)) (.cse5 (<= c_~next_alloc_idx~0 64))) (and (or (forall ((|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_333 (Array Int Int))) (or (< (mod (+ (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store .cse0 |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_333) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 4294967296) 65) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0))) .cse1) (or (let ((.cse2 (< |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0)) (.cse4 (not (= (select |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) 1)))) (and (or .cse2 (and (or (< 62 c_~next_alloc_idx~0) (forall ((v_ArrVal_328 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_329 Int) (v_ArrVal_333 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| Int)) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_329) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) 0)) (< (mod (+ (select (select (store (let ((.cse3 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_328))) (store .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| (store (select .cse3 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| (+ c_~next_alloc_idx~0 2)))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_333) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 4294967296) 65) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0)))) (or (<= c_~next_alloc_idx~0 62) (forall ((v_ArrVal_328 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_330 (Array Int Int)) (v_ArrVal_329 Int) (v_ArrVal_333 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| Int)) (or (< (mod (+ (select (select (store (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_328) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| v_ArrVal_330) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_333) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 4294967296) 65) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_329) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) 0)) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0))))) .cse1 .cse4) (or (forall ((v_ArrVal_327 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_330 (Array Int Int)) (v_ArrVal_329 Int) (v_ArrVal_333 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| Int)) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_329) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) 0)) (< (mod (+ (select (select (store (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_327) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| v_ArrVal_330) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_333) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 4294967296) 65) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0))) .cse2 .cse4 .cse5))) (not (= (+ (select .cse0 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 0))) (or .cse5 (forall ((|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_330 (Array Int Int)) (v_ArrVal_333 (Array Int Int))) (or (< (mod (+ (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_330) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_333) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 4294967296) 65) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0)))))) is different from false [2023-08-29 20:05:25,021 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (< 64 c_~next_alloc_idx~0)) (.cse0 (< |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0)) (.cse3 (not (= (select |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) 1))) (.cse4 (<= c_~next_alloc_idx~0 64))) (and (or .cse0 (and (or (< 62 c_~next_alloc_idx~0) (forall ((v_ArrVal_328 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_329 Int) (v_ArrVal_333 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| Int)) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_329) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) 0)) (< (mod (+ (select (select (store (let ((.cse1 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_328))) (store .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| (store (select .cse1 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| (+ c_~next_alloc_idx~0 2)))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_333) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 4294967296) 65) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0)))) (or (<= c_~next_alloc_idx~0 62) (forall ((v_ArrVal_328 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_330 (Array Int Int)) (v_ArrVal_329 Int) (v_ArrVal_333 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| Int)) (or (< (mod (+ (select (select (store (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_328) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| v_ArrVal_330) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_333) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 4294967296) 65) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_329) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) 0)) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0))))) .cse2 .cse3) (or (forall ((|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_333 (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_333) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 4294967296) 65) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0))) .cse2) (or (forall ((v_ArrVal_327 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_330 (Array Int Int)) (v_ArrVal_329 Int) (v_ArrVal_333 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| Int)) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_329) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) 0)) (< (mod (+ (select (select (store (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_327) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| v_ArrVal_330) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_333) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 4294967296) 65) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0))) .cse0 .cse3 .cse4) (or .cse4 (forall ((|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_330 (Array Int Int)) (v_ArrVal_333 (Array Int Int))) (or (< (mod (+ (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_330) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_333) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 4294967296) 65) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0)))))) is different from false [2023-08-29 20:05:25,139 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_333 (Array Int Int))) (< (mod (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_333) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 4294967296) 65)) (or (<= c_~next_alloc_idx~0 64) (forall ((|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_330 (Array Int Int)) (v_ArrVal_329 Int) (v_ArrVal_333 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| Int)) (or (< (mod (+ (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| v_ArrVal_330) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_333) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 4294967296) 65) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_329) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) 0)) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0)))) (or (forall ((|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_329 Int) (v_ArrVal_333 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| Int)) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_329) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) 0)) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0) (< (mod (+ (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_333) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 4294967296) 65))) (< 64 c_~next_alloc_idx~0))) is different from false [2023-08-29 20:05:26,087 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (<= c_~next_alloc_idx~0 64)) (.cse3 (< 64 c_~next_alloc_idx~0))) (and (or .cse0 (forall ((|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_330 (Array Int Int)) (v_ArrVal_329 Int) (v_ArrVal_333 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| Int)) (or (< (mod (+ (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| v_ArrVal_330) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_333) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 4294967296) 65) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_329) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) 0)) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0)))) (or (let ((.cse1 (< |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0)) (.cse4 (not (= (select |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) 1)))) (and (or .cse1 (and (or (< 62 c_~next_alloc_idx~0) (forall ((v_ArrVal_328 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_329 Int) (v_ArrVal_333 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| Int)) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_329) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) 0)) (< (mod (+ (select (select (store (let ((.cse2 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_328))) (store .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| (store (select .cse2 |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| (+ c_~next_alloc_idx~0 2)))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_333) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 4294967296) 65) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0)))) (or (<= c_~next_alloc_idx~0 62) (forall ((v_ArrVal_328 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_330 (Array Int Int)) (v_ArrVal_329 Int) (v_ArrVal_333 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| Int)) (or (< (mod (+ (select (select (store (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_328) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| v_ArrVal_330) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_333) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 4294967296) 65) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_329) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) 0)) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0))))) .cse3 .cse4) (or (forall ((v_ArrVal_327 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_330 (Array Int Int)) (v_ArrVal_329 Int) (v_ArrVal_333 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| Int)) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_329) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) 0)) (< (mod (+ (select (select (store (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_327) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| v_ArrVal_330) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_333) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 4294967296) 65) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0))) .cse1 .cse4 .cse0))) (not (= (+ (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 0))) (or (forall ((|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_329 Int) (v_ArrVal_333 (Array Int Int)) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| Int)) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_329) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) 0)) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0) (< (mod (+ (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_333) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_151|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 1) 4294967296) 65))) .cse3))) is different from false [2023-08-29 20:05:28,698 INFO L130 PetriNetUnfolder]: 275/988 cut-off events. [2023-08-29 20:05:28,698 INFO L131 PetriNetUnfolder]: For 13041/13041 co-relation queries the response was YES. [2023-08-29 20:05:28,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7482 conditions, 988 events. 275/988 cut-off events. For 13041/13041 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 5704 event pairs, 3 based on Foata normal form. 18/1006 useless extension candidates. Maximal degree in co-relation 7428. Up to 235 conditions per place. [2023-08-29 20:05:28,711 INFO L137 encePairwiseOnDemand]: 171/188 looper letters, 154 selfloop transitions, 341 changer transitions 0/497 dead transitions. [2023-08-29 20:05:28,712 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 497 transitions, 8428 flow [2023-08-29 20:05:28,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2023-08-29 20:05:28,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2023-08-29 20:05:28,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 2658 transitions. [2023-08-29 20:05:28,719 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2667603372139703 [2023-08-29 20:05:28,719 INFO L72 ComplementDD]: Start complementDD. Operand 53 states and 2658 transitions. [2023-08-29 20:05:28,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 2658 transitions. [2023-08-29 20:05:28,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:05:28,721 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 53 states and 2658 transitions. [2023-08-29 20:05:28,726 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 54 states, 53 states have (on average 50.15094339622642) internal successors, (2658), 53 states have internal predecessors, (2658), 0 states have call successors, (0), 0 states have call 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:28,738 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 54 states, 54 states have (on average 188.0) internal successors, (10152), 54 states have internal predecessors, (10152), 0 states have call successors, (0), 0 states have call 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:28,740 INFO L81 ComplementDD]: Finished complementDD. Result has 54 states, 54 states have (on average 188.0) internal successors, (10152), 54 states have internal predecessors, (10152), 0 states have call successors, (0), 0 states have call 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:28,741 INFO L175 Difference]: Start difference. First operand has 144 places, 223 transitions, 3230 flow. Second operand 53 states and 2658 transitions. [2023-08-29 20:05:28,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 497 transitions, 8428 flow [2023-08-29 20:05:28,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 497 transitions, 7942 flow, removed 230 selfloop flow, removed 6 redundant places. [2023-08-29 20:05:28,804 INFO L231 Difference]: Finished difference. Result has 211 places, 429 transitions, 7275 flow [2023-08-29 20:05:28,804 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=2902, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=149, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=53, PETRI_FLOW=7275, PETRI_PLACES=211, PETRI_TRANSITIONS=429} [2023-08-29 20:05:28,806 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 171 predicate places. [2023-08-29 20:05:28,806 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 429 transitions, 7275 flow [2023-08-29 20:05:28,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 48.32432432432432) internal successors, (1788), 37 states have internal predecessors, (1788), 0 states have call successors, (0), 0 states have call 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:28,807 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:05:28,807 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2023-08-29 20:05:28,817 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:05:29,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 20:05:29,014 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err14ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err11ASSERT_VIOLATIONARRAY_INDEX, thr1Err8ASSERT_VIOLATIONARRAY_INDEX (and 30 more)] === [2023-08-29 20:05:29,014 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:05:29,014 INFO L85 PathProgramCache]: Analyzing trace with hash -778568576, now seen corresponding path program 1 times [2023-08-29 20:05:29,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:05:29,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791484337] [2023-08-29 20:05:29,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:05:29,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:05:29,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:05:29,748 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:05:29,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:05:29,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791484337] [2023-08-29 20:05:29,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791484337] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 20:05:29,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1555464134] [2023-08-29 20:05:29,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:05:29,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 20:05:29,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:05:29,753 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:05:29,757 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:05:29,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:05:29,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 38 conjunts are in the unsatisfiable core [2023-08-29 20:05:29,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:05:29,870 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:05:29,898 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-29 20:05:29,898 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:05:29,939 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:05:29,944 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:05:30,019 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:05:30,078 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-29 20:05:30,078 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:05:30,177 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-29 20:05:30,177 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 2 case distinctions, treesize of input 23 treesize of output 27 [2023-08-29 20:05:30,189 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:05:30,295 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:05:30,348 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 20:05:30,349 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:05:30,414 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-08-29 20:05:30,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 19 treesize of output 26 [2023-08-29 20:05:30,427 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:05:30,431 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:05:30,546 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-08-29 20:05:30,546 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 31 treesize of output 40 [2023-08-29 20:05:30,603 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 20:05:30,604 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 27 treesize of output 27 [2023-08-29 20:05:30,611 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:05:30,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 20:05:30,619 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_413 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_413) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0))) is different from false [2023-08-29 20:05:30,683 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:05:30,691 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:05:30,726 WARN L839 $PredicateComparison]: unable to prove that (and (or (<= c_~next_alloc_idx~0 64) (forall ((v_ArrVal_413 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_410 (Array Int Int))) (or (= (select v_ArrVal_410 |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_410) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_413) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0))))) (or (forall ((v_ArrVal_411 Int) (v_ArrVal_413 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int)) (or (= v_ArrVal_411 0) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0) (not (= (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| v_ArrVal_411)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_413) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0)))) (< 64 c_~next_alloc_idx~0))) is different from false [2023-08-29 20:05:30,832 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_411 Int) (v_ArrVal_413 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_159| Int) (v_ArrVal_409 Int)) (or (= v_ArrVal_411 0) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_159| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_159|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| v_ArrVal_411)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_413) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_159|) |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0)) (< |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0) (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_409) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_159|) 0)))) is different from false [2023-08-29 20:05:30,924 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 97 treesize of output 93 [2023-08-29 20:05:31,458 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 20:05:31,458 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:05:31,467 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:05:31,479 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 20:05:31,480 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:05:31,602 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-08-29 20:05:31,602 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 156 treesize of output 156 [2023-08-29 20:05:31,614 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 20:05:31,614 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 161 treesize of output 161 [2023-08-29 20:05:31,622 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 123 treesize of output 119 [2023-08-29 20:05:31,628 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 119 treesize of output 115 [2023-08-29 20:05:31,736 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:05:31,755 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:05:31,767 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 20:05:31,767 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 15 treesize of output 19 [2023-08-29 20:05:32,185 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 8 refuted. 1 times theorem prover too weak. 0 trivial. 16 not checked. [2023-08-29 20:05:32,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1555464134] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 20:05:32,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 20:05:32,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 13] total 38 [2023-08-29 20:05:32,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221274504] [2023-08-29 20:05:32,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 20:05:32,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-08-29 20:05:32,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:05:32,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-08-29 20:05:32,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=1090, Unknown=8, NotChecked=216, Total=1560 [2023-08-29 20:05:32,405 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 188 [2023-08-29 20:05:32,406 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 429 transitions, 7275 flow. Second operand has 40 states, 40 states have (on average 43.2) internal successors, (1728), 40 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call 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:32,406 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:05:32,406 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 188 [2023-08-29 20:05:32,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:05:35,141 INFO L130 PetriNetUnfolder]: 291/1044 cut-off events. [2023-08-29 20:05:35,141 INFO L131 PetriNetUnfolder]: For 21631/21631 co-relation queries the response was YES. [2023-08-29 20:05:35,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9361 conditions, 1044 events. 291/1044 cut-off events. For 21631/21631 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 6090 event pairs, 3 based on Foata normal form. 18/1061 useless extension candidates. Maximal degree in co-relation 9285. Up to 267 conditions per place. [2023-08-29 20:05:35,157 INFO L137 encePairwiseOnDemand]: 172/188 looper letters, 217 selfloop transitions, 287 changer transitions 0/506 dead transitions. [2023-08-29 20:05:35,157 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 506 transitions, 10143 flow [2023-08-29 20:05:35,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-08-29 20:05:35,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-08-29 20:05:35,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1081 transitions. [2023-08-29 20:05:35,160 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.23958333333333334 [2023-08-29 20:05:35,160 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 1081 transitions. [2023-08-29 20:05:35,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 1081 transitions. [2023-08-29 20:05:35,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:05:35,161 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 1081 transitions. [2023-08-29 20:05:35,163 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 45.041666666666664) internal successors, (1081), 24 states have internal predecessors, (1081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:05:35,167 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 188.0) internal successors, (4700), 25 states have internal predecessors, (4700), 0 states have call successors, (0), 0 states have call 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:35,167 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 188.0) internal successors, (4700), 25 states have internal predecessors, (4700), 0 states have call successors, (0), 0 states have call 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:35,168 INFO L175 Difference]: Start difference. First operand has 211 places, 429 transitions, 7275 flow. Second operand 24 states and 1081 transitions. [2023-08-29 20:05:35,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 506 transitions, 10143 flow [2023-08-29 20:05:35,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 506 transitions, 9595 flow, removed 223 selfloop flow, removed 13 redundant places. [2023-08-29 20:05:35,282 INFO L231 Difference]: Finished difference. Result has 224 places, 474 transitions, 8729 flow [2023-08-29 20:05:35,282 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=6486, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=411, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=233, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=8729, PETRI_PLACES=224, PETRI_TRANSITIONS=474} [2023-08-29 20:05:35,283 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 184 predicate places. [2023-08-29 20:05:35,283 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 474 transitions, 8729 flow [2023-08-29 20:05:35,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 43.2) internal successors, (1728), 40 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call 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:35,284 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:05:35,284 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2023-08-29 20:05:35,293 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:05:35,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 20:05:35,490 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thr1Err11ASSERT_VIOLATIONARRAY_INDEX === [thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err11ASSERT_VIOLATIONARRAY_INDEX, thr1Err8ASSERT_VIOLATIONARRAY_INDEX (and 30 more)] === [2023-08-29 20:05:35,490 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:05:35,490 INFO L85 PathProgramCache]: Analyzing trace with hash 352581702, now seen corresponding path program 1 times [2023-08-29 20:05:35,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:05:35,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878739265] [2023-08-29 20:05:35,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:05:35,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:05:35,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:05:35,815 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:05:35,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:05:35,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878739265] [2023-08-29 20:05:35,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878739265] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 20:05:35,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118921711] [2023-08-29 20:05:35,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:05:35,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 20:05:35,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:05:35,818 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:05:35,840 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:05:35,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:05:35,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 12 conjunts are in the unsatisfiable core [2023-08-29 20:05:35,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:05:35,967 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:05:36,001 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:05:36,034 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:05:36,064 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:05:36,069 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:05:36,072 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:05:36,090 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:05:36,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 20:05:36,159 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:05:36,165 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:05:36,290 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 97 treesize of output 93 [2023-08-29 20:05:36,294 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 93 treesize of output 89 [2023-08-29 20:05:36,398 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 97 treesize of output 93 [2023-08-29 20:05:36,403 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 93 treesize of output 89 [2023-08-29 20:05:36,517 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 20:05:36,517 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:05:36,523 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:05:36,528 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:05:36,585 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:05:36,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1118921711] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 20:05:36,585 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-29 20:05:36,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-08-29 20:05:36,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633527529] [2023-08-29 20:05:36,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-29 20:05:36,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-29 20:05:36,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:05:36,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-29 20:05:36,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2023-08-29 20:05:36,735 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 188 [2023-08-29 20:05:36,736 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 474 transitions, 8729 flow. Second operand has 13 states, 13 states have (on average 75.38461538461539) internal successors, (980), 13 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call 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:36,736 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:05:36,736 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 188 [2023-08-29 20:05:36,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:05:37,787 INFO L130 PetriNetUnfolder]: 404/1582 cut-off events. [2023-08-29 20:05:37,787 INFO L131 PetriNetUnfolder]: For 40132/40145 co-relation queries the response was YES. [2023-08-29 20:05:37,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15371 conditions, 1582 events. 404/1582 cut-off events. For 40132/40145 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 9488 event pairs, 15 based on Foata normal form. 53/1634 useless extension candidates. Maximal degree in co-relation 15294. Up to 361 conditions per place. [2023-08-29 20:05:37,808 INFO L137 encePairwiseOnDemand]: 180/188 looper letters, 433 selfloop transitions, 286 changer transitions 0/771 dead transitions. [2023-08-29 20:05:37,808 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 771 transitions, 16860 flow [2023-08-29 20:05:37,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-08-29 20:05:37,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-08-29 20:05:37,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1596 transitions. [2023-08-29 20:05:37,811 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42446808510638295 [2023-08-29 20:05:37,812 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 1596 transitions. [2023-08-29 20:05:37,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 1596 transitions. [2023-08-29 20:05:37,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:05:37,812 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1596 transitions. [2023-08-29 20:05:37,815 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 79.8) internal successors, (1596), 20 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call 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:37,818 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 188.0) internal successors, (3948), 21 states have internal predecessors, (3948), 0 states have call successors, (0), 0 states have call 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:37,819 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 188.0) internal successors, (3948), 21 states have internal predecessors, (3948), 0 states have call successors, (0), 0 states have call 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:37,819 INFO L175 Difference]: Start difference. First operand has 224 places, 474 transitions, 8729 flow. Second operand 20 states and 1596 transitions. [2023-08-29 20:05:37,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 771 transitions, 16860 flow [2023-08-29 20:05:37,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 771 transitions, 15634 flow, removed 559 selfloop flow, removed 19 redundant places. [2023-08-29 20:05:37,962 INFO L231 Difference]: Finished difference. Result has 231 places, 559 transitions, 11176 flow [2023-08-29 20:05:37,963 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=7853, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=451, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=193, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=11176, PETRI_PLACES=231, PETRI_TRANSITIONS=559} [2023-08-29 20:05:37,963 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 191 predicate places. [2023-08-29 20:05:37,963 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 559 transitions, 11176 flow [2023-08-29 20:05:37,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 75.38461538461539) internal successors, (980), 13 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call 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:37,964 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:05:37,964 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1] [2023-08-29 20:05:37,971 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:05:38,164 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,SelfDestructingSolverStorable13 [2023-08-29 20:05:38,165 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thr1Err8ASSERT_VIOLATIONARRAY_INDEX === [thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err11ASSERT_VIOLATIONARRAY_INDEX, thr1Err8ASSERT_VIOLATIONARRAY_INDEX (and 30 more)] === [2023-08-29 20:05:38,165 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:05:38,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1032151256, now seen corresponding path program 3 times [2023-08-29 20:05:38,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:05:38,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98251925] [2023-08-29 20:05:38,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:05:38,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:05:38,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:05:39,076 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:05:39,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:05:39,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98251925] [2023-08-29 20:05:39,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98251925] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-29 20:05:39,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758702535] [2023-08-29 20:05:39,076 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-29 20:05:39,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-29 20:05:39,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:05:39,081 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:05:39,105 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:05:39,379 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-08-29 20:05:39,379 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:05:39,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 61 conjunts are in the unsatisfiable core [2023-08-29 20:05:39,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:05:39,392 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:05:39,415 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:05:39,460 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-29 20:05:39,461 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:05:39,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-29 20:05:39,504 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:05:39,506 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:05:39,593 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-29 20:05:39,600 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-08-29 20:05:39,601 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 24 [2023-08-29 20:05:39,621 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:05:39,624 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:05:39,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 7 treesize of output 5 [2023-08-29 20:05:39,920 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:05:39,926 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-29 20:05:39,973 INFO L321 Elim1Store]: treesize reduction 60, result has 49.2 percent of original size [2023-08-29 20:05:39,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 91 [2023-08-29 20:05:40,661 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-29 20:05:40,764 INFO L321 Elim1Store]: treesize reduction 128, result has 44.1 percent of original size [2023-08-29 20:05:40,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 80 treesize of output 152 [2023-08-29 20:05:41,469 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:05:41,472 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:05:41,665 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-29 20:05:41,804 INFO L321 Elim1Store]: treesize reduction 192, result has 38.5 percent of original size [2023-08-29 20:05:41,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 118 treesize of output 205 [2023-08-29 20:05:42,686 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:05:42,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 20:05:42,824 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:05:42,830 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:05:51,372 WARN L222 SmtUtils]: Spent 6.23s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-29 20:05:53,874 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 107 treesize of output 103 [2023-08-29 20:05:53,882 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 103 treesize of output 99 [2023-08-29 20:06:12,482 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 107 treesize of output 103 [2023-08-29 20:06:12,494 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 103 treesize of output 99 [2023-08-29 20:06:25,810 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 97 treesize of output 93 [2023-08-29 20:06:25,822 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 93 treesize of output 89 [2023-08-29 20:06:26,563 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 20:06:26,563 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 1 case distinctions, treesize of input 410 treesize of output 258 [2023-08-29 20:06:27,720 INFO L321 Elim1Store]: treesize reduction 8, result has 83.7 percent of original size [2023-08-29 20:06:27,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1762256 treesize of output 1664946 [2023-08-29 20:06:37,865 WARN L222 SmtUtils]: Spent 10.14s on a formula simplification. DAG size of input: 2161 DAG size of output: 586 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-08-29 20:06:37,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 20:06:37,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 20:06:37,922 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 27580 treesize of output 27564 Killed by 15