/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/parallel-lamport.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-11 19:33:02,859 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-11 19:33:02,860 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-11 19:33:02,891 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-11 19:33:02,891 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-11 19:33:02,892 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-11 19:33:02,893 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-11 19:33:02,894 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-11 19:33:02,895 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-11 19:33:02,895 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-11 19:33:02,896 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-11 19:33:02,896 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-11 19:33:02,897 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-11 19:33:02,897 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-11 19:33:02,898 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-11 19:33:02,898 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-11 19:33:02,899 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-11 19:33:02,899 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-11 19:33:02,900 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-11 19:33:02,901 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-11 19:33:02,902 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-11 19:33:02,903 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-11 19:33:02,904 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-11 19:33:02,904 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-11 19:33:02,906 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-11 19:33:02,906 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-11 19:33:02,907 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-11 19:33:02,907 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-11 19:33:02,907 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-11 19:33:02,908 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-11 19:33:02,908 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-11 19:33:02,908 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-11 19:33:02,909 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-11 19:33:02,909 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-11 19:33:02,910 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-11 19:33:02,910 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-11 19:33:02,911 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-11 19:33:02,911 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-11 19:33:02,911 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-11 19:33:02,911 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-11 19:33:02,912 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-11 19:33:02,913 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-12-11 19:33:02,936 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-11 19:33:02,936 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-11 19:33:02,937 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-11 19:33:02,937 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-11 19:33:02,938 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-11 19:33:02,938 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-11 19:33:02,938 INFO L138 SettingsManager]: * Use SBE=true [2022-12-11 19:33:02,939 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-11 19:33:02,939 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-11 19:33:02,939 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-11 19:33:02,939 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-11 19:33:02,939 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-11 19:33:02,939 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-11 19:33:02,940 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-11 19:33:02,940 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-11 19:33:02,940 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-11 19:33:02,940 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-11 19:33:02,940 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-11 19:33:02,940 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-11 19:33:02,940 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-11 19:33:02,940 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-11 19:33:02,940 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-11 19:33:02,940 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-11 19:33:02,940 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 19:33:02,941 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-11 19:33:02,941 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-11 19:33:02,941 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-11 19:33:02,941 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-11 19:33:02,941 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-11 19:33:02,941 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-11 19:33:02,941 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-11 19:33:02,941 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2022-12-11 19:33:03,163 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-11 19:33:03,174 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-11 19:33:03,176 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-11 19:33:03,177 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-11 19:33:03,177 INFO L275 PluginConnector]: CDTParser initialized [2022-12-11 19:33:03,177 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-lamport.wvr.c [2022-12-11 19:33:04,075 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-11 19:33:04,236 INFO L351 CDTParser]: Found 1 translation units. [2022-12-11 19:33:04,236 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-lamport.wvr.c [2022-12-11 19:33:04,242 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d968126a/a5c8f027ad98421081c8ae5bdee2f81c/FLAG10224a095 [2022-12-11 19:33:04,250 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d968126a/a5c8f027ad98421081c8ae5bdee2f81c [2022-12-11 19:33:04,252 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-11 19:33:04,253 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-11 19:33:04,254 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-11 19:33:04,254 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-11 19:33:04,256 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-11 19:33:04,256 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 07:33:04" (1/1) ... [2022-12-11 19:33:04,257 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cb33134 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:33:04, skipping insertion in model container [2022-12-11 19:33:04,257 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 07:33:04" (1/1) ... [2022-12-11 19:33:04,261 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-11 19:33:04,285 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-11 19:33:04,367 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:33:04,367 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:33:04,368 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:33:04,368 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:33:04,368 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:33:04,368 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:33:04,369 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:33:04,369 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:33:04,369 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:33:04,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:33:04,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:33:04,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:33:04,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:33:04,371 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:33:04,371 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:33:04,371 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:33:04,371 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:33:04,372 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:33:04,372 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:33:04,372 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:33:04,374 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:33:04,374 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:33:04,374 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:33:04,379 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:33:04,379 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:33:04,379 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:33:04,379 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:33:04,380 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:33:04,380 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:33:04,381 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:33:04,381 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:33:04,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:33:04,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:33:04,383 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:33:04,384 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:33:04,384 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:33:04,384 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:33:04,385 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:33:04,386 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:33:04,387 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:33:04,387 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:33:04,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:33:04,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:33:04,389 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:33:04,389 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:33:04,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:33:04,396 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-lamport.wvr.c[4210,4223] [2022-12-11 19:33:04,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 19:33:04,411 INFO L203 MainTranslator]: Completed pre-run [2022-12-11 19:33:04,419 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:33:04,419 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:33:04,419 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:33:04,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:33:04,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:33:04,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:33:04,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:33:04,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:33:04,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:33:04,427 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:33:04,427 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:33:04,427 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:33:04,427 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:33:04,428 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:33:04,428 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:33:04,428 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:33:04,428 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:33:04,428 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:33:04,428 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:33:04,429 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:33:04,429 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:33:04,429 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:33:04,429 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:33:04,429 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:33:04,430 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:33:04,430 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:33:04,430 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:33:04,430 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:33:04,430 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:33:04,430 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:33:04,431 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:33:04,431 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:33:04,431 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:33:04,431 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:33:04,431 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:33:04,431 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:33:04,431 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:33:04,432 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:33:04,432 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:33:04,432 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:33:04,432 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:33:04,433 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:33:04,433 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:33:04,433 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:33:04,433 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:33:04,433 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:33:04,438 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-lamport.wvr.c[4210,4223] [2022-12-11 19:33:04,440 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 19:33:04,449 INFO L208 MainTranslator]: Completed translation [2022-12-11 19:33:04,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:33:04 WrapperNode [2022-12-11 19:33:04,449 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-11 19:33:04,450 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-11 19:33:04,450 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-11 19:33:04,450 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-11 19:33:04,455 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:33:04" (1/1) ... [2022-12-11 19:33:04,460 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:33:04" (1/1) ... [2022-12-11 19:33:04,477 INFO L138 Inliner]: procedures = 25, calls = 89, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 235 [2022-12-11 19:33:04,477 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-11 19:33:04,478 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-11 19:33:04,478 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-11 19:33:04,478 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-11 19:33:04,484 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:33:04" (1/1) ... [2022-12-11 19:33:04,484 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:33:04" (1/1) ... [2022-12-11 19:33:04,487 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:33:04" (1/1) ... [2022-12-11 19:33:04,487 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:33:04" (1/1) ... [2022-12-11 19:33:04,492 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:33:04" (1/1) ... [2022-12-11 19:33:04,494 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:33:04" (1/1) ... [2022-12-11 19:33:04,495 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:33:04" (1/1) ... [2022-12-11 19:33:04,506 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:33:04" (1/1) ... [2022-12-11 19:33:04,508 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-11 19:33:04,509 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-11 19:33:04,509 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-11 19:33:04,509 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-11 19:33:04,510 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:33:04" (1/1) ... [2022-12-11 19:33:04,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 19:33:04,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 19:33:04,534 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) [2022-12-11 19:33:04,549 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 [2022-12-11 19:33:04,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-11 19:33:04,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-11 19:33:04,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-11 19:33:04,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-11 19:33:04,559 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-11 19:33:04,559 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-11 19:33:04,560 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-11 19:33:04,560 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-11 19:33:04,560 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-11 19:33:04,560 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-11 19:33:04,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-11 19:33:04,560 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-11 19:33:04,560 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-11 19:33:04,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-11 19:33:04,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-11 19:33:04,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-11 19:33:04,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-11 19:33:04,561 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-11 19:33:04,648 INFO L236 CfgBuilder]: Building ICFG [2022-12-11 19:33:04,649 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-11 19:33:04,955 INFO L277 CfgBuilder]: Performing block encoding [2022-12-11 19:33:04,998 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-11 19:33:04,999 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-11 19:33:05,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 07:33:05 BoogieIcfgContainer [2022-12-11 19:33:05,000 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-11 19:33:05,002 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-11 19:33:05,002 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-11 19:33:05,004 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-11 19:33:05,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.12 07:33:04" (1/3) ... [2022-12-11 19:33:05,004 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c5329ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 07:33:05, skipping insertion in model container [2022-12-11 19:33:05,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:33:04" (2/3) ... [2022-12-11 19:33:05,004 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c5329ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 07:33:05, skipping insertion in model container [2022-12-11 19:33:05,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 07:33:05" (3/3) ... [2022-12-11 19:33:05,005 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-lamport.wvr.c [2022-12-11 19:33:05,017 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-11 19:33:05,017 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-11 19:33:05,017 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-11 19:33:05,058 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-11 19:33:05,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 175 places, 172 transitions, 368 flow [2022-12-11 19:33:05,158 INFO L130 PetriNetUnfolder]: 7/169 cut-off events. [2022-12-11 19:33:05,158 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-11 19:33:05,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182 conditions, 169 events. 7/169 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 100 event pairs, 0 based on Foata normal form. 0/161 useless extension candidates. Maximal degree in co-relation 138. Up to 2 conditions per place. [2022-12-11 19:33:05,161 INFO L82 GeneralOperation]: Start removeDead. Operand has 175 places, 172 transitions, 368 flow [2022-12-11 19:33:05,164 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 162 places, 159 transitions, 336 flow [2022-12-11 19:33:05,170 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-11 19:33:05,176 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=LoopsAndPotentialCycles, 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;@2a4baab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-11 19:33:05,176 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-11 19:33:05,198 INFO L130 PetriNetUnfolder]: 7/158 cut-off events. [2022-12-11 19:33:05,198 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-11 19:33:05,198 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:33:05,199 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:33:05,199 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 19:33:05,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:33:05,202 INFO L85 PathProgramCache]: Analyzing trace with hash 744144769, now seen corresponding path program 1 times [2022-12-11 19:33:05,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:33:05,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994070213] [2022-12-11 19:33:05,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:33:05,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:33:05,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:33:05,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 19:33:05,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:33:05,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994070213] [2022-12-11 19:33:05,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994070213] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:33:05,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:33:05,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-11 19:33:05,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328317223] [2022-12-11 19:33:05,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:33:05,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-11 19:33:05,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:33:05,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-11 19:33:05,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-11 19:33:05,828 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 172 [2022-12-11 19:33:05,831 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 159 transitions, 336 flow. Second operand has 8 states, 8 states have (on average 113.125) internal successors, (905), 8 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 19:33:05,831 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:33:05,832 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 172 [2022-12-11 19:33:05,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:33:06,209 INFO L130 PetriNetUnfolder]: 312/862 cut-off events. [2022-12-11 19:33:06,209 INFO L131 PetriNetUnfolder]: For 130/130 co-relation queries the response was YES. [2022-12-11 19:33:06,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1561 conditions, 862 events. 312/862 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4445 event pairs, 311 based on Foata normal form. 7/857 useless extension candidates. Maximal degree in co-relation 1307. Up to 559 conditions per place. [2022-12-11 19:33:06,220 INFO L137 encePairwiseOnDemand]: 155/172 looper letters, 51 selfloop transitions, 6 changer transitions 15/167 dead transitions. [2022-12-11 19:33:06,220 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 167 transitions, 496 flow [2022-12-11 19:33:06,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 19:33:06,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 19:33:06,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1152 transitions. [2022-12-11 19:33:06,236 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6697674418604651 [2022-12-11 19:33:06,238 INFO L175 Difference]: Start difference. First operand has 162 places, 159 transitions, 336 flow. Second operand 10 states and 1152 transitions. [2022-12-11 19:33:06,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 167 transitions, 496 flow [2022-12-11 19:33:06,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 167 transitions, 484 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-11 19:33:06,246 INFO L231 Difference]: Finished difference. Result has 169 places, 149 transitions, 328 flow [2022-12-11 19:33:06,248 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=328, PETRI_PLACES=169, PETRI_TRANSITIONS=149} [2022-12-11 19:33:06,252 INFO L295 CegarLoopForPetriNet]: 162 programPoint places, 7 predicate places. [2022-12-11 19:33:06,252 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 149 transitions, 328 flow [2022-12-11 19:33:06,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 113.125) internal successors, (905), 8 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 19:33:06,252 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:33:06,253 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:33:06,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-11 19:33:06,253 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 19:33:06,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:33:06,255 INFO L85 PathProgramCache]: Analyzing trace with hash 244304346, now seen corresponding path program 1 times [2022-12-11 19:33:06,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:33:06,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23765785] [2022-12-11 19:33:06,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:33:06,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:33:06,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:33:07,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 19:33:07,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:33:07,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23765785] [2022-12-11 19:33:07,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23765785] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 19:33:07,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551998411] [2022-12-11 19:33:07,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:33:07,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 19:33:07,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 19:33:07,211 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) [2022-12-11 19:33:07,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-11 19:33:07,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:33:07,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-11 19:33:07,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 19:33:07,982 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-12-11 19:33:07,983 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 20 [2022-12-11 19:33:08,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 19:33:08,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 19:33:08,250 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 19:33:08,250 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 36 [2022-12-11 19:33:08,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 19:33:08,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551998411] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 19:33:08,824 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 19:33:08,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 19] total 47 [2022-12-11 19:33:08,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659340693] [2022-12-11 19:33:08,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 19:33:08,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-12-11 19:33:08,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:33:08,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-12-11 19:33:08,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=1899, Unknown=0, NotChecked=0, Total=2162 [2022-12-11 19:33:08,832 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 172 [2022-12-11 19:33:08,836 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 149 transitions, 328 flow. Second operand has 47 states, 47 states have (on average 88.70212765957447) internal successors, (4169), 47 states have internal predecessors, (4169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 19:33:08,836 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:33:08,836 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 172 [2022-12-11 19:33:08,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:33:12,225 INFO L130 PetriNetUnfolder]: 2052/4396 cut-off events. [2022-12-11 19:33:12,226 INFO L131 PetriNetUnfolder]: For 70/70 co-relation queries the response was YES. [2022-12-11 19:33:12,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7873 conditions, 4396 events. 2052/4396 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 33303 event pairs, 906 based on Foata normal form. 2/4354 useless extension candidates. Maximal degree in co-relation 7759. Up to 1216 conditions per place. [2022-12-11 19:33:12,238 INFO L137 encePairwiseOnDemand]: 134/172 looper letters, 68 selfloop transitions, 16 changer transitions 246/403 dead transitions. [2022-12-11 19:33:12,238 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 403 transitions, 1542 flow [2022-12-11 19:33:12,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-12-11 19:33:12,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2022-12-11 19:33:12,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 4412 transitions. [2022-12-11 19:33:12,246 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5343992248062015 [2022-12-11 19:33:12,246 INFO L175 Difference]: Start difference. First operand has 169 places, 149 transitions, 328 flow. Second operand 48 states and 4412 transitions. [2022-12-11 19:33:12,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 403 transitions, 1542 flow [2022-12-11 19:33:12,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 403 transitions, 1520 flow, removed 6 selfloop flow, removed 7 redundant places. [2022-12-11 19:33:12,255 INFO L231 Difference]: Finished difference. Result has 237 places, 153 transitions, 521 flow [2022-12-11 19:33:12,256 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=48, PETRI_FLOW=521, PETRI_PLACES=237, PETRI_TRANSITIONS=153} [2022-12-11 19:33:12,256 INFO L295 CegarLoopForPetriNet]: 162 programPoint places, 75 predicate places. [2022-12-11 19:33:12,257 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 153 transitions, 521 flow [2022-12-11 19:33:12,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 88.70212765957447) internal successors, (4169), 47 states have internal predecessors, (4169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 19:33:12,259 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:33:12,260 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:33:12,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-11 19:33:12,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 19:33:12,467 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 19:33:12,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:33:12,468 INFO L85 PathProgramCache]: Analyzing trace with hash -126895009, now seen corresponding path program 2 times [2022-12-11 19:33:12,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:33:12,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985609202] [2022-12-11 19:33:12,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:33:12,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:33:12,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:33:12,628 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-11 19:33:12,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:33:12,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985609202] [2022-12-11 19:33:12,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985609202] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:33:12,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:33:12,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 19:33:12,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549925560] [2022-12-11 19:33:12,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:33:12,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 19:33:12,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:33:12,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 19:33:12,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 19:33:12,630 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 172 [2022-12-11 19:33:12,631 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 153 transitions, 521 flow. Second operand has 7 states, 7 states have (on average 138.42857142857142) internal successors, (969), 7 states have internal predecessors, (969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 19:33:12,631 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:33:12,631 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 172 [2022-12-11 19:33:12,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:33:13,046 INFO L130 PetriNetUnfolder]: 1194/2589 cut-off events. [2022-12-11 19:33:13,046 INFO L131 PetriNetUnfolder]: For 19355/19559 co-relation queries the response was YES. [2022-12-11 19:33:13,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10950 conditions, 2589 events. 1194/2589 cut-off events. For 19355/19559 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 17618 event pairs, 368 based on Foata normal form. 32/2546 useless extension candidates. Maximal degree in co-relation 10899. Up to 651 conditions per place. [2022-12-11 19:33:13,107 INFO L137 encePairwiseOnDemand]: 162/172 looper letters, 93 selfloop transitions, 18 changer transitions 0/233 dead transitions. [2022-12-11 19:33:13,107 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 233 transitions, 1343 flow [2022-12-11 19:33:13,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-11 19:33:13,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-11 19:33:13,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1318 transitions. [2022-12-11 19:33:13,110 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.851421188630491 [2022-12-11 19:33:13,110 INFO L175 Difference]: Start difference. First operand has 237 places, 153 transitions, 521 flow. Second operand 9 states and 1318 transitions. [2022-12-11 19:33:13,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 233 transitions, 1343 flow [2022-12-11 19:33:13,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 233 transitions, 1026 flow, removed 149 selfloop flow, removed 34 redundant places. [2022-12-11 19:33:13,137 INFO L231 Difference]: Finished difference. Result has 183 places, 167 transitions, 514 flow [2022-12-11 19:33:13,138 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=514, PETRI_PLACES=183, PETRI_TRANSITIONS=167} [2022-12-11 19:33:13,139 INFO L295 CegarLoopForPetriNet]: 162 programPoint places, 21 predicate places. [2022-12-11 19:33:13,139 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 167 transitions, 514 flow [2022-12-11 19:33:13,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 138.42857142857142) internal successors, (969), 7 states have internal predecessors, (969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 19:33:13,139 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:33:13,140 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:33:13,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-11 19:33:13,140 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 19:33:13,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:33:13,140 INFO L85 PathProgramCache]: Analyzing trace with hash -730768185, now seen corresponding path program 3 times [2022-12-11 19:33:13,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:33:13,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649648938] [2022-12-11 19:33:13,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:33:13,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:33:13,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:33:13,271 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-11 19:33:13,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:33:13,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649648938] [2022-12-11 19:33:13,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649648938] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:33:13,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:33:13,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-11 19:33:13,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813230352] [2022-12-11 19:33:13,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:33:13,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-11 19:33:13,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:33:13,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-11 19:33:13,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-11 19:33:13,274 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 172 [2022-12-11 19:33:13,275 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 167 transitions, 514 flow. Second operand has 3 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 19:33:13,275 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:33:13,275 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 172 [2022-12-11 19:33:13,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:33:13,496 INFO L130 PetriNetUnfolder]: 821/2094 cut-off events. [2022-12-11 19:33:13,496 INFO L131 PetriNetUnfolder]: For 4321/4421 co-relation queries the response was YES. [2022-12-11 19:33:13,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6552 conditions, 2094 events. 821/2094 cut-off events. For 4321/4421 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 14834 event pairs, 702 based on Foata normal form. 15/2038 useless extension candidates. Maximal degree in co-relation 6435. Up to 1198 conditions per place. [2022-12-11 19:33:13,512 INFO L137 encePairwiseOnDemand]: 169/172 looper letters, 27 selfloop transitions, 2 changer transitions 0/175 dead transitions. [2022-12-11 19:33:13,513 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 175 transitions, 622 flow [2022-12-11 19:33:13,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-11 19:33:13,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-11 19:33:13,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 462 transitions. [2022-12-11 19:33:13,514 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8953488372093024 [2022-12-11 19:33:13,514 INFO L175 Difference]: Start difference. First operand has 183 places, 167 transitions, 514 flow. Second operand 3 states and 462 transitions. [2022-12-11 19:33:13,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 175 transitions, 622 flow [2022-12-11 19:33:13,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 175 transitions, 608 flow, removed 7 selfloop flow, removed 2 redundant places. [2022-12-11 19:33:13,521 INFO L231 Difference]: Finished difference. Result has 184 places, 167 transitions, 512 flow [2022-12-11 19:33:13,521 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=512, PETRI_PLACES=184, PETRI_TRANSITIONS=167} [2022-12-11 19:33:13,522 INFO L295 CegarLoopForPetriNet]: 162 programPoint places, 22 predicate places. [2022-12-11 19:33:13,523 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 167 transitions, 512 flow [2022-12-11 19:33:13,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 19:33:13,523 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:33:13,524 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:33:13,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-11 19:33:13,524 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 19:33:13,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:33:13,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1005911067, now seen corresponding path program 4 times [2022-12-11 19:33:13,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:33:13,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146790159] [2022-12-11 19:33:13,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:33:13,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:33:13,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:33:16,428 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 19:33:16,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:33:16,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146790159] [2022-12-11 19:33:16,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146790159] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 19:33:16,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108729951] [2022-12-11 19:33:16,428 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-11 19:33:16,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 19:33:16,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 19:33:16,430 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) [2022-12-11 19:33:16,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-11 19:33:16,521 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-11 19:33:16,522 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 19:33:16,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 44 conjunts are in the unsatisfiable core [2022-12-11 19:33:16,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 19:33:17,365 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 19:33:17,365 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2022-12-11 19:33:17,386 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 19:33:17,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 19:33:17,575 INFO L321 Elim1Store]: treesize reduction 10, result has 85.5 percent of original size [2022-12-11 19:33:17,575 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 78 [2022-12-11 19:33:17,880 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-11 19:33:17,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108729951] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-11 19:33:17,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-11 19:33:17,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [34, 24] total 62 [2022-12-11 19:33:17,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284604695] [2022-12-11 19:33:17,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:33:17,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-11 19:33:17,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:33:17,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-11 19:33:17,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=3512, Unknown=0, NotChecked=0, Total=3782 [2022-12-11 19:33:17,888 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 172 [2022-12-11 19:33:17,889 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 167 transitions, 512 flow. Second operand has 15 states, 15 states have (on average 103.06666666666666) internal successors, (1546), 15 states have internal predecessors, (1546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 19:33:17,889 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:33:17,890 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 172 [2022-12-11 19:33:17,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:33:19,084 INFO L130 PetriNetUnfolder]: 3495/7347 cut-off events. [2022-12-11 19:33:19,084 INFO L131 PetriNetUnfolder]: For 10427/10518 co-relation queries the response was YES. [2022-12-11 19:33:19,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22656 conditions, 7347 events. 3495/7347 cut-off events. For 10427/10518 co-relation queries the response was YES. Maximal size of possible extension queue 449. Compared 62328 event pairs, 772 based on Foata normal form. 2/7204 useless extension candidates. Maximal degree in co-relation 22516. Up to 2648 conditions per place. [2022-12-11 19:33:19,188 INFO L137 encePairwiseOnDemand]: 156/172 looper letters, 141 selfloop transitions, 40 changer transitions 8/295 dead transitions. [2022-12-11 19:33:19,188 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 295 transitions, 1518 flow [2022-12-11 19:33:19,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-11 19:33:19,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-11 19:33:19,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1774 transitions. [2022-12-11 19:33:19,194 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6446220930232558 [2022-12-11 19:33:19,194 INFO L175 Difference]: Start difference. First operand has 184 places, 167 transitions, 512 flow. Second operand 16 states and 1774 transitions. [2022-12-11 19:33:19,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 295 transitions, 1518 flow [2022-12-11 19:33:19,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 295 transitions, 1514 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-11 19:33:19,207 INFO L231 Difference]: Finished difference. Result has 203 places, 207 transitions, 919 flow [2022-12-11 19:33:19,207 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=919, PETRI_PLACES=203, PETRI_TRANSITIONS=207} [2022-12-11 19:33:19,208 INFO L295 CegarLoopForPetriNet]: 162 programPoint places, 41 predicate places. [2022-12-11 19:33:19,209 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 207 transitions, 919 flow [2022-12-11 19:33:19,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 103.06666666666666) internal successors, (1546), 15 states have internal predecessors, (1546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 19:33:19,209 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:33:19,209 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:33:19,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-11 19:33:19,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 19:33:19,410 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 19:33:19,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:33:19,411 INFO L85 PathProgramCache]: Analyzing trace with hash 2141898509, now seen corresponding path program 5 times [2022-12-11 19:33:19,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:33:19,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040786345] [2022-12-11 19:33:19,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:33:19,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:33:19,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:33:21,725 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 19:33:21,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:33:21,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040786345] [2022-12-11 19:33:21,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040786345] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 19:33:21,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903549557] [2022-12-11 19:33:21,726 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-11 19:33:21,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 19:33:21,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 19:33:21,728 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) [2022-12-11 19:33:21,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-11 19:33:21,843 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-11 19:33:21,843 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 19:33:21,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-11 19:33:21,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 19:33:22,272 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 19:33:22,273 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2022-12-11 19:33:22,291 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-11 19:33:22,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 19:33:22,477 INFO L321 Elim1Store]: treesize reduction 10, result has 85.5 percent of original size [2022-12-11 19:33:22,477 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 78 [2022-12-11 19:33:22,629 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-11 19:33:22,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903549557] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-11 19:33:22,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-11 19:33:22,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [32, 15] total 48 [2022-12-11 19:33:22,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705980325] [2022-12-11 19:33:22,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:33:22,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-11 19:33:22,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:33:22,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-11 19:33:22,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=2086, Unknown=0, NotChecked=0, Total=2256 [2022-12-11 19:33:22,632 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 172 [2022-12-11 19:33:22,633 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 207 transitions, 919 flow. Second operand has 12 states, 12 states have (on average 106.83333333333333) internal successors, (1282), 12 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 19:33:22,633 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:33:22,633 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 172 [2022-12-11 19:33:22,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:33:24,140 INFO L130 PetriNetUnfolder]: 4270/9174 cut-off events. [2022-12-11 19:33:24,140 INFO L131 PetriNetUnfolder]: For 17600/17715 co-relation queries the response was YES. [2022-12-11 19:33:24,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31810 conditions, 9174 events. 4270/9174 cut-off events. For 17600/17715 co-relation queries the response was YES. Maximal size of possible extension queue 566. Compared 82160 event pairs, 683 based on Foata normal form. 8/9030 useless extension candidates. Maximal degree in co-relation 31763. Up to 2824 conditions per place. [2022-12-11 19:33:24,203 INFO L137 encePairwiseOnDemand]: 158/172 looper letters, 188 selfloop transitions, 50 changer transitions 13/360 dead transitions. [2022-12-11 19:33:24,203 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 360 transitions, 2157 flow [2022-12-11 19:33:24,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-11 19:33:24,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-11 19:33:24,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 2493 transitions. [2022-12-11 19:33:24,207 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6588266384778013 [2022-12-11 19:33:24,207 INFO L175 Difference]: Start difference. First operand has 203 places, 207 transitions, 919 flow. Second operand 22 states and 2493 transitions. [2022-12-11 19:33:24,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 360 transitions, 2157 flow [2022-12-11 19:33:24,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 360 transitions, 2071 flow, removed 40 selfloop flow, removed 5 redundant places. [2022-12-11 19:33:24,324 INFO L231 Difference]: Finished difference. Result has 223 places, 220 transitions, 1093 flow [2022-12-11 19:33:24,325 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=849, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1093, PETRI_PLACES=223, PETRI_TRANSITIONS=220} [2022-12-11 19:33:24,327 INFO L295 CegarLoopForPetriNet]: 162 programPoint places, 61 predicate places. [2022-12-11 19:33:24,327 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 220 transitions, 1093 flow [2022-12-11 19:33:24,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 106.83333333333333) internal successors, (1282), 12 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 19:33:24,328 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:33:24,328 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:33:24,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-11 19:33:24,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 19:33:24,534 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 19:33:24,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:33:24,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1560230519, now seen corresponding path program 6 times [2022-12-11 19:33:24,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:33:24,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384902398] [2022-12-11 19:33:24,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:33:24,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:33:24,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:33:25,478 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 19:33:25,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:33:25,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384902398] [2022-12-11 19:33:25,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384902398] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 19:33:25,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999603922] [2022-12-11 19:33:25,479 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-11 19:33:25,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 19:33:25,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 19:33:25,480 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) [2022-12-11 19:33:25,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-11 19:33:25,582 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-12-11 19:33:25,582 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 19:33:25,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-11 19:33:25,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 19:33:25,850 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 19:33:25,851 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2022-12-11 19:33:25,867 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-11 19:33:25,867 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-11 19:33:25,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999603922] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:33:25,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-11 19:33:25,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [27] total 35 [2022-12-11 19:33:25,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821563868] [2022-12-11 19:33:25,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:33:25,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-11 19:33:25,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:33:25,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-11 19:33:25,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1097, Unknown=0, NotChecked=0, Total=1190 [2022-12-11 19:33:25,870 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 172 [2022-12-11 19:33:25,870 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 220 transitions, 1093 flow. Second operand has 13 states, 13 states have (on average 102.76923076923077) internal successors, (1336), 13 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 19:33:25,871 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:33:25,871 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 172 [2022-12-11 19:33:25,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:33:27,304 INFO L130 PetriNetUnfolder]: 4376/9798 cut-off events. [2022-12-11 19:33:27,305 INFO L131 PetriNetUnfolder]: For 23012/23127 co-relation queries the response was YES. [2022-12-11 19:33:27,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35125 conditions, 9798 events. 4376/9798 cut-off events. For 23012/23127 co-relation queries the response was YES. Maximal size of possible extension queue 631. Compared 92067 event pairs, 978 based on Foata normal form. 8/9594 useless extension candidates. Maximal degree in co-relation 35063. Up to 4436 conditions per place. [2022-12-11 19:33:27,368 INFO L137 encePairwiseOnDemand]: 154/172 looper letters, 147 selfloop transitions, 40 changer transitions 10/302 dead transitions. [2022-12-11 19:33:27,368 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 302 transitions, 1877 flow [2022-12-11 19:33:27,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-11 19:33:27,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-11 19:33:27,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1828 transitions. [2022-12-11 19:33:27,370 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.625170998632011 [2022-12-11 19:33:27,370 INFO L175 Difference]: Start difference. First operand has 223 places, 220 transitions, 1093 flow. Second operand 17 states and 1828 transitions. [2022-12-11 19:33:27,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 302 transitions, 1877 flow [2022-12-11 19:33:27,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 302 transitions, 1766 flow, removed 32 selfloop flow, removed 11 redundant places. [2022-12-11 19:33:27,421 INFO L231 Difference]: Finished difference. Result has 232 places, 227 transitions, 1190 flow [2022-12-11 19:33:27,422 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=991, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1190, PETRI_PLACES=232, PETRI_TRANSITIONS=227} [2022-12-11 19:33:27,422 INFO L295 CegarLoopForPetriNet]: 162 programPoint places, 70 predicate places. [2022-12-11 19:33:27,422 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 227 transitions, 1190 flow [2022-12-11 19:33:27,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 102.76923076923077) internal successors, (1336), 13 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 19:33:27,423 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:33:27,423 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:33:27,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-11 19:33:27,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 19:33:27,640 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 19:33:27,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:33:27,640 INFO L85 PathProgramCache]: Analyzing trace with hash 566648171, now seen corresponding path program 7 times [2022-12-11 19:33:27,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:33:27,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406959794] [2022-12-11 19:33:27,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:33:27,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:33:27,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:33:29,514 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 19:33:29,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:33:29,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406959794] [2022-12-11 19:33:29,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406959794] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 19:33:29,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978957888] [2022-12-11 19:33:29,515 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-11 19:33:29,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 19:33:29,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 19:33:29,516 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) [2022-12-11 19:33:29,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-11 19:33:29,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:33:29,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 54 conjunts are in the unsatisfiable core [2022-12-11 19:33:29,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 19:33:30,583 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 19:33:30,583 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 32 [2022-12-11 19:33:30,598 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 19:33:30,598 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 19:33:30,895 INFO L321 Elim1Store]: treesize reduction 10, result has 85.5 percent of original size [2022-12-11 19:33:30,895 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 80 treesize of output 90 [2022-12-11 19:33:31,233 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-11 19:33:31,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1978957888] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-11 19:33:31,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-11 19:33:31,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [33, 26] total 65 [2022-12-11 19:33:31,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060916603] [2022-12-11 19:33:31,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:33:31,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-11 19:33:31,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:33:31,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-11 19:33:31,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=3856, Unknown=0, NotChecked=0, Total=4160 [2022-12-11 19:33:31,236 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 172 [2022-12-11 19:33:31,237 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 227 transitions, 1190 flow. Second operand has 18 states, 18 states have (on average 102.38888888888889) internal successors, (1843), 18 states have internal predecessors, (1843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 19:33:31,237 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:33:31,237 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 172 [2022-12-11 19:33:31,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:33:32,919 INFO L130 PetriNetUnfolder]: 4676/10777 cut-off events. [2022-12-11 19:33:32,919 INFO L131 PetriNetUnfolder]: For 27007/27122 co-relation queries the response was YES. [2022-12-11 19:33:32,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39012 conditions, 10777 events. 4676/10777 cut-off events. For 27007/27122 co-relation queries the response was YES. Maximal size of possible extension queue 698. Compared 105027 event pairs, 1124 based on Foata normal form. 10/10542 useless extension candidates. Maximal degree in co-relation 38945. Up to 5644 conditions per place. [2022-12-11 19:33:32,997 INFO L137 encePairwiseOnDemand]: 151/172 looper letters, 160 selfloop transitions, 51 changer transitions 12/329 dead transitions. [2022-12-11 19:33:32,997 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 329 transitions, 2177 flow [2022-12-11 19:33:32,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-11 19:33:32,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-11 19:33:32,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1960 transitions. [2022-12-11 19:33:32,999 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6330749354005168 [2022-12-11 19:33:33,000 INFO L175 Difference]: Start difference. First operand has 232 places, 227 transitions, 1190 flow. Second operand 18 states and 1960 transitions. [2022-12-11 19:33:33,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 329 transitions, 2177 flow [2022-12-11 19:33:33,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 329 transitions, 2127 flow, removed 16 selfloop flow, removed 8 redundant places. [2022-12-11 19:33:33,065 INFO L231 Difference]: Finished difference. Result has 247 places, 248 transitions, 1533 flow [2022-12-11 19:33:33,065 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=1142, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1533, PETRI_PLACES=247, PETRI_TRANSITIONS=248} [2022-12-11 19:33:33,066 INFO L295 CegarLoopForPetriNet]: 162 programPoint places, 85 predicate places. [2022-12-11 19:33:33,067 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 248 transitions, 1533 flow [2022-12-11 19:33:33,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 102.38888888888889) internal successors, (1843), 18 states have internal predecessors, (1843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 19:33:33,067 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:33:33,068 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:33:33,072 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-11 19:33:33,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 19:33:33,273 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 19:33:33,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:33:33,273 INFO L85 PathProgramCache]: Analyzing trace with hash -190260523, now seen corresponding path program 8 times [2022-12-11 19:33:33,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:33:33,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922591854] [2022-12-11 19:33:33,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:33:33,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:33:33,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:33:34,322 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 19:33:34,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:33:34,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922591854] [2022-12-11 19:33:34,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922591854] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 19:33:34,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828089671] [2022-12-11 19:33:34,323 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-11 19:33:34,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 19:33:34,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 19:33:34,324 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) [2022-12-11 19:33:34,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-11 19:33:34,457 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-11 19:33:34,457 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 19:33:34,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-11 19:33:34,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 19:33:34,702 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 19:33:34,703 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2022-12-11 19:33:34,726 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-11 19:33:34,726 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-11 19:33:34,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828089671] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:33:34,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-11 19:33:34,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [28] total 35 [2022-12-11 19:33:34,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307206142] [2022-12-11 19:33:34,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:33:34,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-11 19:33:34,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:33:34,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-11 19:33:34,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1101, Unknown=0, NotChecked=0, Total=1190 [2022-12-11 19:33:34,728 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 172 [2022-12-11 19:33:34,729 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 248 transitions, 1533 flow. Second operand has 12 states, 12 states have (on average 106.83333333333333) internal successors, (1282), 12 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 19:33:34,729 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:33:34,729 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 172 [2022-12-11 19:33:34,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:33:36,367 INFO L130 PetriNetUnfolder]: 4811/10664 cut-off events. [2022-12-11 19:33:36,367 INFO L131 PetriNetUnfolder]: For 40628/40760 co-relation queries the response was YES. [2022-12-11 19:33:36,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43817 conditions, 10664 events. 4811/10664 cut-off events. For 40628/40760 co-relation queries the response was YES. Maximal size of possible extension queue 722. Compared 101017 event pairs, 1673 based on Foata normal form. 10/10471 useless extension candidates. Maximal degree in co-relation 43743. Up to 5075 conditions per place. [2022-12-11 19:33:36,438 INFO L137 encePairwiseOnDemand]: 156/172 looper letters, 146 selfloop transitions, 60 changer transitions 10/325 dead transitions. [2022-12-11 19:33:36,439 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 325 transitions, 2431 flow [2022-12-11 19:33:36,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-11 19:33:36,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-11 19:33:36,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1682 transitions. [2022-12-11 19:33:36,441 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6519379844961241 [2022-12-11 19:33:36,441 INFO L175 Difference]: Start difference. First operand has 247 places, 248 transitions, 1533 flow. Second operand 15 states and 1682 transitions. [2022-12-11 19:33:36,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 325 transitions, 2431 flow [2022-12-11 19:33:36,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 325 transitions, 2269 flow, removed 56 selfloop flow, removed 8 redundant places. [2022-12-11 19:33:36,552 INFO L231 Difference]: Finished difference. Result has 257 places, 258 transitions, 1717 flow [2022-12-11 19:33:36,553 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=1403, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1717, PETRI_PLACES=257, PETRI_TRANSITIONS=258} [2022-12-11 19:33:36,553 INFO L295 CegarLoopForPetriNet]: 162 programPoint places, 95 predicate places. [2022-12-11 19:33:36,553 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 258 transitions, 1717 flow [2022-12-11 19:33:36,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 106.83333333333333) internal successors, (1282), 12 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 19:33:36,554 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:33:36,554 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:33:36,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-11 19:33:36,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 19:33:36,759 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 19:33:36,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:33:36,759 INFO L85 PathProgramCache]: Analyzing trace with hash 494051335, now seen corresponding path program 9 times [2022-12-11 19:33:36,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:33:36,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564391815] [2022-12-11 19:33:36,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:33:36,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:33:36,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:33:38,743 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 19:33:38,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:33:38,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564391815] [2022-12-11 19:33:38,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564391815] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 19:33:38,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416920553] [2022-12-11 19:33:38,744 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-11 19:33:38,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 19:33:38,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 19:33:38,746 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) [2022-12-11 19:33:38,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-11 19:33:38,874 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-11 19:33:38,874 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 19:33:38,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-11 19:33:38,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 19:33:39,199 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 19:33:39,199 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2022-12-11 19:33:39,209 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-11 19:33:39,209 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-11 19:33:39,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416920553] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:33:39,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-11 19:33:39,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [33] total 40 [2022-12-11 19:33:39,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290391921] [2022-12-11 19:33:39,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:33:39,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-11 19:33:39,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:33:39,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-11 19:33:39,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1455, Unknown=0, NotChecked=0, Total=1560 [2022-12-11 19:33:39,212 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 172 [2022-12-11 19:33:39,212 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 258 transitions, 1717 flow. Second operand has 12 states, 12 states have (on average 106.83333333333333) internal successors, (1282), 12 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 19:33:39,213 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:33:39,213 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 172 [2022-12-11 19:33:39,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:33:40,931 INFO L130 PetriNetUnfolder]: 4978/11126 cut-off events. [2022-12-11 19:33:40,931 INFO L131 PetriNetUnfolder]: For 47818/47930 co-relation queries the response was YES. [2022-12-11 19:33:40,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46814 conditions, 11126 events. 4978/11126 cut-off events. For 47818/47930 co-relation queries the response was YES. Maximal size of possible extension queue 756. Compared 106630 event pairs, 1680 based on Foata normal form. 10/10894 useless extension candidates. Maximal degree in co-relation 46735. Up to 4980 conditions per place. [2022-12-11 19:33:41,012 INFO L137 encePairwiseOnDemand]: 156/172 looper letters, 154 selfloop transitions, 65 changer transitions 13/341 dead transitions. [2022-12-11 19:33:41,013 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 341 transitions, 2616 flow [2022-12-11 19:33:41,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-11 19:33:41,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-11 19:33:41,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1902 transitions. [2022-12-11 19:33:41,015 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6504787961696307 [2022-12-11 19:33:41,015 INFO L175 Difference]: Start difference. First operand has 257 places, 258 transitions, 1717 flow. Second operand 17 states and 1902 transitions. [2022-12-11 19:33:41,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 341 transitions, 2616 flow [2022-12-11 19:33:41,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 341 transitions, 2479 flow, removed 26 selfloop flow, removed 10 redundant places. [2022-12-11 19:33:41,140 INFO L231 Difference]: Finished difference. Result has 265 places, 261 transitions, 1792 flow [2022-12-11 19:33:41,140 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=1586, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1792, PETRI_PLACES=265, PETRI_TRANSITIONS=261} [2022-12-11 19:33:41,140 INFO L295 CegarLoopForPetriNet]: 162 programPoint places, 103 predicate places. [2022-12-11 19:33:41,140 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 261 transitions, 1792 flow [2022-12-11 19:33:41,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 106.83333333333333) internal successors, (1282), 12 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 19:33:41,141 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:33:41,141 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:33:41,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-11 19:33:41,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 19:33:41,347 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 19:33:41,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:33:41,347 INFO L85 PathProgramCache]: Analyzing trace with hash -506956491, now seen corresponding path program 10 times [2022-12-11 19:33:41,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:33:41,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444382288] [2022-12-11 19:33:41,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:33:41,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:33:41,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:33:44,440 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 19:33:44,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:33:44,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444382288] [2022-12-11 19:33:44,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444382288] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 19:33:44,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755583636] [2022-12-11 19:33:44,441 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-11 19:33:44,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 19:33:44,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 19:33:44,442 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) [2022-12-11 19:33:44,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-11 19:33:44,522 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-11 19:33:44,522 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 19:33:44,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 54 conjunts are in the unsatisfiable core [2022-12-11 19:33:44,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 19:33:45,722 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 19:33:45,722 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 32 [2022-12-11 19:33:45,740 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 19:33:45,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 19:33:46,108 INFO L321 Elim1Store]: treesize reduction 10, result has 85.5 percent of original size [2022-12-11 19:33:46,109 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 80 treesize of output 90 [2022-12-11 19:33:46,750 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-11 19:33:46,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755583636] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-11 19:33:46,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-11 19:33:46,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [40, 26] total 74 [2022-12-11 19:33:46,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816753089] [2022-12-11 19:33:46,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:33:46,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-11 19:33:46,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:33:46,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-11 19:33:46,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=340, Invalid=5062, Unknown=0, NotChecked=0, Total=5402 [2022-12-11 19:33:46,753 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 172 [2022-12-11 19:33:46,754 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 261 transitions, 1792 flow. Second operand has 18 states, 18 states have (on average 102.38888888888889) internal successors, (1843), 18 states have internal predecessors, (1843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 19:33:46,754 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:33:46,754 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 172 [2022-12-11 19:33:46,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:33:48,921 INFO L130 PetriNetUnfolder]: 5053/12022 cut-off events. [2022-12-11 19:33:48,922 INFO L131 PetriNetUnfolder]: For 48819/48926 co-relation queries the response was YES. [2022-12-11 19:33:48,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48843 conditions, 12022 events. 5053/12022 cut-off events. For 48819/48926 co-relation queries the response was YES. Maximal size of possible extension queue 800. Compared 122228 event pairs, 1254 based on Foata normal form. 14/11758 useless extension candidates. Maximal degree in co-relation 48762. Up to 6072 conditions per place. [2022-12-11 19:33:49,011 INFO L137 encePairwiseOnDemand]: 151/172 looper letters, 128 selfloop transitions, 49 changer transitions 67/350 dead transitions. [2022-12-11 19:33:49,011 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 350 transitions, 2669 flow [2022-12-11 19:33:49,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-11 19:33:49,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-11 19:33:49,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2066 transitions. [2022-12-11 19:33:49,013 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6321909424724602 [2022-12-11 19:33:49,013 INFO L175 Difference]: Start difference. First operand has 265 places, 261 transitions, 1792 flow. Second operand 19 states and 2066 transitions. [2022-12-11 19:33:49,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 350 transitions, 2669 flow [2022-12-11 19:33:49,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 350 transitions, 2550 flow, removed 10 selfloop flow, removed 14 redundant places. [2022-12-11 19:33:49,130 INFO L231 Difference]: Finished difference. Result has 272 places, 242 transitions, 1549 flow [2022-12-11 19:33:49,130 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=1677, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1549, PETRI_PLACES=272, PETRI_TRANSITIONS=242} [2022-12-11 19:33:49,131 INFO L295 CegarLoopForPetriNet]: 162 programPoint places, 110 predicate places. [2022-12-11 19:33:49,131 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 242 transitions, 1549 flow [2022-12-11 19:33:49,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 102.38888888888889) internal successors, (1843), 18 states have internal predecessors, (1843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 19:33:49,131 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:33:49,131 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:33:49,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-11 19:33:49,336 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,SelfDestructingSolverStorable10 [2022-12-11 19:33:49,336 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 19:33:49,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:33:49,337 INFO L85 PathProgramCache]: Analyzing trace with hash 357381589, now seen corresponding path program 11 times [2022-12-11 19:33:49,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:33:49,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302454925] [2022-12-11 19:33:49,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:33:49,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:33:49,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:33:52,551 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 19:33:52,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:33:52,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302454925] [2022-12-11 19:33:52,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302454925] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 19:33:52,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352538824] [2022-12-11 19:33:52,551 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-11 19:33:52,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 19:33:52,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 19:33:52,553 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) [2022-12-11 19:33:52,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-11 19:33:52,646 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-11 19:33:52,647 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 19:33:52,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 46 conjunts are in the unsatisfiable core [2022-12-11 19:33:52,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 19:33:52,656 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 [2022-12-11 19:33:52,717 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-11 19:33:52,717 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 [2022-12-11 19:33:53,164 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 18 treesize of output 20 [2022-12-11 19:33:53,357 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 19:33:53,358 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2022-12-11 19:33:53,375 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-11 19:33:53,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 19:33:53,552 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_372 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_372) c_~f~0.base))) (= (select .cse0 (+ c_~f~0.offset (* (select .cse0 (+ c_~f~0.offset (* c_~j~0 4))) 4))) (select .cse0 (+ c_~f~0.offset (* c_~i~0 4)))))) is different from false [2022-12-11 19:33:53,626 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 19:33:53,626 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 118 [2022-12-11 19:33:53,640 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 19:33:53,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 64 [2022-12-11 19:33:54,017 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-11 19:33:54,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352538824] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-11 19:33:54,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-11 19:33:54,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [38, 22] total 64 [2022-12-11 19:33:54,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955208440] [2022-12-11 19:33:54,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:33:54,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-11 19:33:54,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:33:54,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-11 19:33:54,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=3658, Unknown=1, NotChecked=122, Total=4032 [2022-12-11 19:33:54,020 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 172 [2022-12-11 19:33:54,021 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 242 transitions, 1549 flow. Second operand has 20 states, 20 states have (on average 86.65) internal successors, (1733), 20 states have internal predecessors, (1733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 19:33:54,021 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:33:54,021 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 172 [2022-12-11 19:33:54,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:33:56,693 INFO L130 PetriNetUnfolder]: 5746/12728 cut-off events. [2022-12-11 19:33:56,694 INFO L131 PetriNetUnfolder]: For 63509/63622 co-relation queries the response was YES. [2022-12-11 19:33:56,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54622 conditions, 12728 events. 5746/12728 cut-off events. For 63509/63622 co-relation queries the response was YES. Maximal size of possible extension queue 908. Compared 124497 event pairs, 727 based on Foata normal form. 13/12477 useless extension candidates. Maximal degree in co-relation 54529. Up to 3618 conditions per place. [2022-12-11 19:33:56,803 INFO L137 encePairwiseOnDemand]: 142/172 looper letters, 199 selfloop transitions, 96 changer transitions 7/396 dead transitions. [2022-12-11 19:33:56,803 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 396 transitions, 3320 flow [2022-12-11 19:33:56,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-11 19:33:56,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-12-11 19:33:56,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 2473 transitions. [2022-12-11 19:33:56,811 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5325150732127476 [2022-12-11 19:33:56,811 INFO L175 Difference]: Start difference. First operand has 272 places, 242 transitions, 1549 flow. Second operand 27 states and 2473 transitions. [2022-12-11 19:33:56,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 396 transitions, 3320 flow [2022-12-11 19:33:57,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 396 transitions, 2949 flow, removed 74 selfloop flow, removed 25 redundant places. [2022-12-11 19:33:57,181 INFO L231 Difference]: Finished difference. Result has 264 places, 289 transitions, 2149 flow [2022-12-11 19:33:57,182 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=1341, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=2149, PETRI_PLACES=264, PETRI_TRANSITIONS=289} [2022-12-11 19:33:57,182 INFO L295 CegarLoopForPetriNet]: 162 programPoint places, 102 predicate places. [2022-12-11 19:33:57,182 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 289 transitions, 2149 flow [2022-12-11 19:33:57,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 86.65) internal successors, (1733), 20 states have internal predecessors, (1733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 19:33:57,183 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:33:57,183 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:33:57,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-11 19:33:57,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 19:33:57,383 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 19:33:57,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:33:57,384 INFO L85 PathProgramCache]: Analyzing trace with hash 547529111, now seen corresponding path program 12 times [2022-12-11 19:33:57,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:33:57,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749817474] [2022-12-11 19:33:57,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:33:57,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:33:57,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:34:01,149 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 19:34:01,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:34:01,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749817474] [2022-12-11 19:34:01,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749817474] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 19:34:01,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421939649] [2022-12-11 19:34:01,150 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-11 19:34:01,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 19:34:01,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 19:34:01,151 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 19:34:01,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-11 19:34:01,280 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-12-11 19:34:01,280 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 19:34:01,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-11 19:34:01,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 19:34:01,294 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 [2022-12-11 19:34:01,352 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-11 19:34:01,353 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 [2022-12-11 19:34:01,779 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 18 treesize of output 20 [2022-12-11 19:34:01,963 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 19:34:01,963 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2022-12-11 19:34:01,977 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-11 19:34:01,977 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-11 19:34:01,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1421939649] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:34:01,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-11 19:34:01,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [40] total 55 [2022-12-11 19:34:01,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37938124] [2022-12-11 19:34:01,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:34:01,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-11 19:34:01,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:34:01,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-11 19:34:01,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=2778, Unknown=0, NotChecked=0, Total=2970 [2022-12-11 19:34:01,980 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 172 [2022-12-11 19:34:01,981 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 289 transitions, 2149 flow. Second operand has 20 states, 20 states have (on average 86.65) internal successors, (1733), 20 states have internal predecessors, (1733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 19:34:01,981 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:34:01,981 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 172 [2022-12-11 19:34:01,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:34:04,793 INFO L130 PetriNetUnfolder]: 6153/14101 cut-off events. [2022-12-11 19:34:04,793 INFO L131 PetriNetUnfolder]: For 70275/70832 co-relation queries the response was YES. [2022-12-11 19:34:04,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63740 conditions, 14101 events. 6153/14101 cut-off events. For 70275/70832 co-relation queries the response was YES. Maximal size of possible extension queue 995. Compared 144568 event pairs, 1430 based on Foata normal form. 128/13938 useless extension candidates. Maximal degree in co-relation 63643. Up to 5774 conditions per place. [2022-12-11 19:34:04,906 INFO L137 encePairwiseOnDemand]: 149/172 looper letters, 206 selfloop transitions, 66 changer transitions 33/399 dead transitions. [2022-12-11 19:34:04,907 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 399 transitions, 3543 flow [2022-12-11 19:34:04,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-11 19:34:04,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-12-11 19:34:04,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 2444 transitions. [2022-12-11 19:34:04,909 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5262704565030146 [2022-12-11 19:34:04,909 INFO L175 Difference]: Start difference. First operand has 264 places, 289 transitions, 2149 flow. Second operand 27 states and 2444 transitions. [2022-12-11 19:34:04,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 399 transitions, 3543 flow [2022-12-11 19:34:05,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 399 transitions, 3357 flow, removed 76 selfloop flow, removed 14 redundant places. [2022-12-11 19:34:05,413 INFO L231 Difference]: Finished difference. Result has 281 places, 290 transitions, 2166 flow [2022-12-11 19:34:05,414 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=1981, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=2166, PETRI_PLACES=281, PETRI_TRANSITIONS=290} [2022-12-11 19:34:05,414 INFO L295 CegarLoopForPetriNet]: 162 programPoint places, 119 predicate places. [2022-12-11 19:34:05,414 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 290 transitions, 2166 flow [2022-12-11 19:34:05,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 86.65) internal successors, (1733), 20 states have internal predecessors, (1733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 19:34:05,415 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:34:05,415 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:34:05,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-11 19:34:05,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-11 19:34:05,617 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 19:34:05,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:34:05,617 INFO L85 PathProgramCache]: Analyzing trace with hash -608582769, now seen corresponding path program 13 times [2022-12-11 19:34:05,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:34:05,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858741187] [2022-12-11 19:34:05,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:34:05,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:34:05,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:34:06,557 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 19:34:06,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:34:06,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858741187] [2022-12-11 19:34:06,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858741187] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 19:34:06,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500903413] [2022-12-11 19:34:06,558 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-11 19:34:06,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 19:34:06,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 19:34:06,559 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 19:34:06,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-11 19:34:06,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:34:06,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 66 conjunts are in the unsatisfiable core [2022-12-11 19:34:06,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 19:34:06,662 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 [2022-12-11 19:34:06,770 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-11 19:34:06,770 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 [2022-12-11 19:34:07,668 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 18 treesize of output 20 [2022-12-11 19:34:08,147 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 19:34:08,148 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 32 [2022-12-11 19:34:08,163 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 19:34:08,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 19:34:08,427 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_448 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) c_~f~0.base))) (let ((.cse0 (select .cse1 (+ c_~f~0.offset (* c_~j~0 4))))) (or (<= c_~n~0 .cse0) (< .cse0 0) (= (select .cse1 (+ c_~f~0.offset (* c_~i~0 4))) (select .cse1 (+ (* .cse0 4) c_~f~0.offset))))))) is different from false [2022-12-11 19:34:08,532 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 19:34:08,532 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 154 treesize of output 166 [2022-12-11 19:34:08,555 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 19:34:08,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 66 [2022-12-11 19:34:09,905 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 19:34:09,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500903413] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 19:34:09,905 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 19:34:09,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 33, 33] total 85 [2022-12-11 19:34:09,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544051944] [2022-12-11 19:34:09,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 19:34:09,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2022-12-11 19:34:09,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:34:09,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2022-12-11 19:34:09,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=473, Invalid=6502, Unknown=1, NotChecked=164, Total=7140 [2022-12-11 19:34:09,910 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 172 [2022-12-11 19:34:09,914 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 290 transitions, 2166 flow. Second operand has 85 states, 85 states have (on average 74.67058823529412) internal successors, (6347), 85 states have internal predecessors, (6347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 19:34:09,914 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:34:09,915 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 172 [2022-12-11 19:34:09,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:34:33,891 WARN L233 SmtUtils]: Spent 18.27s on a formula simplification. DAG size of input: 69 DAG size of output: 66 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-11 19:34:51,069 INFO L130 PetriNetUnfolder]: 14881/34817 cut-off events. [2022-12-11 19:34:51,069 INFO L131 PetriNetUnfolder]: For 185412/186828 co-relation queries the response was YES. [2022-12-11 19:34:51,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155788 conditions, 34817 events. 14881/34817 cut-off events. For 185412/186828 co-relation queries the response was YES. Maximal size of possible extension queue 2012. Compared 409123 event pairs, 3834 based on Foata normal form. 220/34374 useless extension candidates. Maximal degree in co-relation 155606. Up to 9067 conditions per place. [2022-12-11 19:34:51,867 INFO L137 encePairwiseOnDemand]: 127/172 looper letters, 461 selfloop transitions, 247 changer transitions 148/934 dead transitions. [2022-12-11 19:34:51,867 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 934 transitions, 9823 flow [2022-12-11 19:34:51,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2022-12-11 19:34:51,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2022-12-11 19:34:51,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 7015 transitions. [2022-12-11 19:34:51,875 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45825712045989025 [2022-12-11 19:34:51,875 INFO L175 Difference]: Start difference. First operand has 281 places, 290 transitions, 2166 flow. Second operand 89 states and 7015 transitions. [2022-12-11 19:34:51,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 934 transitions, 9823 flow [2022-12-11 19:34:52,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 934 transitions, 9264 flow, removed 118 selfloop flow, removed 22 redundant places. [2022-12-11 19:34:52,996 INFO L231 Difference]: Finished difference. Result has 385 places, 487 transitions, 5480 flow [2022-12-11 19:34:52,997 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=2007, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=89, PETRI_FLOW=5480, PETRI_PLACES=385, PETRI_TRANSITIONS=487} [2022-12-11 19:34:52,997 INFO L295 CegarLoopForPetriNet]: 162 programPoint places, 223 predicate places. [2022-12-11 19:34:52,998 INFO L495 AbstractCegarLoop]: Abstraction has has 385 places, 487 transitions, 5480 flow [2022-12-11 19:34:53,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 85 states have (on average 74.67058823529412) internal successors, (6347), 85 states have internal predecessors, (6347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 19:34:53,001 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:34:53,001 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:34:53,008 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-11 19:34:53,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-11 19:34:53,208 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 19:34:53,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:34:53,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1500568899, now seen corresponding path program 14 times [2022-12-11 19:34:53,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:34:53,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627397962] [2022-12-11 19:34:53,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:34:53,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:34:53,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:34:54,783 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 19:34:54,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:34:54,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627397962] [2022-12-11 19:34:54,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627397962] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 19:34:54,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102203544] [2022-12-11 19:34:54,784 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-11 19:34:54,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 19:34:54,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 19:34:54,786 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 19:34:54,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-11 19:34:54,905 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-11 19:34:54,906 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 19:34:54,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-11 19:34:54,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 19:34:54,915 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 [2022-12-11 19:34:54,989 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-11 19:34:54,990 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 [2022-12-11 19:34:55,448 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 18 treesize of output 20 [2022-12-11 19:34:55,699 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 19:34:55,699 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2022-12-11 19:34:55,721 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-11 19:34:55,722 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-11 19:34:55,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102203544] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:34:55,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-11 19:34:55,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [29] total 43 [2022-12-11 19:34:55,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426647602] [2022-12-11 19:34:55,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:34:55,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-11 19:34:55,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:34:55,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-11 19:34:55,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1675, Unknown=0, NotChecked=0, Total=1806 [2022-12-11 19:34:55,725 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 172 [2022-12-11 19:34:55,726 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 487 transitions, 5480 flow. Second operand has 20 states, 20 states have (on average 86.65) internal successors, (1733), 20 states have internal predecessors, (1733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 19:34:55,726 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:34:55,726 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 172 [2022-12-11 19:34:55,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:35:06,705 INFO L130 PetriNetUnfolder]: 13662/31939 cut-off events. [2022-12-11 19:35:06,706 INFO L131 PetriNetUnfolder]: For 607163/608631 co-relation queries the response was YES. [2022-12-11 19:35:07,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204655 conditions, 31939 events. 13662/31939 cut-off events. For 607163/608631 co-relation queries the response was YES. Maximal size of possible extension queue 1821. Compared 369984 event pairs, 5016 based on Foata normal form. 278/31574 useless extension candidates. Maximal degree in co-relation 204366. Up to 13367 conditions per place. [2022-12-11 19:35:08,008 INFO L137 encePairwiseOnDemand]: 149/172 looper letters, 257 selfloop transitions, 152 changer transitions 58/565 dead transitions. [2022-12-11 19:35:08,009 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 565 transitions, 7350 flow [2022-12-11 19:35:08,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-11 19:35:08,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-11 19:35:08,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 2075 transitions. [2022-12-11 19:35:08,026 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5245197168857432 [2022-12-11 19:35:08,026 INFO L175 Difference]: Start difference. First operand has 385 places, 487 transitions, 5480 flow. Second operand 23 states and 2075 transitions. [2022-12-11 19:35:08,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 565 transitions, 7350 flow [2022-12-11 19:35:13,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 348 places, 565 transitions, 6648 flow, removed 324 selfloop flow, removed 36 redundant places. [2022-12-11 19:35:13,603 INFO L231 Difference]: Finished difference. Result has 351 places, 460 transitions, 4966 flow [2022-12-11 19:35:13,604 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=4960, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=487, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=152, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=335, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=4966, PETRI_PLACES=351, PETRI_TRANSITIONS=460} [2022-12-11 19:35:13,605 INFO L295 CegarLoopForPetriNet]: 162 programPoint places, 189 predicate places. [2022-12-11 19:35:13,605 INFO L495 AbstractCegarLoop]: Abstraction has has 351 places, 460 transitions, 4966 flow [2022-12-11 19:35:13,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 86.65) internal successors, (1733), 20 states have internal predecessors, (1733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 19:35:13,606 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:35:13,606 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:35:13,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-11 19:35:13,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-11 19:35:13,807 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 19:35:13,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:35:13,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1103479065, now seen corresponding path program 15 times [2022-12-11 19:35:13,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:35:13,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736777572] [2022-12-11 19:35:13,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:35:13,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:35:13,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:35:15,311 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 19:35:15,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:35:15,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736777572] [2022-12-11 19:35:15,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736777572] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 19:35:15,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148717119] [2022-12-11 19:35:15,312 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-11 19:35:15,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 19:35:15,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 19:35:15,313 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 19:35:15,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-11 19:35:15,434 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-11 19:35:15,434 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 19:35:15,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-11 19:35:15,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 19:35:15,443 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 [2022-12-11 19:35:15,490 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-11 19:35:15,491 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 [2022-12-11 19:35:15,931 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 18 treesize of output 20 [2022-12-11 19:35:16,230 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 19:35:16,230 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2022-12-11 19:35:16,256 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-11 19:35:16,256 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-11 19:35:16,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148717119] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:35:16,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-11 19:35:16,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [30] total 44 [2022-12-11 19:35:16,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697846173] [2022-12-11 19:35:16,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:35:16,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-11 19:35:16,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:35:16,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-11 19:35:16,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1753, Unknown=0, NotChecked=0, Total=1892 [2022-12-11 19:35:16,259 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 172 [2022-12-11 19:35:16,260 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 460 transitions, 4966 flow. Second operand has 20 states, 20 states have (on average 86.65) internal successors, (1733), 20 states have internal predecessors, (1733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 19:35:16,261 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:35:16,261 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 172 [2022-12-11 19:35:16,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:35:26,131 INFO L130 PetriNetUnfolder]: 13261/31250 cut-off events. [2022-12-11 19:35:26,131 INFO L131 PetriNetUnfolder]: For 372313/373823 co-relation queries the response was YES. [2022-12-11 19:35:26,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177292 conditions, 31250 events. 13261/31250 cut-off events. For 372313/373823 co-relation queries the response was YES. Maximal size of possible extension queue 1747. Compared 363761 event pairs, 2763 based on Foata normal form. 274/30886 useless extension candidates. Maximal degree in co-relation 177218. Up to 12922 conditions per place. [2022-12-11 19:35:27,255 INFO L137 encePairwiseOnDemand]: 149/172 looper letters, 229 selfloop transitions, 142 changer transitions 77/546 dead transitions. [2022-12-11 19:35:27,256 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 546 transitions, 6768 flow [2022-12-11 19:35:27,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-11 19:35:27,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-11 19:35:27,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 2248 transitions. [2022-12-11 19:35:27,259 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5227906976744187 [2022-12-11 19:35:27,259 INFO L175 Difference]: Start difference. First operand has 351 places, 460 transitions, 4966 flow. Second operand 25 states and 2248 transitions. [2022-12-11 19:35:27,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 546 transitions, 6768 flow [2022-12-11 19:35:29,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 546 transitions, 6276 flow, removed 12 selfloop flow, removed 23 redundant places. [2022-12-11 19:35:29,412 INFO L231 Difference]: Finished difference. Result has 349 places, 424 transitions, 4465 flow [2022-12-11 19:35:29,413 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=4490, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=460, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=142, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=4465, PETRI_PLACES=349, PETRI_TRANSITIONS=424} [2022-12-11 19:35:29,413 INFO L295 CegarLoopForPetriNet]: 162 programPoint places, 187 predicate places. [2022-12-11 19:35:29,413 INFO L495 AbstractCegarLoop]: Abstraction has has 349 places, 424 transitions, 4465 flow [2022-12-11 19:35:29,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 86.65) internal successors, (1733), 20 states have internal predecessors, (1733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 19:35:29,414 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:35:29,414 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:35:29,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-11 19:35:29,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-11 19:35:29,619 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 19:35:29,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:35:29,620 INFO L85 PathProgramCache]: Analyzing trace with hash -575513867, now seen corresponding path program 16 times [2022-12-11 19:35:29,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:35:29,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322232256] [2022-12-11 19:35:29,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:35:29,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:35:29,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:35:33,020 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 19:35:33,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:35:33,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322232256] [2022-12-11 19:35:33,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322232256] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 19:35:33,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35039634] [2022-12-11 19:35:33,021 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-11 19:35:33,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 19:35:33,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 19:35:33,022 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 19:35:33,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-11 19:35:33,143 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-11 19:35:33,143 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 19:35:33,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-11 19:35:33,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 19:35:33,596 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 19:35:33,597 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2022-12-11 19:35:33,623 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-11 19:35:33,624 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-11 19:35:33,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35039634] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:35:33,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-11 19:35:33,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [32] total 39 [2022-12-11 19:35:33,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861802299] [2022-12-11 19:35:33,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:35:33,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-11 19:35:33,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:35:33,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-11 19:35:33,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1359, Unknown=0, NotChecked=0, Total=1482 [2022-12-11 19:35:33,627 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 172 [2022-12-11 19:35:33,628 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 424 transitions, 4465 flow. Second operand has 12 states, 12 states have (on average 106.83333333333333) internal successors, (1282), 12 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 19:35:33,628 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:35:33,628 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 172 [2022-12-11 19:35:33,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:35:43,520 INFO L130 PetriNetUnfolder]: 14285/33746 cut-off events. [2022-12-11 19:35:43,521 INFO L131 PetriNetUnfolder]: For 425255/426647 co-relation queries the response was YES. [2022-12-11 19:35:44,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194391 conditions, 33746 events. 14285/33746 cut-off events. For 425255/426647 co-relation queries the response was YES. Maximal size of possible extension queue 1879. Compared 396145 event pairs, 4525 based on Foata normal form. 216/33338 useless extension candidates. Maximal degree in co-relation 194316. Up to 10234 conditions per place. [2022-12-11 19:35:44,758 INFO L137 encePairwiseOnDemand]: 158/172 looper letters, 313 selfloop transitions, 123 changer transitions 10/562 dead transitions. [2022-12-11 19:35:44,758 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 562 transitions, 6858 flow [2022-12-11 19:35:44,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-11 19:35:44,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-11 19:35:44,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1908 transitions. [2022-12-11 19:35:44,761 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.652530779753762 [2022-12-11 19:35:44,761 INFO L175 Difference]: Start difference. First operand has 349 places, 424 transitions, 4465 flow. Second operand 17 states and 1908 transitions. [2022-12-11 19:35:44,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 562 transitions, 6858 flow [2022-12-11 19:35:48,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 562 transitions, 6230 flow, removed 85 selfloop flow, removed 30 redundant places. [2022-12-11 19:35:48,652 INFO L231 Difference]: Finished difference. Result has 327 places, 463 transitions, 4893 flow [2022-12-11 19:35:48,653 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=3945, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=424, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=4893, PETRI_PLACES=327, PETRI_TRANSITIONS=463} [2022-12-11 19:35:48,653 INFO L295 CegarLoopForPetriNet]: 162 programPoint places, 165 predicate places. [2022-12-11 19:35:48,653 INFO L495 AbstractCegarLoop]: Abstraction has has 327 places, 463 transitions, 4893 flow [2022-12-11 19:35:48,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 106.83333333333333) internal successors, (1282), 12 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 19:35:48,661 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:35:48,661 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:35:48,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-11 19:35:48,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 19:35:48,868 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 19:35:48,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:35:48,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1585605687, now seen corresponding path program 17 times [2022-12-11 19:35:48,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:35:48,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156950777] [2022-12-11 19:35:48,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:35:48,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:35:48,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:35:51,626 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 19:35:51,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:35:51,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156950777] [2022-12-11 19:35:51,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156950777] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 19:35:51,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915889431] [2022-12-11 19:35:51,627 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-11 19:35:51,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 19:35:51,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 19:35:51,628 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 19:35:51,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-11 19:35:51,754 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-11 19:35:51,754 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 19:35:51,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-11 19:35:51,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 19:35:52,262 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 19:35:52,262 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2022-12-11 19:35:52,290 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-11 19:35:52,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 19:35:52,540 INFO L321 Elim1Store]: treesize reduction 10, result has 85.5 percent of original size [2022-12-11 19:35:52,540 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 78 [2022-12-11 19:35:52,726 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-11 19:35:52,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915889431] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-11 19:35:52,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-11 19:35:52,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [33, 15] total 49 [2022-12-11 19:35:52,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101407249] [2022-12-11 19:35:52,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:35:52,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-11 19:35:52,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:35:52,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-11 19:35:52,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=2168, Unknown=0, NotChecked=0, Total=2352 [2022-12-11 19:35:52,729 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 172 [2022-12-11 19:35:52,731 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 463 transitions, 4893 flow. Second operand has 12 states, 12 states have (on average 106.83333333333333) internal successors, (1282), 12 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 19:35:52,731 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:35:52,731 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 172 [2022-12-11 19:35:52,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:36:02,709 INFO L130 PetriNetUnfolder]: 14776/35020 cut-off events. [2022-12-11 19:36:02,709 INFO L131 PetriNetUnfolder]: For 381080/382454 co-relation queries the response was YES. [2022-12-11 19:36:03,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195096 conditions, 35020 events. 14776/35020 cut-off events. For 381080/382454 co-relation queries the response was YES. Maximal size of possible extension queue 1929. Compared 414773 event pairs, 2522 based on Foata normal form. 233/34689 useless extension candidates. Maximal degree in co-relation 195024. Up to 10284 conditions per place. [2022-12-11 19:36:03,601 INFO L137 encePairwiseOnDemand]: 159/172 looper letters, 385 selfloop transitions, 164 changer transitions 4/669 dead transitions. [2022-12-11 19:36:03,601 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 669 transitions, 8038 flow [2022-12-11 19:36:03,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-11 19:36:03,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-11 19:36:03,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 2719 transitions. [2022-12-11 19:36:03,603 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.658672480620155 [2022-12-11 19:36:03,604 INFO L175 Difference]: Start difference. First operand has 327 places, 463 transitions, 4893 flow. Second operand 24 states and 2719 transitions. [2022-12-11 19:36:03,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 669 transitions, 8038 flow [2022-12-11 19:36:05,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 669 transitions, 7844 flow, removed 50 selfloop flow, removed 9 redundant places. [2022-12-11 19:36:05,896 INFO L231 Difference]: Finished difference. Result has 345 places, 474 transitions, 5348 flow [2022-12-11 19:36:05,896 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=4729, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=463, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=153, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=5348, PETRI_PLACES=345, PETRI_TRANSITIONS=474} [2022-12-11 19:36:05,896 INFO L295 CegarLoopForPetriNet]: 162 programPoint places, 183 predicate places. [2022-12-11 19:36:05,896 INFO L495 AbstractCegarLoop]: Abstraction has has 345 places, 474 transitions, 5348 flow [2022-12-11 19:36:05,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 106.83333333333333) internal successors, (1282), 12 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 19:36:05,897 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:36:05,897 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:36:05,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-11 19:36:06,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-11 19:36:06,103 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 19:36:06,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:36:06,103 INFO L85 PathProgramCache]: Analyzing trace with hash -2114176393, now seen corresponding path program 18 times [2022-12-11 19:36:06,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:36:06,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421674760] [2022-12-11 19:36:06,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:36:06,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:36:06,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:36:07,941 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 19:36:07,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:36:07,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421674760] [2022-12-11 19:36:07,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421674760] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 19:36:07,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795623653] [2022-12-11 19:36:07,941 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-11 19:36:07,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 19:36:07,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 19:36:07,943 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 19:36:07,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-11 19:36:08,043 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-12-11 19:36:08,044 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 19:36:08,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-11 19:36:08,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 19:36:08,401 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 19:36:08,402 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2022-12-11 19:36:08,419 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-11 19:36:08,419 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-11 19:36:08,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795623653] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:36:08,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-11 19:36:08,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [34] total 41 [2022-12-11 19:36:08,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793935481] [2022-12-11 19:36:08,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:36:08,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-11 19:36:08,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:36:08,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-11 19:36:08,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1533, Unknown=0, NotChecked=0, Total=1640 [2022-12-11 19:36:08,421 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 172 [2022-12-11 19:36:08,422 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 474 transitions, 5348 flow. Second operand has 12 states, 12 states have (on average 106.83333333333333) internal successors, (1282), 12 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 19:36:08,422 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:36:08,422 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 172 [2022-12-11 19:36:08,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:36:15,628 INFO L130 PetriNetUnfolder]: 14755/34512 cut-off events. [2022-12-11 19:36:15,628 INFO L131 PetriNetUnfolder]: For 404269/405727 co-relation queries the response was YES. [2022-12-11 19:36:16,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199922 conditions, 34512 events. 14755/34512 cut-off events. For 404269/405727 co-relation queries the response was YES. Maximal size of possible extension queue 1932. Compared 403159 event pairs, 4768 based on Foata normal form. 212/34077 useless extension candidates. Maximal degree in co-relation 199845. Up to 13426 conditions per place. [2022-12-11 19:36:16,381 INFO L137 encePairwiseOnDemand]: 158/172 looper letters, 279 selfloop transitions, 117 changer transitions 37/549 dead transitions. [2022-12-11 19:36:16,381 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 549 transitions, 6952 flow [2022-12-11 19:36:16,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-11 19:36:16,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-11 19:36:16,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1784 transitions. [2022-12-11 19:36:16,383 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6482558139534884 [2022-12-11 19:36:16,383 INFO L175 Difference]: Start difference. First operand has 345 places, 474 transitions, 5348 flow. Second operand 16 states and 1784 transitions. [2022-12-11 19:36:16,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 549 transitions, 6952 flow [2022-12-11 19:36:18,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 549 transitions, 6692 flow, removed 44 selfloop flow, removed 14 redundant places. [2022-12-11 19:36:18,921 INFO L231 Difference]: Finished difference. Result has 347 places, 465 transitions, 5231 flow [2022-12-11 19:36:18,922 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=5090, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=474, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=5231, PETRI_PLACES=347, PETRI_TRANSITIONS=465} [2022-12-11 19:36:18,922 INFO L295 CegarLoopForPetriNet]: 162 programPoint places, 185 predicate places. [2022-12-11 19:36:18,922 INFO L495 AbstractCegarLoop]: Abstraction has has 347 places, 465 transitions, 5231 flow [2022-12-11 19:36:18,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 106.83333333333333) internal successors, (1282), 12 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 19:36:18,923 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:36:18,923 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:36:18,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-12-11 19:36:19,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 19:36:19,128 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 19:36:19,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:36:19,128 INFO L85 PathProgramCache]: Analyzing trace with hash 2000280769, now seen corresponding path program 19 times [2022-12-11 19:36:19,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:36:19,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034682024] [2022-12-11 19:36:19,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:36:19,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:36:19,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:36:19,243 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-11 19:36:19,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:36:19,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034682024] [2022-12-11 19:36:19,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034682024] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:36:19,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:36:19,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-11 19:36:19,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263014083] [2022-12-11 19:36:19,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:36:19,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-11 19:36:19,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:36:19,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-11 19:36:19,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-11 19:36:19,244 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 172 [2022-12-11 19:36:19,245 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 465 transitions, 5231 flow. Second operand has 8 states, 8 states have (on average 137.875) internal successors, (1103), 8 states have internal predecessors, (1103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 19:36:19,245 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:36:19,245 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 172 [2022-12-11 19:36:19,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:36:20,918 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([514] L94-->L97: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| (ite (= (mod v_~e1~0_10 256) 0) 1 0))) InVars {~e1~0=v_~e1~0_10} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~e1~0=v_~e1~0_10} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][163], [Black: 11383#(and (exists ((~i1~0 Int)) (and (= (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) ~i2~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset))))) (= ~j~0 ~i~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset)))), Black: 12925#(and (exists ((~i1~0 Int)) (and (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 130#L156-1true, Black: 9622#(and (or (< ~i~0 0) (<= ~n~0 ~i~0) (forall ((v_ArrVal_448 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ ~f~0.offset (* (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ (* ~i~0 4) ~f~0.offset))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (<= ~n~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)))))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n~0 2)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (or (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n~0 2)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (or (< ~n~0 2) (= (* ~i1~0 4) (* ~j~0 4))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 11269#(= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset))), Black: 12811#(exists ((~i1~0 Int)) (and (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))))), Black: 9608#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= ~j~0 ~i~0) (< ~i1~0 ~n~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (= (* ~i1~0 4) (* ~j~0 4))), Black: 12927#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (exists ((~i1~0 Int)) (and (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1281#(= ~e2~0 1), Black: 11381#(and (exists ((~i1~0 Int)) (and (= (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) ~i2~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset))))) (exists ((~i1~0 Int)) (and (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset))))) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset)))), Black: 9642#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (exists ((v_~j~0_63 Int)) (and (<= 0 v_~j~0_63) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_63 4) ~f~0.offset)) ~i~0) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_63 4) ~f~0.offset)) ~j~0) (< v_~j~0_63 ~n~0))) (< ~i~0 ~n~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 9652#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= ~j~0 ~i~0) (<= ~i~0 ~j~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (= (* ~i1~0 4) (* ~j~0 4))), Black: 9620#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (or (and (<= 0 ~i2~0) (<= (+ (* ~j~0 4) ~f~0.offset) 0) (<= (+ (* ~i2~0 4) ~f~0.offset) 0)) (and (<= ~i2~0 1) (= (+ (* ~j~0 4) ~f~0.offset) 4) (<= 1 ~i2~0))) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= 0 ~j~0) (< ~j~0 ~n~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 9568#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 9594#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (and (or (not (<= 0 ~i~0)) (not (< ~i~0 ~n~0))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (and (<= 0 ~i~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (< ~i~0 ~n~0))) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= ~j~0 ~i~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 7930#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 0)) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) ~j~0)), Black: 7938#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))) (not (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 0)) (= ~j~0 ~i~0)), Black: 9590#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (and (or (not (<= 0 ~i~0)) (not (< ~i~0 ~n~0))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (and (<= 0 ~i~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (< ~i~0 ~n~0))) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= ~j~0 ~i~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 7932#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~j~0 ~i1~0) (not (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 0)) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)))), Black: 7944#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~j~0 ~i1~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))) (forall ((v_ArrVal_372 (Array Int Int))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_372) ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_372) ~f~0.base) (+ ~f~0.offset (* (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_372) ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4))))) (not (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 0))), Black: 7926#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~j~0 ~i1~0) (forall ((v_ArrVal_372 (Array Int Int))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_372) ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_372) ~f~0.base) (+ ~f~0.offset (* (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_372) ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4))))) (not (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 0)) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)))), Black: 9602#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (< ~i~0 ~n~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= ~j~0 ~i~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 9562#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 9586#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= ~j~0 ~i~0) (<= ~i~0 ~j~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 9635#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= ~j~0 ~i~0) (<= ~i~0 ~j~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 58#L71true, Black: 9637#(and (or (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (<= ~n~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n~0 2)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (or (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n~0 2)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (or (< ~n~0 2) (= (* ~i1~0 4) (* ~j~0 4))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 9633#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (or (and (<= 0 ~i2~0) (<= (+ (* ~j~0 4) ~f~0.offset) 0) (<= (+ (* ~i2~0 4) ~f~0.offset) 0)) (and (<= ~i2~0 1) (= (+ (* ~j~0 4) ~f~0.offset) 4) (<= 1 ~i2~0))) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= 0 ~j~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (< ~i1~0 ~n~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (= (* ~i1~0 4) (* ~j~0 4))), 89#L97true, 10867#true, 12931#true, Black: 1144#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1198#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (exists ((v_~j~0_30 Int)) (and (< v_~j~0_30 ~n~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_30 4) ~f~0.offset))) (<= 0 v_~j~0_30))) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1) (= ~j~0 ~i~0) (= (+ (* ~i2~0 4) ~f~0.offset) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 189#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 1273#(and (<= 1 ~n1~0) (= ~tmp1~0 0) (<= ~n1~0 ~n2~0) (<= ~n1~0 ~tmp2~0)), Black: 1202#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (exists ((v_~j~0_30 Int)) (and (< v_~j~0_30 ~n~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_30 4) ~f~0.offset))) (<= 0 v_~j~0_30))) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1) (= (+ (* ~i2~0 4) ~f~0.offset) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1186#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= 0 ~j~0) (< ~j~0 ~n~0) (<= ~n~0 1) (= (+ (* ~i2~0 4) ~f~0.offset) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 8502#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~j~0 ~i1~0) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), Black: 1150#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 12407#true, 2293#true, 19#L123true, Black: 1180#(and (<= ~i~0 0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (exists ((v_~j~0_30 Int)) (and (< v_~j~0_30 ~n~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_30 4) ~f~0.offset))) (<= 0 v_~j~0_30))) (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1148#(and (= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1176#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= 0 ~j~0) (< ~j~0 ~n~0) (<= ~n~0 1) (= ~j~0 ~i~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 3299#true, Black: 3282#(and (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))) (= ~j~0 ~i~0)), Black: 3286#(and (= ~j~0 ~i1~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))) (= ~j~0 ~i~0)), Black: 2866#(= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))), Black: 1190#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= 0 ~j~0) (< ~j~0 ~n~0) (<= ~n~0 1) (= (+ (* ~i2~0 4) ~f~0.offset) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4823#(and (or (< ~n~0 2) (= (* ~i1~0 4) (* ~j~0 4))) (or (= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))) (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (<= ~n~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))))), Black: 4817#(and (or (< ~i~0 0) (<= ~n~0 ~i~0) (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (<= ~n~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)))) (or (< ~n~0 2) (= (* ~i1~0 4) (* ~j~0 4)))), Black: 3709#(exists ((v_~j~0_42 Int)) (and (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_42 4) ~f~0.offset))) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_42 4) ~f~0.offset))))), Black: 3805#(and (= ~j~0 ~i1~0) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)))), Black: 3716#(exists ((v_~j~0_42 Int)) (and (= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_42 4) ~f~0.offset)) 4) ~f~0.offset)) ~j~0) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_42 4) ~f~0.offset))))), Black: 2274#(and (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (= (* ~i1~0 4) (* ~j~0 4))), Black: 2272#(and (= ~j~0 ~i~0) (= (* ~i1~0 4) (* ~j~0 4))), 1142#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1314#(= ~j~0 ~i~0), Black: 10848#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (exists ((v_~j~0_70 Int)) (and (= (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_70 4) ~f~0.offset)) ~j~0) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_70 4) ~f~0.offset)) ~i~0))) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), Black: 12382#(and (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))) (= ~j~0 ~i~0)), Black: 12380#(and (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (= (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset)))), 1283#true, Black: 2276#(and (= (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))) (= ~j~0 ~i~0)), Black: 12000#(= (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset))), Black: 11964#(= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))), Black: 9598#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (and (or (not (<= 0 ~i~0)) (not (< ~i~0 ~n~0))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (and (<= 0 ~i~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (< ~i~0 ~n~0))) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= 0 ~i~0) (< ~i~0 ~n~0)) (and (or (not (<= 0 ~i~0)) (not (< ~i~0 ~n~0))) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= ~j~0 ~i~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 7916#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 0))), Black: 9648#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (or (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (<= ~n~0 ~j~0) (< ~j~0 0)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1259#(= ~tmp1~0 0), Black: 9629#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n~0 2)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (or (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n~0 2)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (or (< ~n~0 2) (= (* ~i1~0 4) (* ~j~0 4))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1264#(and (= ~n2~0 0) (= ~tmp1~0 0)), Black: 9644#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (< ~i~0 ~n~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= ~j~0 ~i~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1267#(and (<= 1 ~n1~0) (= ~n2~0 0) (= ~tmp1~0 0)), Black: 11262#(= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))), Black: 1258#(= ~n2~0 0), Black: 9566#(and (<= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 9578#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 9627#(and (or (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (<= ~n~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n~0 2)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (or (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n~0 2)) (forall ((v_ArrVal_448 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ ~f~0.offset (* (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ (* ~i~0 4) ~f~0.offset))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (<= ~n~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))))) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (or (< ~n~0 2) (= (* ~i1~0 4) (* ~j~0 4))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 11379#(and (exists ((~i1~0 Int)) (and (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset))))) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset)))), Black: 11377#(and (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))) (= ~j~0 ~i~0)), Black: 9646#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (or (and (<= 0 ~i2~0) (<= (+ (* ~j~0 4) ~f~0.offset) 0) (<= 0 ~j~0) (<= (+ (* ~i2~0 4) ~f~0.offset) 0)) (and (<= ~i2~0 1) (= (+ (* ~j~0 4) ~f~0.offset) 4) (<= 1 ~i2~0))) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|))]) [2022-12-11 19:36:20,919 INFO L382 tUnfolder$Statistics]: this new event has 127 ancestors and is cut-off event [2022-12-11 19:36:20,919 INFO L385 tUnfolder$Statistics]: existing Event has 127 ancestors and is cut-off event [2022-12-11 19:36:20,919 INFO L385 tUnfolder$Statistics]: existing Event has 127 ancestors and is cut-off event [2022-12-11 19:36:20,919 INFO L385 tUnfolder$Statistics]: existing Event has 127 ancestors and is cut-off event [2022-12-11 19:36:21,478 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([514] L94-->L97: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| (ite (= (mod v_~e1~0_10 256) 0) 1 0))) InVars {~e1~0=v_~e1~0_10} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~e1~0=v_~e1~0_10} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][163], [Black: 11383#(and (exists ((~i1~0 Int)) (and (= (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) ~i2~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset))))) (= ~j~0 ~i~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset)))), Black: 12925#(and (exists ((~i1~0 Int)) (and (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 130#L156-1true, Black: 11269#(= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset))), Black: 12811#(exists ((~i1~0 Int)) (and (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))))), Black: 9622#(and (or (< ~i~0 0) (<= ~n~0 ~i~0) (forall ((v_ArrVal_448 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ ~f~0.offset (* (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ (* ~i~0 4) ~f~0.offset))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (<= ~n~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)))))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n~0 2)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (or (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n~0 2)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (or (< ~n~0 2) (= (* ~i1~0 4) (* ~j~0 4))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 9608#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= ~j~0 ~i~0) (< ~i1~0 ~n~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (= (* ~i1~0 4) (* ~j~0 4))), Black: 12927#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (exists ((~i1~0 Int)) (and (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1281#(= ~e2~0 1), Black: 11381#(and (exists ((~i1~0 Int)) (and (= (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) ~i2~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset))))) (exists ((~i1~0 Int)) (and (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset))))) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset)))), Black: 9642#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (exists ((v_~j~0_63 Int)) (and (<= 0 v_~j~0_63) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_63 4) ~f~0.offset)) ~i~0) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_63 4) ~f~0.offset)) ~j~0) (< v_~j~0_63 ~n~0))) (< ~i~0 ~n~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 9652#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= ~j~0 ~i~0) (<= ~i~0 ~j~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (= (* ~i1~0 4) (* ~j~0 4))), Black: 9620#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (or (and (<= 0 ~i2~0) (<= (+ (* ~j~0 4) ~f~0.offset) 0) (<= (+ (* ~i2~0 4) ~f~0.offset) 0)) (and (<= ~i2~0 1) (= (+ (* ~j~0 4) ~f~0.offset) 4) (<= 1 ~i2~0))) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= 0 ~j~0) (< ~j~0 ~n~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 153#L74true, Black: 9568#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 9594#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (and (or (not (<= 0 ~i~0)) (not (< ~i~0 ~n~0))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (and (<= 0 ~i~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (< ~i~0 ~n~0))) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= ~j~0 ~i~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 7930#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 0)) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) ~j~0)), Black: 7938#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))) (not (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 0)) (= ~j~0 ~i~0)), Black: 9590#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (and (or (not (<= 0 ~i~0)) (not (< ~i~0 ~n~0))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (and (<= 0 ~i~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (< ~i~0 ~n~0))) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= ~j~0 ~i~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 7932#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~j~0 ~i1~0) (not (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 0)) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)))), Black: 7944#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~j~0 ~i1~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))) (forall ((v_ArrVal_372 (Array Int Int))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_372) ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_372) ~f~0.base) (+ ~f~0.offset (* (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_372) ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4))))) (not (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 0))), Black: 7926#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~j~0 ~i1~0) (forall ((v_ArrVal_372 (Array Int Int))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_372) ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_372) ~f~0.base) (+ ~f~0.offset (* (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_372) ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4))))) (not (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 0)) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)))), Black: 9602#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (< ~i~0 ~n~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= ~j~0 ~i~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 9562#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 9586#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= ~j~0 ~i~0) (<= ~i~0 ~j~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 9635#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= ~j~0 ~i~0) (<= ~i~0 ~j~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 9637#(and (or (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (<= ~n~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n~0 2)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (or (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n~0 2)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (or (< ~n~0 2) (= (* ~i1~0 4) (* ~j~0 4))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 9633#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (or (and (<= 0 ~i2~0) (<= (+ (* ~j~0 4) ~f~0.offset) 0) (<= (+ (* ~i2~0 4) ~f~0.offset) 0)) (and (<= ~i2~0 1) (= (+ (* ~j~0 4) ~f~0.offset) 4) (<= 1 ~i2~0))) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= 0 ~j~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (< ~i1~0 ~n~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (= (* ~i1~0 4) (* ~j~0 4))), 89#L97true, 10867#true, 12931#true, Black: 1144#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1198#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (exists ((v_~j~0_30 Int)) (and (< v_~j~0_30 ~n~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_30 4) ~f~0.offset))) (<= 0 v_~j~0_30))) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1) (= ~j~0 ~i~0) (= (+ (* ~i2~0 4) ~f~0.offset) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 189#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 1273#(and (<= 1 ~n1~0) (= ~tmp1~0 0) (<= ~n1~0 ~n2~0) (<= ~n1~0 ~tmp2~0)), Black: 1202#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (exists ((v_~j~0_30 Int)) (and (< v_~j~0_30 ~n~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_30 4) ~f~0.offset))) (<= 0 v_~j~0_30))) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1) (= (+ (* ~i2~0 4) ~f~0.offset) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1186#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= 0 ~j~0) (< ~j~0 ~n~0) (<= ~n~0 1) (= (+ (* ~i2~0 4) ~f~0.offset) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 8502#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~j~0 ~i1~0) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), Black: 1150#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 12407#true, 2293#true, 19#L123true, Black: 1180#(and (<= ~i~0 0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (exists ((v_~j~0_30 Int)) (and (< v_~j~0_30 ~n~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_30 4) ~f~0.offset))) (<= 0 v_~j~0_30))) (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1148#(and (= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1176#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= 0 ~j~0) (< ~j~0 ~n~0) (<= ~n~0 1) (= ~j~0 ~i~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 3299#true, Black: 3282#(and (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))) (= ~j~0 ~i~0)), Black: 3286#(and (= ~j~0 ~i1~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))) (= ~j~0 ~i~0)), Black: 2866#(= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))), Black: 1190#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= 0 ~j~0) (< ~j~0 ~n~0) (<= ~n~0 1) (= (+ (* ~i2~0 4) ~f~0.offset) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4823#(and (or (< ~n~0 2) (= (* ~i1~0 4) (* ~j~0 4))) (or (= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))) (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (<= ~n~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))))), Black: 4817#(and (or (< ~i~0 0) (<= ~n~0 ~i~0) (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (<= ~n~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)))) (or (< ~n~0 2) (= (* ~i1~0 4) (* ~j~0 4)))), Black: 3709#(exists ((v_~j~0_42 Int)) (and (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_42 4) ~f~0.offset))) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_42 4) ~f~0.offset))))), Black: 3805#(and (= ~j~0 ~i1~0) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)))), Black: 3716#(exists ((v_~j~0_42 Int)) (and (= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_42 4) ~f~0.offset)) 4) ~f~0.offset)) ~j~0) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_42 4) ~f~0.offset))))), Black: 2274#(and (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (= (* ~i1~0 4) (* ~j~0 4))), Black: 2272#(and (= ~j~0 ~i~0) (= (* ~i1~0 4) (* ~j~0 4))), 1142#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1314#(= ~j~0 ~i~0), Black: 10848#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (exists ((v_~j~0_70 Int)) (and (= (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_70 4) ~f~0.offset)) ~j~0) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_70 4) ~f~0.offset)) ~i~0))) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), Black: 12382#(and (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))) (= ~j~0 ~i~0)), Black: 12380#(and (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (= (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset)))), 1283#true, Black: 2276#(and (= (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))) (= ~j~0 ~i~0)), Black: 12000#(= (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset))), Black: 11964#(= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))), Black: 9598#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (and (or (not (<= 0 ~i~0)) (not (< ~i~0 ~n~0))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (and (<= 0 ~i~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (< ~i~0 ~n~0))) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= 0 ~i~0) (< ~i~0 ~n~0)) (and (or (not (<= 0 ~i~0)) (not (< ~i~0 ~n~0))) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= ~j~0 ~i~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 7916#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 0))), Black: 9648#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (or (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (<= ~n~0 ~j~0) (< ~j~0 0)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1259#(= ~tmp1~0 0), Black: 9629#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n~0 2)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (or (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n~0 2)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (or (< ~n~0 2) (= (* ~i1~0 4) (* ~j~0 4))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1264#(and (= ~n2~0 0) (= ~tmp1~0 0)), Black: 9644#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (< ~i~0 ~n~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= ~j~0 ~i~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1267#(and (<= 1 ~n1~0) (= ~n2~0 0) (= ~tmp1~0 0)), Black: 11262#(= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))), Black: 1258#(= ~n2~0 0), Black: 9566#(and (<= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 9578#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 11379#(and (exists ((~i1~0 Int)) (and (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset))))) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset)))), Black: 9627#(and (or (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (<= ~n~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n~0 2)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (or (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n~0 2)) (forall ((v_ArrVal_448 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ ~f~0.offset (* (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ (* ~i~0 4) ~f~0.offset))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (<= ~n~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))))) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (or (< ~n~0 2) (= (* ~i1~0 4) (* ~j~0 4))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 11377#(and (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))) (= ~j~0 ~i~0)), Black: 9646#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (or (and (<= 0 ~i2~0) (<= (+ (* ~j~0 4) ~f~0.offset) 0) (<= 0 ~j~0) (<= (+ (* ~i2~0 4) ~f~0.offset) 0)) (and (<= ~i2~0 1) (= (+ (* ~j~0 4) ~f~0.offset) 4) (<= 1 ~i2~0))) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|))]) [2022-12-11 19:36:21,479 INFO L382 tUnfolder$Statistics]: this new event has 128 ancestors and is cut-off event [2022-12-11 19:36:21,479 INFO L385 tUnfolder$Statistics]: existing Event has 128 ancestors and is cut-off event [2022-12-11 19:36:21,479 INFO L385 tUnfolder$Statistics]: existing Event has 128 ancestors and is cut-off event [2022-12-11 19:36:21,479 INFO L385 tUnfolder$Statistics]: existing Event has 128 ancestors and is cut-off event [2022-12-11 19:36:21,480 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([514] L94-->L97: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| (ite (= (mod v_~e1~0_10 256) 0) 1 0))) InVars {~e1~0=v_~e1~0_10} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~e1~0=v_~e1~0_10} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][163], [Black: 11383#(and (exists ((~i1~0 Int)) (and (= (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) ~i2~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset))))) (= ~j~0 ~i~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset)))), Black: 12925#(and (exists ((~i1~0 Int)) (and (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 130#L156-1true, Black: 9622#(and (or (< ~i~0 0) (<= ~n~0 ~i~0) (forall ((v_ArrVal_448 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ ~f~0.offset (* (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ (* ~i~0 4) ~f~0.offset))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (<= ~n~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)))))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n~0 2)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (or (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n~0 2)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (or (< ~n~0 2) (= (* ~i1~0 4) (* ~j~0 4))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 11269#(= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset))), Black: 12811#(exists ((~i1~0 Int)) (and (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))))), Black: 9608#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= ~j~0 ~i~0) (< ~i1~0 ~n~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (= (* ~i1~0 4) (* ~j~0 4))), Black: 12927#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (exists ((~i1~0 Int)) (and (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1281#(= ~e2~0 1), Black: 11381#(and (exists ((~i1~0 Int)) (and (= (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) ~i2~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset))))) (exists ((~i1~0 Int)) (and (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset))))) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset)))), Black: 9642#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (exists ((v_~j~0_63 Int)) (and (<= 0 v_~j~0_63) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_63 4) ~f~0.offset)) ~i~0) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_63 4) ~f~0.offset)) ~j~0) (< v_~j~0_63 ~n~0))) (< ~i~0 ~n~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 9652#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= ~j~0 ~i~0) (<= ~i~0 ~j~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (= (* ~i1~0 4) (* ~j~0 4))), Black: 9620#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (or (and (<= 0 ~i2~0) (<= (+ (* ~j~0 4) ~f~0.offset) 0) (<= (+ (* ~i2~0 4) ~f~0.offset) 0)) (and (<= ~i2~0 1) (= (+ (* ~j~0 4) ~f~0.offset) 4) (<= 1 ~i2~0))) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= 0 ~j~0) (< ~j~0 ~n~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 9568#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 9594#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (and (or (not (<= 0 ~i~0)) (not (< ~i~0 ~n~0))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (and (<= 0 ~i~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (< ~i~0 ~n~0))) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= ~j~0 ~i~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 7930#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 0)) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) ~j~0)), Black: 7938#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))) (not (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 0)) (= ~j~0 ~i~0)), Black: 9590#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (and (or (not (<= 0 ~i~0)) (not (< ~i~0 ~n~0))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (and (<= 0 ~i~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (< ~i~0 ~n~0))) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= ~j~0 ~i~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 7932#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~j~0 ~i1~0) (not (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 0)) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)))), Black: 7944#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~j~0 ~i1~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))) (forall ((v_ArrVal_372 (Array Int Int))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_372) ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_372) ~f~0.base) (+ ~f~0.offset (* (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_372) ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4))))) (not (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 0))), Black: 9602#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (< ~i~0 ~n~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= ~j~0 ~i~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 7926#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~j~0 ~i1~0) (forall ((v_ArrVal_372 (Array Int Int))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_372) ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_372) ~f~0.base) (+ ~f~0.offset (* (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_372) ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4))))) (not (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 0)) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)))), Black: 9562#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 9586#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= ~j~0 ~i~0) (<= ~i~0 ~j~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 9635#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= ~j~0 ~i~0) (<= ~i~0 ~j~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 58#L71true, Black: 9637#(and (or (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (<= ~n~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n~0 2)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (or (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n~0 2)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (or (< ~n~0 2) (= (* ~i1~0 4) (* ~j~0 4))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 9633#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (or (and (<= 0 ~i2~0) (<= (+ (* ~j~0 4) ~f~0.offset) 0) (<= (+ (* ~i2~0 4) ~f~0.offset) 0)) (and (<= ~i2~0 1) (= (+ (* ~j~0 4) ~f~0.offset) 4) (<= 1 ~i2~0))) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= 0 ~j~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (< ~i1~0 ~n~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (= (* ~i1~0 4) (* ~j~0 4))), 89#L97true, 10867#true, 12931#true, Black: 1144#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1198#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (exists ((v_~j~0_30 Int)) (and (< v_~j~0_30 ~n~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_30 4) ~f~0.offset))) (<= 0 v_~j~0_30))) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1) (= ~j~0 ~i~0) (= (+ (* ~i2~0 4) ~f~0.offset) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 189#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 1273#(and (<= 1 ~n1~0) (= ~tmp1~0 0) (<= ~n1~0 ~n2~0) (<= ~n1~0 ~tmp2~0)), Black: 1202#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (exists ((v_~j~0_30 Int)) (and (< v_~j~0_30 ~n~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_30 4) ~f~0.offset))) (<= 0 v_~j~0_30))) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1) (= (+ (* ~i2~0 4) ~f~0.offset) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1186#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= 0 ~j~0) (< ~j~0 ~n~0) (<= ~n~0 1) (= (+ (* ~i2~0 4) ~f~0.offset) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 8502#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~j~0 ~i1~0) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), Black: 1150#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 12407#true, 2293#true, Black: 1180#(and (<= ~i~0 0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (exists ((v_~j~0_30 Int)) (and (< v_~j~0_30 ~n~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_30 4) ~f~0.offset))) (<= 0 v_~j~0_30))) (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1148#(and (= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1176#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= 0 ~j~0) (< ~j~0 ~n~0) (<= ~n~0 1) (= ~j~0 ~i~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 3299#true, Black: 3282#(and (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))) (= ~j~0 ~i~0)), Black: 3286#(and (= ~j~0 ~i1~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))) (= ~j~0 ~i~0)), Black: 2866#(= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))), Black: 1190#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= 0 ~j~0) (< ~j~0 ~n~0) (<= ~n~0 1) (= (+ (* ~i2~0 4) ~f~0.offset) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4823#(and (or (< ~n~0 2) (= (* ~i1~0 4) (* ~j~0 4))) (or (= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))) (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (<= ~n~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))))), Black: 4817#(and (or (< ~i~0 0) (<= ~n~0 ~i~0) (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (<= ~n~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)))) (or (< ~n~0 2) (= (* ~i1~0 4) (* ~j~0 4)))), Black: 3709#(exists ((v_~j~0_42 Int)) (and (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_42 4) ~f~0.offset))) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_42 4) ~f~0.offset))))), Black: 3805#(and (= ~j~0 ~i1~0) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)))), Black: 3716#(exists ((v_~j~0_42 Int)) (and (= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_42 4) ~f~0.offset)) 4) ~f~0.offset)) ~j~0) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_42 4) ~f~0.offset))))), 159#L126true, Black: 2274#(and (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (= (* ~i1~0 4) (* ~j~0 4))), Black: 2272#(and (= ~j~0 ~i~0) (= (* ~i1~0 4) (* ~j~0 4))), 1142#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1314#(= ~j~0 ~i~0), Black: 10848#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (exists ((v_~j~0_70 Int)) (and (= (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_70 4) ~f~0.offset)) ~j~0) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_70 4) ~f~0.offset)) ~i~0))) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), Black: 12382#(and (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))) (= ~j~0 ~i~0)), 1283#true, Black: 12380#(and (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (= (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset)))), Black: 2276#(and (= (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))) (= ~j~0 ~i~0)), Black: 12000#(= (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset))), Black: 11964#(= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))), Black: 9598#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (and (or (not (<= 0 ~i~0)) (not (< ~i~0 ~n~0))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (and (<= 0 ~i~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (< ~i~0 ~n~0))) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= 0 ~i~0) (< ~i~0 ~n~0)) (and (or (not (<= 0 ~i~0)) (not (< ~i~0 ~n~0))) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= ~j~0 ~i~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 7916#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 0))), Black: 9648#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (or (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (<= ~n~0 ~j~0) (< ~j~0 0)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1259#(= ~tmp1~0 0), Black: 9629#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n~0 2)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (or (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n~0 2)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (or (< ~n~0 2) (= (* ~i1~0 4) (* ~j~0 4))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1264#(and (= ~n2~0 0) (= ~tmp1~0 0)), Black: 9644#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (< ~i~0 ~n~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= ~j~0 ~i~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1267#(and (<= 1 ~n1~0) (= ~n2~0 0) (= ~tmp1~0 0)), Black: 11262#(= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))), 9578#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1258#(= ~n2~0 0), Black: 9566#(and (<= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 11379#(and (exists ((~i1~0 Int)) (and (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset))))) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset)))), Black: 9627#(and (or (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (<= ~n~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n~0 2)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (or (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n~0 2)) (forall ((v_ArrVal_448 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ ~f~0.offset (* (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ (* ~i~0 4) ~f~0.offset))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (<= ~n~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))))) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (or (< ~n~0 2) (= (* ~i1~0 4) (* ~j~0 4))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 11377#(and (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))) (= ~j~0 ~i~0)), Black: 9646#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (or (and (<= 0 ~i2~0) (<= (+ (* ~j~0 4) ~f~0.offset) 0) (<= 0 ~j~0) (<= (+ (* ~i2~0 4) ~f~0.offset) 0)) (and (<= ~i2~0 1) (= (+ (* ~j~0 4) ~f~0.offset) 4) (<= 1 ~i2~0))) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|))]) [2022-12-11 19:36:21,480 INFO L382 tUnfolder$Statistics]: this new event has 128 ancestors and is cut-off event [2022-12-11 19:36:21,480 INFO L385 tUnfolder$Statistics]: existing Event has 128 ancestors and is cut-off event [2022-12-11 19:36:21,480 INFO L385 tUnfolder$Statistics]: existing Event has 128 ancestors and is cut-off event [2022-12-11 19:36:21,480 INFO L385 tUnfolder$Statistics]: existing Event has 128 ancestors and is cut-off event [2022-12-11 19:36:22,141 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([514] L94-->L97: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| (ite (= (mod v_~e1~0_10 256) 0) 1 0))) InVars {~e1~0=v_~e1~0_10} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~e1~0=v_~e1~0_10} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][163], [Black: 11383#(and (exists ((~i1~0 Int)) (and (= (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) ~i2~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset))))) (= ~j~0 ~i~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset)))), Black: 12925#(and (exists ((~i1~0 Int)) (and (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 130#L156-1true, Black: 11269#(= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset))), Black: 12811#(exists ((~i1~0 Int)) (and (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))))), Black: 9622#(and (or (< ~i~0 0) (<= ~n~0 ~i~0) (forall ((v_ArrVal_448 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ ~f~0.offset (* (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ (* ~i~0 4) ~f~0.offset))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (<= ~n~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)))))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n~0 2)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (or (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n~0 2)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (or (< ~n~0 2) (= (* ~i1~0 4) (* ~j~0 4))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 9608#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= ~j~0 ~i~0) (< ~i1~0 ~n~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (= (* ~i1~0 4) (* ~j~0 4))), Black: 12927#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (exists ((~i1~0 Int)) (and (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1281#(= ~e2~0 1), Black: 11381#(and (exists ((~i1~0 Int)) (and (= (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) ~i2~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset))))) (exists ((~i1~0 Int)) (and (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset))))) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset)))), Black: 9642#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (exists ((v_~j~0_63 Int)) (and (<= 0 v_~j~0_63) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_63 4) ~f~0.offset)) ~i~0) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_63 4) ~f~0.offset)) ~j~0) (< v_~j~0_63 ~n~0))) (< ~i~0 ~n~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 9652#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= ~j~0 ~i~0) (<= ~i~0 ~j~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (= (* ~i1~0 4) (* ~j~0 4))), Black: 9620#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (or (and (<= 0 ~i2~0) (<= (+ (* ~j~0 4) ~f~0.offset) 0) (<= (+ (* ~i2~0 4) ~f~0.offset) 0)) (and (<= ~i2~0 1) (= (+ (* ~j~0 4) ~f~0.offset) 4) (<= 1 ~i2~0))) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= 0 ~j~0) (< ~j~0 ~n~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 153#L74true, Black: 9568#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 9594#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (and (or (not (<= 0 ~i~0)) (not (< ~i~0 ~n~0))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (and (<= 0 ~i~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (< ~i~0 ~n~0))) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= ~j~0 ~i~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 7930#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 0)) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) ~j~0)), Black: 7938#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))) (not (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 0)) (= ~j~0 ~i~0)), Black: 9590#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (and (or (not (<= 0 ~i~0)) (not (< ~i~0 ~n~0))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (and (<= 0 ~i~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (< ~i~0 ~n~0))) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= ~j~0 ~i~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 7932#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~j~0 ~i1~0) (not (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 0)) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)))), Black: 7944#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~j~0 ~i1~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))) (forall ((v_ArrVal_372 (Array Int Int))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_372) ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_372) ~f~0.base) (+ ~f~0.offset (* (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_372) ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4))))) (not (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 0))), Black: 7926#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~j~0 ~i1~0) (forall ((v_ArrVal_372 (Array Int Int))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_372) ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_372) ~f~0.base) (+ ~f~0.offset (* (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_372) ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4))))) (not (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 0)) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)))), Black: 9602#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (< ~i~0 ~n~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= ~j~0 ~i~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 9562#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 9586#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= ~j~0 ~i~0) (<= ~i~0 ~j~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 9635#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= ~j~0 ~i~0) (<= ~i~0 ~j~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 9637#(and (or (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (<= ~n~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n~0 2)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (or (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n~0 2)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (or (< ~n~0 2) (= (* ~i1~0 4) (* ~j~0 4))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 9633#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (or (and (<= 0 ~i2~0) (<= (+ (* ~j~0 4) ~f~0.offset) 0) (<= (+ (* ~i2~0 4) ~f~0.offset) 0)) (and (<= ~i2~0 1) (= (+ (* ~j~0 4) ~f~0.offset) 4) (<= 1 ~i2~0))) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= 0 ~j~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (< ~i1~0 ~n~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (= (* ~i1~0 4) (* ~j~0 4))), 89#L97true, 10867#true, 12931#true, Black: 1144#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 189#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 1198#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (exists ((v_~j~0_30 Int)) (and (< v_~j~0_30 ~n~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_30 4) ~f~0.offset))) (<= 0 v_~j~0_30))) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1) (= ~j~0 ~i~0) (= (+ (* ~i2~0 4) ~f~0.offset) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 1273#(and (<= 1 ~n1~0) (= ~tmp1~0 0) (<= ~n1~0 ~n2~0) (<= ~n1~0 ~tmp2~0)), Black: 1202#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (exists ((v_~j~0_30 Int)) (and (< v_~j~0_30 ~n~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_30 4) ~f~0.offset))) (<= 0 v_~j~0_30))) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1) (= (+ (* ~i2~0 4) ~f~0.offset) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1186#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= 0 ~j~0) (< ~j~0 ~n~0) (<= ~n~0 1) (= (+ (* ~i2~0 4) ~f~0.offset) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 8502#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~j~0 ~i1~0) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), Black: 1150#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 12407#true, 2293#true, Black: 1180#(and (<= ~i~0 0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (exists ((v_~j~0_30 Int)) (and (< v_~j~0_30 ~n~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_30 4) ~f~0.offset))) (<= 0 v_~j~0_30))) (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1148#(and (= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1176#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= 0 ~j~0) (< ~j~0 ~n~0) (<= ~n~0 1) (= ~j~0 ~i~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 3299#true, Black: 3282#(and (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))) (= ~j~0 ~i~0)), Black: 3286#(and (= ~j~0 ~i1~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))) (= ~j~0 ~i~0)), Black: 2866#(= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))), Black: 1190#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= 0 ~j~0) (< ~j~0 ~n~0) (<= ~n~0 1) (= (+ (* ~i2~0 4) ~f~0.offset) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4823#(and (or (< ~n~0 2) (= (* ~i1~0 4) (* ~j~0 4))) (or (= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))) (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (<= ~n~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))))), Black: 4817#(and (or (< ~i~0 0) (<= ~n~0 ~i~0) (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (<= ~n~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)))) (or (< ~n~0 2) (= (* ~i1~0 4) (* ~j~0 4)))), Black: 3709#(exists ((v_~j~0_42 Int)) (and (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_42 4) ~f~0.offset))) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_42 4) ~f~0.offset))))), Black: 3805#(and (= ~j~0 ~i1~0) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)))), Black: 3716#(exists ((v_~j~0_42 Int)) (and (= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_42 4) ~f~0.offset)) 4) ~f~0.offset)) ~j~0) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_42 4) ~f~0.offset))))), 159#L126true, Black: 2274#(and (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (= (* ~i1~0 4) (* ~j~0 4))), Black: 2272#(and (= ~j~0 ~i~0) (= (* ~i1~0 4) (* ~j~0 4))), 1142#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1314#(= ~j~0 ~i~0), Black: 10848#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (exists ((v_~j~0_70 Int)) (and (= (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_70 4) ~f~0.offset)) ~j~0) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_70 4) ~f~0.offset)) ~i~0))) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), Black: 12382#(and (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))) (= ~j~0 ~i~0)), 1283#true, Black: 12380#(and (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (= (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset)))), Black: 2276#(and (= (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))) (= ~j~0 ~i~0)), Black: 12000#(= (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset))), Black: 11964#(= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))), Black: 9598#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (and (or (not (<= 0 ~i~0)) (not (< ~i~0 ~n~0))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (and (<= 0 ~i~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (< ~i~0 ~n~0))) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= 0 ~i~0) (< ~i~0 ~n~0)) (and (or (not (<= 0 ~i~0)) (not (< ~i~0 ~n~0))) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= ~j~0 ~i~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 7916#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 0))), Black: 9648#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (or (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (<= ~n~0 ~j~0) (< ~j~0 0)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1259#(= ~tmp1~0 0), Black: 9629#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n~0 2)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (or (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n~0 2)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (or (< ~n~0 2) (= (* ~i1~0 4) (* ~j~0 4))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1264#(and (= ~n2~0 0) (= ~tmp1~0 0)), Black: 9644#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (< ~i~0 ~n~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= ~j~0 ~i~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1267#(and (<= 1 ~n1~0) (= ~n2~0 0) (= ~tmp1~0 0)), Black: 11262#(= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))), 9578#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1258#(= ~n2~0 0), Black: 9566#(and (<= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 9627#(and (or (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (<= ~n~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n~0 2)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (or (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n~0 2)) (forall ((v_ArrVal_448 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ ~f~0.offset (* (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ (* ~i~0 4) ~f~0.offset))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (<= ~n~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))))) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (or (< ~n~0 2) (= (* ~i1~0 4) (* ~j~0 4))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 11379#(and (exists ((~i1~0 Int)) (and (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset))))) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset)))), Black: 11377#(and (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))) (= ~j~0 ~i~0)), Black: 9646#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (or (and (<= 0 ~i2~0) (<= (+ (* ~j~0 4) ~f~0.offset) 0) (<= 0 ~j~0) (<= (+ (* ~i2~0 4) ~f~0.offset) 0)) (and (<= ~i2~0 1) (= (+ (* ~j~0 4) ~f~0.offset) 4) (<= 1 ~i2~0))) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|))]) [2022-12-11 19:36:22,141 INFO L382 tUnfolder$Statistics]: this new event has 129 ancestors and is cut-off event [2022-12-11 19:36:22,141 INFO L385 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-12-11 19:36:22,141 INFO L385 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-12-11 19:36:22,141 INFO L385 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-12-11 19:36:25,524 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([514] L94-->L97: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| (ite (= (mod v_~e1~0_10 256) 0) 1 0))) InVars {~e1~0=v_~e1~0_10} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~e1~0=v_~e1~0_10} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][163], [Black: 11383#(and (exists ((~i1~0 Int)) (and (= (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) ~i2~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset))))) (= ~j~0 ~i~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset)))), Black: 12925#(and (exists ((~i1~0 Int)) (and (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 130#L156-1true, Black: 9622#(and (or (< ~i~0 0) (<= ~n~0 ~i~0) (forall ((v_ArrVal_448 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ ~f~0.offset (* (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ (* ~i~0 4) ~f~0.offset))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (<= ~n~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)))))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n~0 2)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (or (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n~0 2)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (or (< ~n~0 2) (= (* ~i1~0 4) (* ~j~0 4))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 11269#(= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset))), Black: 12811#(exists ((~i1~0 Int)) (and (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))))), Black: 9608#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= ~j~0 ~i~0) (< ~i1~0 ~n~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (= (* ~i1~0 4) (* ~j~0 4))), Black: 12927#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (exists ((~i1~0 Int)) (and (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1281#(= ~e2~0 1), Black: 11381#(and (exists ((~i1~0 Int)) (and (= (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) ~i2~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset))))) (exists ((~i1~0 Int)) (and (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset))))) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset)))), Black: 9642#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (exists ((v_~j~0_63 Int)) (and (<= 0 v_~j~0_63) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_63 4) ~f~0.offset)) ~i~0) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_63 4) ~f~0.offset)) ~j~0) (< v_~j~0_63 ~n~0))) (< ~i~0 ~n~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 9596#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n~0 2)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (or (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n~0 2)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 9652#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= ~j~0 ~i~0) (<= ~i~0 ~j~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (= (* ~i1~0 4) (* ~j~0 4))), Black: 9620#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (or (and (<= 0 ~i2~0) (<= (+ (* ~j~0 4) ~f~0.offset) 0) (<= (+ (* ~i2~0 4) ~f~0.offset) 0)) (and (<= ~i2~0 1) (= (+ (* ~j~0 4) ~f~0.offset) 4) (<= 1 ~i2~0))) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= 0 ~j~0) (< ~j~0 ~n~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 9568#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 9594#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (and (or (not (<= 0 ~i~0)) (not (< ~i~0 ~n~0))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (and (<= 0 ~i~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (< ~i~0 ~n~0))) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= ~j~0 ~i~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 7930#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 0)) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) ~j~0)), Black: 9590#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (and (or (not (<= 0 ~i~0)) (not (< ~i~0 ~n~0))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (and (<= 0 ~i~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (< ~i~0 ~n~0))) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= ~j~0 ~i~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 7938#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))) (not (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 0)) (= ~j~0 ~i~0)), Black: 7932#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~j~0 ~i1~0) (not (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 0)) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)))), Black: 7944#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~j~0 ~i1~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))) (forall ((v_ArrVal_372 (Array Int Int))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_372) ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_372) ~f~0.base) (+ ~f~0.offset (* (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_372) ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4))))) (not (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 0))), Black: 7926#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~j~0 ~i1~0) (forall ((v_ArrVal_372 (Array Int Int))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_372) ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_372) ~f~0.base) (+ ~f~0.offset (* (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_372) ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4))))) (not (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 0)) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)))), Black: 9602#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (< ~i~0 ~n~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= ~j~0 ~i~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 9562#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 9586#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= ~j~0 ~i~0) (<= ~i~0 ~j~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 9635#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= ~j~0 ~i~0) (<= ~i~0 ~j~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 58#L71true, Black: 9637#(and (or (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (<= ~n~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n~0 2)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (or (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n~0 2)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (or (< ~n~0 2) (= (* ~i1~0 4) (* ~j~0 4))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 9633#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (or (and (<= 0 ~i2~0) (<= (+ (* ~j~0 4) ~f~0.offset) 0) (<= (+ (* ~i2~0 4) ~f~0.offset) 0)) (and (<= ~i2~0 1) (= (+ (* ~j~0 4) ~f~0.offset) 4) (<= 1 ~i2~0))) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= 0 ~j~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (< ~i1~0 ~n~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (= (* ~i1~0 4) (* ~j~0 4))), 89#L97true, 10867#true, 12931#true, Black: 1144#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1198#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (exists ((v_~j~0_30 Int)) (and (< v_~j~0_30 ~n~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_30 4) ~f~0.offset))) (<= 0 v_~j~0_30))) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1) (= ~j~0 ~i~0) (= (+ (* ~i2~0 4) ~f~0.offset) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 189#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 1273#(and (<= 1 ~n1~0) (= ~tmp1~0 0) (<= ~n1~0 ~n2~0) (<= ~n1~0 ~tmp2~0)), Black: 1202#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (exists ((v_~j~0_30 Int)) (and (< v_~j~0_30 ~n~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_30 4) ~f~0.offset))) (<= 0 v_~j~0_30))) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1) (= (+ (* ~i2~0 4) ~f~0.offset) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1186#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= 0 ~j~0) (< ~j~0 ~n~0) (<= ~n~0 1) (= (+ (* ~i2~0 4) ~f~0.offset) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 8502#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~j~0 ~i1~0) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), Black: 1150#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 12407#true, 2293#true, Black: 1180#(and (<= ~i~0 0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (exists ((v_~j~0_30 Int)) (and (< v_~j~0_30 ~n~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_30 4) ~f~0.offset))) (<= 0 v_~j~0_30))) (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 19#L123true, Black: 1148#(and (= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1176#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= 0 ~j~0) (< ~j~0 ~n~0) (<= ~n~0 1) (= ~j~0 ~i~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 3299#true, Black: 3282#(and (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))) (= ~j~0 ~i~0)), Black: 3286#(and (= ~j~0 ~i1~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))) (= ~j~0 ~i~0)), Black: 2866#(= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))), Black: 1190#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= 0 ~j~0) (< ~j~0 ~n~0) (<= ~n~0 1) (= (+ (* ~i2~0 4) ~f~0.offset) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4823#(and (or (< ~n~0 2) (= (* ~i1~0 4) (* ~j~0 4))) (or (= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))) (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (<= ~n~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))))), Black: 4817#(and (or (< ~i~0 0) (<= ~n~0 ~i~0) (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (<= ~n~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)))) (or (< ~n~0 2) (= (* ~i1~0 4) (* ~j~0 4)))), Black: 3709#(exists ((v_~j~0_42 Int)) (and (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_42 4) ~f~0.offset))) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_42 4) ~f~0.offset))))), Black: 3805#(and (= ~j~0 ~i1~0) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)))), Black: 3716#(exists ((v_~j~0_42 Int)) (and (= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_42 4) ~f~0.offset)) 4) ~f~0.offset)) ~j~0) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_42 4) ~f~0.offset))))), Black: 2274#(and (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (= (* ~i1~0 4) (* ~j~0 4))), Black: 2272#(and (= ~j~0 ~i~0) (= (* ~i1~0 4) (* ~j~0 4))), 1142#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1314#(= ~j~0 ~i~0), Black: 10848#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (exists ((v_~j~0_70 Int)) (and (= (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_70 4) ~f~0.offset)) ~j~0) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_70 4) ~f~0.offset)) ~i~0))) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), Black: 12382#(and (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))) (= ~j~0 ~i~0)), Black: 12380#(and (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (= (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset)))), Black: 2276#(and (= (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))) (= ~j~0 ~i~0)), 1283#true, Black: 12000#(= (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset))), Black: 11964#(= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))), 7916#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 0))), Black: 9598#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (and (or (not (<= 0 ~i~0)) (not (< ~i~0 ~n~0))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (and (<= 0 ~i~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (< ~i~0 ~n~0))) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= 0 ~i~0) (< ~i~0 ~n~0)) (and (or (not (<= 0 ~i~0)) (not (< ~i~0 ~n~0))) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= ~j~0 ~i~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 9648#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (or (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (<= ~n~0 ~j~0) (< ~j~0 0)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1259#(= ~tmp1~0 0), Black: 9629#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n~0 2)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (or (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n~0 2)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (or (< ~n~0 2) (= (* ~i1~0 4) (* ~j~0 4))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1264#(and (= ~n2~0 0) (= ~tmp1~0 0)), Black: 9644#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (< ~i~0 ~n~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= ~j~0 ~i~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 11262#(= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))), Black: 1267#(and (<= 1 ~n1~0) (= ~n2~0 0) (= ~tmp1~0 0)), Black: 1258#(= ~n2~0 0), Black: 9566#(and (<= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 9627#(and (or (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (<= ~n~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n~0 2)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (or (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n~0 2)) (forall ((v_ArrVal_448 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ ~f~0.offset (* (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ (* ~i~0 4) ~f~0.offset))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (<= ~n~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))))) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (or (< ~n~0 2) (= (* ~i1~0 4) (* ~j~0 4))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 11379#(and (exists ((~i1~0 Int)) (and (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset))))) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset)))), Black: 11377#(and (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))) (= ~j~0 ~i~0)), Black: 9646#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (or (and (<= 0 ~i2~0) (<= (+ (* ~j~0 4) ~f~0.offset) 0) (<= 0 ~j~0) (<= (+ (* ~i2~0 4) ~f~0.offset) 0)) (and (<= ~i2~0 1) (= (+ (* ~j~0 4) ~f~0.offset) 4) (<= 1 ~i2~0))) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|))]) [2022-12-11 19:36:25,525 INFO L382 tUnfolder$Statistics]: this new event has 134 ancestors and is cut-off event [2022-12-11 19:36:25,525 INFO L385 tUnfolder$Statistics]: existing Event has 134 ancestors and is cut-off event [2022-12-11 19:36:25,525 INFO L385 tUnfolder$Statistics]: existing Event has 134 ancestors and is cut-off event [2022-12-11 19:36:25,525 INFO L385 tUnfolder$Statistics]: existing Event has 134 ancestors and is cut-off event [2022-12-11 19:36:26,243 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([514] L94-->L97: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| (ite (= (mod v_~e1~0_10 256) 0) 1 0))) InVars {~e1~0=v_~e1~0_10} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~e1~0=v_~e1~0_10} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][163], [Black: 11383#(and (exists ((~i1~0 Int)) (and (= (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) ~i2~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset))))) (= ~j~0 ~i~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset)))), Black: 12925#(and (exists ((~i1~0 Int)) (and (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 130#L156-1true, Black: 11269#(= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset))), Black: 12811#(exists ((~i1~0 Int)) (and (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))))), Black: 9622#(and (or (< ~i~0 0) (<= ~n~0 ~i~0) (forall ((v_ArrVal_448 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ ~f~0.offset (* (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ (* ~i~0 4) ~f~0.offset))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (<= ~n~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)))))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n~0 2)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (or (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n~0 2)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (or (< ~n~0 2) (= (* ~i1~0 4) (* ~j~0 4))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 9608#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= ~j~0 ~i~0) (< ~i1~0 ~n~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (= (* ~i1~0 4) (* ~j~0 4))), Black: 12927#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (exists ((~i1~0 Int)) (and (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1281#(= ~e2~0 1), Black: 11381#(and (exists ((~i1~0 Int)) (and (= (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) ~i2~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset))))) (exists ((~i1~0 Int)) (and (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset))))) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset)))), Black: 9642#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (exists ((v_~j~0_63 Int)) (and (<= 0 v_~j~0_63) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_63 4) ~f~0.offset)) ~i~0) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_63 4) ~f~0.offset)) ~j~0) (< v_~j~0_63 ~n~0))) (< ~i~0 ~n~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 9596#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n~0 2)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (or (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n~0 2)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 9652#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= ~j~0 ~i~0) (<= ~i~0 ~j~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (= (* ~i1~0 4) (* ~j~0 4))), Black: 9620#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (or (and (<= 0 ~i2~0) (<= (+ (* ~j~0 4) ~f~0.offset) 0) (<= (+ (* ~i2~0 4) ~f~0.offset) 0)) (and (<= ~i2~0 1) (= (+ (* ~j~0 4) ~f~0.offset) 4) (<= 1 ~i2~0))) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= 0 ~j~0) (< ~j~0 ~n~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 153#L74true, Black: 9568#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 9594#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (and (or (not (<= 0 ~i~0)) (not (< ~i~0 ~n~0))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (and (<= 0 ~i~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (< ~i~0 ~n~0))) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= ~j~0 ~i~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 7930#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 0)) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) ~j~0)), Black: 9590#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (and (or (not (<= 0 ~i~0)) (not (< ~i~0 ~n~0))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (and (<= 0 ~i~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (< ~i~0 ~n~0))) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= ~j~0 ~i~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 7938#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))) (not (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 0)) (= ~j~0 ~i~0)), Black: 7932#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~j~0 ~i1~0) (not (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 0)) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)))), Black: 7944#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~j~0 ~i1~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))) (forall ((v_ArrVal_372 (Array Int Int))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_372) ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_372) ~f~0.base) (+ ~f~0.offset (* (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_372) ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4))))) (not (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 0))), Black: 9602#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (< ~i~0 ~n~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= ~j~0 ~i~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 7926#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~j~0 ~i1~0) (forall ((v_ArrVal_372 (Array Int Int))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_372) ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_372) ~f~0.base) (+ ~f~0.offset (* (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_372) ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4))))) (not (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 0)) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)))), Black: 9562#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 9586#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= ~j~0 ~i~0) (<= ~i~0 ~j~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 9635#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= ~j~0 ~i~0) (<= ~i~0 ~j~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 9637#(and (or (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (<= ~n~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n~0 2)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (or (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n~0 2)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (or (< ~n~0 2) (= (* ~i1~0 4) (* ~j~0 4))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 9633#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (or (and (<= 0 ~i2~0) (<= (+ (* ~j~0 4) ~f~0.offset) 0) (<= (+ (* ~i2~0 4) ~f~0.offset) 0)) (and (<= ~i2~0 1) (= (+ (* ~j~0 4) ~f~0.offset) 4) (<= 1 ~i2~0))) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= 0 ~j~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (< ~i1~0 ~n~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (= (* ~i1~0 4) (* ~j~0 4))), 89#L97true, 10867#true, 12931#true, Black: 1144#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1198#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (exists ((v_~j~0_30 Int)) (and (< v_~j~0_30 ~n~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_30 4) ~f~0.offset))) (<= 0 v_~j~0_30))) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1) (= ~j~0 ~i~0) (= (+ (* ~i2~0 4) ~f~0.offset) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 189#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 1202#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (exists ((v_~j~0_30 Int)) (and (< v_~j~0_30 ~n~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_30 4) ~f~0.offset))) (<= 0 v_~j~0_30))) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1) (= (+ (* ~i2~0 4) ~f~0.offset) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 1273#(and (<= 1 ~n1~0) (= ~tmp1~0 0) (<= ~n1~0 ~n2~0) (<= ~n1~0 ~tmp2~0)), Black: 1186#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= 0 ~j~0) (< ~j~0 ~n~0) (<= ~n~0 1) (= (+ (* ~i2~0 4) ~f~0.offset) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 8502#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~j~0 ~i1~0) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), Black: 1150#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 12407#true, 2293#true, Black: 1180#(and (<= ~i~0 0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (exists ((v_~j~0_30 Int)) (and (< v_~j~0_30 ~n~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_30 4) ~f~0.offset))) (<= 0 v_~j~0_30))) (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 19#L123true, Black: 1148#(and (= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1176#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= 0 ~j~0) (< ~j~0 ~n~0) (<= ~n~0 1) (= ~j~0 ~i~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 3299#true, Black: 3282#(and (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))) (= ~j~0 ~i~0)), Black: 3286#(and (= ~j~0 ~i1~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))) (= ~j~0 ~i~0)), Black: 2866#(= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))), Black: 1190#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= 0 ~j~0) (< ~j~0 ~n~0) (<= ~n~0 1) (= (+ (* ~i2~0 4) ~f~0.offset) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4823#(and (or (< ~n~0 2) (= (* ~i1~0 4) (* ~j~0 4))) (or (= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))) (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (<= ~n~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))))), Black: 4817#(and (or (< ~i~0 0) (<= ~n~0 ~i~0) (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (<= ~n~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)))) (or (< ~n~0 2) (= (* ~i1~0 4) (* ~j~0 4)))), Black: 3709#(exists ((v_~j~0_42 Int)) (and (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_42 4) ~f~0.offset))) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_42 4) ~f~0.offset))))), Black: 3805#(and (= ~j~0 ~i1~0) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)))), Black: 3716#(exists ((v_~j~0_42 Int)) (and (= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_42 4) ~f~0.offset)) 4) ~f~0.offset)) ~j~0) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_42 4) ~f~0.offset))))), Black: 2274#(and (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (= (* ~i1~0 4) (* ~j~0 4))), Black: 2272#(and (= ~j~0 ~i~0) (= (* ~i1~0 4) (* ~j~0 4))), 1142#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1314#(= ~j~0 ~i~0), Black: 10848#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (exists ((v_~j~0_70 Int)) (and (= (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_70 4) ~f~0.offset)) ~j~0) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_70 4) ~f~0.offset)) ~i~0))) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), Black: 12382#(and (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))) (= ~j~0 ~i~0)), Black: 12380#(and (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (= (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset)))), Black: 2276#(and (= (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))) (= ~j~0 ~i~0)), 1283#true, Black: 12000#(= (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset))), Black: 11964#(= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))), 7916#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 0))), Black: 9598#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (and (or (not (<= 0 ~i~0)) (not (< ~i~0 ~n~0))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (and (<= 0 ~i~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (< ~i~0 ~n~0))) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= 0 ~i~0) (< ~i~0 ~n~0)) (and (or (not (<= 0 ~i~0)) (not (< ~i~0 ~n~0))) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= ~j~0 ~i~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 9648#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (or (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (<= ~n~0 ~j~0) (< ~j~0 0)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1259#(= ~tmp1~0 0), Black: 9629#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n~0 2)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (or (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n~0 2)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (or (< ~n~0 2) (= (* ~i1~0 4) (* ~j~0 4))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1264#(and (= ~n2~0 0) (= ~tmp1~0 0)), Black: 9644#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (< ~i~0 ~n~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= ~j~0 ~i~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 11262#(= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))), Black: 1267#(and (<= 1 ~n1~0) (= ~n2~0 0) (= ~tmp1~0 0)), Black: 1258#(= ~n2~0 0), Black: 9566#(and (<= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 11379#(and (exists ((~i1~0 Int)) (and (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset))))) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset)))), Black: 9627#(and (or (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (<= ~n~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n~0 2)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (or (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n~0 2)) (forall ((v_ArrVal_448 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ ~f~0.offset (* (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ (* ~i~0 4) ~f~0.offset))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (<= ~n~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))))) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (or (< ~n~0 2) (= (* ~i1~0 4) (* ~j~0 4))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 11377#(and (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))) (= ~j~0 ~i~0)), Black: 9646#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (or (and (<= 0 ~i2~0) (<= (+ (* ~j~0 4) ~f~0.offset) 0) (<= 0 ~j~0) (<= (+ (* ~i2~0 4) ~f~0.offset) 0)) (and (<= ~i2~0 1) (= (+ (* ~j~0 4) ~f~0.offset) 4) (<= 1 ~i2~0))) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|))]) [2022-12-11 19:36:26,243 INFO L382 tUnfolder$Statistics]: this new event has 135 ancestors and is cut-off event [2022-12-11 19:36:26,243 INFO L385 tUnfolder$Statistics]: existing Event has 135 ancestors and is cut-off event [2022-12-11 19:36:26,243 INFO L385 tUnfolder$Statistics]: existing Event has 135 ancestors and is cut-off event [2022-12-11 19:36:26,243 INFO L385 tUnfolder$Statistics]: existing Event has 135 ancestors and is cut-off event [2022-12-11 19:36:26,244 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([514] L94-->L97: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| (ite (= (mod v_~e1~0_10 256) 0) 1 0))) InVars {~e1~0=v_~e1~0_10} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~e1~0=v_~e1~0_10} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][163], [Black: 11383#(and (exists ((~i1~0 Int)) (and (= (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) ~i2~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset))))) (= ~j~0 ~i~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset)))), Black: 12925#(and (exists ((~i1~0 Int)) (and (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 130#L156-1true, Black: 9622#(and (or (< ~i~0 0) (<= ~n~0 ~i~0) (forall ((v_ArrVal_448 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ ~f~0.offset (* (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ (* ~i~0 4) ~f~0.offset))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (<= ~n~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)))))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n~0 2)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (or (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n~0 2)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (or (< ~n~0 2) (= (* ~i1~0 4) (* ~j~0 4))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 11269#(= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset))), Black: 12811#(exists ((~i1~0 Int)) (and (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))))), Black: 9608#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= ~j~0 ~i~0) (< ~i1~0 ~n~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (= (* ~i1~0 4) (* ~j~0 4))), Black: 12927#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (exists ((~i1~0 Int)) (and (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1281#(= ~e2~0 1), Black: 11381#(and (exists ((~i1~0 Int)) (and (= (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) ~i2~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset))))) (exists ((~i1~0 Int)) (and (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset))))) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset)))), Black: 9642#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (exists ((v_~j~0_63 Int)) (and (<= 0 v_~j~0_63) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_63 4) ~f~0.offset)) ~i~0) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_63 4) ~f~0.offset)) ~j~0) (< v_~j~0_63 ~n~0))) (< ~i~0 ~n~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 9596#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n~0 2)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (or (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n~0 2)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 9652#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= ~j~0 ~i~0) (<= ~i~0 ~j~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (= (* ~i1~0 4) (* ~j~0 4))), Black: 9620#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (or (and (<= 0 ~i2~0) (<= (+ (* ~j~0 4) ~f~0.offset) 0) (<= (+ (* ~i2~0 4) ~f~0.offset) 0)) (and (<= ~i2~0 1) (= (+ (* ~j~0 4) ~f~0.offset) 4) (<= 1 ~i2~0))) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= 0 ~j~0) (< ~j~0 ~n~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 9568#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 9594#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (and (or (not (<= 0 ~i~0)) (not (< ~i~0 ~n~0))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (and (<= 0 ~i~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (< ~i~0 ~n~0))) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= ~j~0 ~i~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 7930#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 0)) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) ~j~0)), Black: 9590#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (and (or (not (<= 0 ~i~0)) (not (< ~i~0 ~n~0))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (and (<= 0 ~i~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (< ~i~0 ~n~0))) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= ~j~0 ~i~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 7938#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))) (not (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 0)) (= ~j~0 ~i~0)), Black: 7932#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~j~0 ~i1~0) (not (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 0)) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)))), Black: 7944#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~j~0 ~i1~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))) (forall ((v_ArrVal_372 (Array Int Int))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_372) ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_372) ~f~0.base) (+ ~f~0.offset (* (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_372) ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4))))) (not (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 0))), Black: 9602#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (< ~i~0 ~n~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= ~j~0 ~i~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 7926#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~j~0 ~i1~0) (forall ((v_ArrVal_372 (Array Int Int))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_372) ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_372) ~f~0.base) (+ ~f~0.offset (* (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_372) ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4))))) (not (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 0)) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)))), Black: 9562#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 9586#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= ~j~0 ~i~0) (<= ~i~0 ~j~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 9635#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= ~j~0 ~i~0) (<= ~i~0 ~j~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 58#L71true, Black: 9637#(and (or (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (<= ~n~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n~0 2)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (or (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n~0 2)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (or (< ~n~0 2) (= (* ~i1~0 4) (* ~j~0 4))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 9633#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (or (and (<= 0 ~i2~0) (<= (+ (* ~j~0 4) ~f~0.offset) 0) (<= (+ (* ~i2~0 4) ~f~0.offset) 0)) (and (<= ~i2~0 1) (= (+ (* ~j~0 4) ~f~0.offset) 4) (<= 1 ~i2~0))) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= 0 ~j~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (< ~i1~0 ~n~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (= (* ~i1~0 4) (* ~j~0 4))), 89#L97true, 10867#true, 12931#true, Black: 1144#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 189#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 1198#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (exists ((v_~j~0_30 Int)) (and (< v_~j~0_30 ~n~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_30 4) ~f~0.offset))) (<= 0 v_~j~0_30))) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1) (= ~j~0 ~i~0) (= (+ (* ~i2~0 4) ~f~0.offset) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 1273#(and (<= 1 ~n1~0) (= ~tmp1~0 0) (<= ~n1~0 ~n2~0) (<= ~n1~0 ~tmp2~0)), Black: 1202#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (exists ((v_~j~0_30 Int)) (and (< v_~j~0_30 ~n~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_30 4) ~f~0.offset))) (<= 0 v_~j~0_30))) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1) (= (+ (* ~i2~0 4) ~f~0.offset) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1186#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= 0 ~j~0) (< ~j~0 ~n~0) (<= ~n~0 1) (= (+ (* ~i2~0 4) ~f~0.offset) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 8502#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~j~0 ~i1~0) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), Black: 1150#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 12407#true, 2293#true, Black: 1180#(and (<= ~i~0 0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (exists ((v_~j~0_30 Int)) (and (< v_~j~0_30 ~n~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_30 4) ~f~0.offset))) (<= 0 v_~j~0_30))) (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1148#(and (= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 3299#true, Black: 1176#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= 0 ~j~0) (< ~j~0 ~n~0) (<= ~n~0 1) (= ~j~0 ~i~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 3282#(and (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))) (= ~j~0 ~i~0)), Black: 3286#(and (= ~j~0 ~i1~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))) (= ~j~0 ~i~0)), Black: 2866#(= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))), Black: 1190#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= 0 ~j~0) (< ~j~0 ~n~0) (<= ~n~0 1) (= (+ (* ~i2~0 4) ~f~0.offset) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4823#(and (or (< ~n~0 2) (= (* ~i1~0 4) (* ~j~0 4))) (or (= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))) (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (<= ~n~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))))), Black: 4817#(and (or (< ~i~0 0) (<= ~n~0 ~i~0) (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (<= ~n~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)))) (or (< ~n~0 2) (= (* ~i1~0 4) (* ~j~0 4)))), Black: 3709#(exists ((v_~j~0_42 Int)) (and (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_42 4) ~f~0.offset))) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_42 4) ~f~0.offset))))), Black: 3805#(and (= ~j~0 ~i1~0) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)))), Black: 3716#(exists ((v_~j~0_42 Int)) (and (= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_42 4) ~f~0.offset)) 4) ~f~0.offset)) ~j~0) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_42 4) ~f~0.offset))))), 159#L126true, Black: 2274#(and (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (= (* ~i1~0 4) (* ~j~0 4))), Black: 2272#(and (= ~j~0 ~i~0) (= (* ~i1~0 4) (* ~j~0 4))), 1142#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1314#(= ~j~0 ~i~0), Black: 10848#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (exists ((v_~j~0_70 Int)) (and (= (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_70 4) ~f~0.offset)) ~j~0) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_70 4) ~f~0.offset)) ~i~0))) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), Black: 12382#(and (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))) (= ~j~0 ~i~0)), Black: 12380#(and (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (= (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset)))), Black: 2276#(and (= (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))) (= ~j~0 ~i~0)), 1283#true, Black: 12000#(= (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset))), Black: 11964#(= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))), Black: 9598#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (and (or (not (<= 0 ~i~0)) (not (< ~i~0 ~n~0))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (and (<= 0 ~i~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (< ~i~0 ~n~0))) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= 0 ~i~0) (< ~i~0 ~n~0)) (and (or (not (<= 0 ~i~0)) (not (< ~i~0 ~n~0))) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= ~j~0 ~i~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 7916#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 0))), Black: 9648#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (or (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (<= ~n~0 ~j~0) (< ~j~0 0)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1259#(= ~tmp1~0 0), Black: 9629#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n~0 2)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (or (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n~0 2)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (or (< ~n~0 2) (= (* ~i1~0 4) (* ~j~0 4))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1264#(and (= ~n2~0 0) (= ~tmp1~0 0)), Black: 9644#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (< ~i~0 ~n~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= ~j~0 ~i~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 11262#(= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))), Black: 1267#(and (<= 1 ~n1~0) (= ~n2~0 0) (= ~tmp1~0 0)), Black: 1258#(= ~n2~0 0), Black: 9566#(and (<= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 11379#(and (exists ((~i1~0 Int)) (and (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset))))) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset)))), Black: 9627#(and (or (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (<= ~n~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n~0 2)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (or (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n~0 2)) (forall ((v_ArrVal_448 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ ~f~0.offset (* (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ (* ~i~0 4) ~f~0.offset))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (<= ~n~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))))) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (or (< ~n~0 2) (= (* ~i1~0 4) (* ~j~0 4))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 11377#(and (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))) (= ~j~0 ~i~0)), Black: 9646#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (or (and (<= 0 ~i2~0) (<= (+ (* ~j~0 4) ~f~0.offset) 0) (<= 0 ~j~0) (<= (+ (* ~i2~0 4) ~f~0.offset) 0)) (and (<= ~i2~0 1) (= (+ (* ~j~0 4) ~f~0.offset) 4) (<= 1 ~i2~0))) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|))]) [2022-12-11 19:36:26,244 INFO L382 tUnfolder$Statistics]: this new event has 135 ancestors and is cut-off event [2022-12-11 19:36:26,244 INFO L385 tUnfolder$Statistics]: existing Event has 135 ancestors and is cut-off event [2022-12-11 19:36:26,244 INFO L385 tUnfolder$Statistics]: existing Event has 135 ancestors and is cut-off event [2022-12-11 19:36:26,244 INFO L385 tUnfolder$Statistics]: existing Event has 135 ancestors and is cut-off event [2022-12-11 19:36:26,846 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([514] L94-->L97: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| (ite (= (mod v_~e1~0_10 256) 0) 1 0))) InVars {~e1~0=v_~e1~0_10} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~e1~0=v_~e1~0_10} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][163], [Black: 11383#(and (exists ((~i1~0 Int)) (and (= (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) ~i2~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset))))) (= ~j~0 ~i~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset)))), Black: 12925#(and (exists ((~i1~0 Int)) (and (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 130#L156-1true, Black: 11269#(= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset))), Black: 12811#(exists ((~i1~0 Int)) (and (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))))), Black: 9622#(and (or (< ~i~0 0) (<= ~n~0 ~i~0) (forall ((v_ArrVal_448 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ ~f~0.offset (* (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ (* ~i~0 4) ~f~0.offset))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (<= ~n~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)))))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n~0 2)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (or (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n~0 2)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (or (< ~n~0 2) (= (* ~i1~0 4) (* ~j~0 4))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 9608#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= ~j~0 ~i~0) (< ~i1~0 ~n~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (= (* ~i1~0 4) (* ~j~0 4))), Black: 12927#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (exists ((~i1~0 Int)) (and (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1281#(= ~e2~0 1), Black: 11381#(and (exists ((~i1~0 Int)) (and (= (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) ~i2~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset))))) (exists ((~i1~0 Int)) (and (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset))))) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset)))), Black: 9642#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (exists ((v_~j~0_63 Int)) (and (<= 0 v_~j~0_63) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_63 4) ~f~0.offset)) ~i~0) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_63 4) ~f~0.offset)) ~j~0) (< v_~j~0_63 ~n~0))) (< ~i~0 ~n~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 9596#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n~0 2)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (or (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n~0 2)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 9652#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= ~j~0 ~i~0) (<= ~i~0 ~j~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (= (* ~i1~0 4) (* ~j~0 4))), Black: 9620#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (or (and (<= 0 ~i2~0) (<= (+ (* ~j~0 4) ~f~0.offset) 0) (<= (+ (* ~i2~0 4) ~f~0.offset) 0)) (and (<= ~i2~0 1) (= (+ (* ~j~0 4) ~f~0.offset) 4) (<= 1 ~i2~0))) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= 0 ~j~0) (< ~j~0 ~n~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 153#L74true, Black: 9568#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 9594#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (and (or (not (<= 0 ~i~0)) (not (< ~i~0 ~n~0))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (and (<= 0 ~i~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (< ~i~0 ~n~0))) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= ~j~0 ~i~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 7930#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 0)) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) ~j~0)), Black: 9590#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (and (or (not (<= 0 ~i~0)) (not (< ~i~0 ~n~0))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (and (<= 0 ~i~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (< ~i~0 ~n~0))) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= ~j~0 ~i~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 7938#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))) (not (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 0)) (= ~j~0 ~i~0)), Black: 7932#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~j~0 ~i1~0) (not (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 0)) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)))), Black: 7944#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~j~0 ~i1~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))) (forall ((v_ArrVal_372 (Array Int Int))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_372) ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_372) ~f~0.base) (+ ~f~0.offset (* (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_372) ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4))))) (not (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 0))), Black: 9602#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (< ~i~0 ~n~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= ~j~0 ~i~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 7926#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~j~0 ~i1~0) (forall ((v_ArrVal_372 (Array Int Int))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_372) ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_372) ~f~0.base) (+ ~f~0.offset (* (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_372) ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4))))) (not (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 0)) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)))), Black: 9562#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 9586#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= ~j~0 ~i~0) (<= ~i~0 ~j~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 9635#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= ~j~0 ~i~0) (<= ~i~0 ~j~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 9637#(and (or (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (<= ~n~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n~0 2)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (or (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n~0 2)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (or (< ~n~0 2) (= (* ~i1~0 4) (* ~j~0 4))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 9633#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (or (and (<= 0 ~i2~0) (<= (+ (* ~j~0 4) ~f~0.offset) 0) (<= (+ (* ~i2~0 4) ~f~0.offset) 0)) (and (<= ~i2~0 1) (= (+ (* ~j~0 4) ~f~0.offset) 4) (<= 1 ~i2~0))) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= 0 ~j~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (< ~i1~0 ~n~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (= (* ~i1~0 4) (* ~j~0 4))), 89#L97true, 10867#true, 12931#true, Black: 1144#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1198#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (exists ((v_~j~0_30 Int)) (and (< v_~j~0_30 ~n~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_30 4) ~f~0.offset))) (<= 0 v_~j~0_30))) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1) (= ~j~0 ~i~0) (= (+ (* ~i2~0 4) ~f~0.offset) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 189#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 1202#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (exists ((v_~j~0_30 Int)) (and (< v_~j~0_30 ~n~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_30 4) ~f~0.offset))) (<= 0 v_~j~0_30))) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1) (= (+ (* ~i2~0 4) ~f~0.offset) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 1273#(and (<= 1 ~n1~0) (= ~tmp1~0 0) (<= ~n1~0 ~n2~0) (<= ~n1~0 ~tmp2~0)), Black: 1186#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= 0 ~j~0) (< ~j~0 ~n~0) (<= ~n~0 1) (= (+ (* ~i2~0 4) ~f~0.offset) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 8502#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~j~0 ~i1~0) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), Black: 1150#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 12407#true, 2293#true, Black: 1180#(and (<= ~i~0 0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (exists ((v_~j~0_30 Int)) (and (< v_~j~0_30 ~n~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_30 4) ~f~0.offset))) (<= 0 v_~j~0_30))) (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1148#(and (= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 3299#true, Black: 1176#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= 0 ~j~0) (< ~j~0 ~n~0) (<= ~n~0 1) (= ~j~0 ~i~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 3282#(and (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))) (= ~j~0 ~i~0)), Black: 3286#(and (= ~j~0 ~i1~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))) (= ~j~0 ~i~0)), Black: 2866#(= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))), Black: 1190#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= 0 ~j~0) (< ~j~0 ~n~0) (<= ~n~0 1) (= (+ (* ~i2~0 4) ~f~0.offset) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4823#(and (or (< ~n~0 2) (= (* ~i1~0 4) (* ~j~0 4))) (or (= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))) (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (<= ~n~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))))), Black: 4817#(and (or (< ~i~0 0) (<= ~n~0 ~i~0) (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (<= ~n~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)))) (or (< ~n~0 2) (= (* ~i1~0 4) (* ~j~0 4)))), Black: 3709#(exists ((v_~j~0_42 Int)) (and (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_42 4) ~f~0.offset))) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_42 4) ~f~0.offset))))), Black: 3805#(and (= ~j~0 ~i1~0) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)))), Black: 3716#(exists ((v_~j~0_42 Int)) (and (= (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_42 4) ~f~0.offset)) 4) ~f~0.offset)) ~j~0) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_42 4) ~f~0.offset))))), 159#L126true, Black: 2274#(and (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (= (* ~i1~0 4) (* ~j~0 4))), Black: 2272#(and (= ~j~0 ~i~0) (= (* ~i1~0 4) (* ~j~0 4))), 1142#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1314#(= ~j~0 ~i~0), Black: 10848#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (exists ((v_~j~0_70 Int)) (and (= (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_70 4) ~f~0.offset)) ~j~0) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_70 4) ~f~0.offset)) ~i~0))) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), Black: 12382#(and (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))) (= ~j~0 ~i~0)), Black: 12380#(and (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (= (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset)))), Black: 2276#(and (= (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))) (= ~j~0 ~i~0)), 1283#true, Black: 12000#(= (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset))), Black: 11964#(= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i2~0 4) ~f~0.offset))), Black: 9598#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (and (or (not (<= 0 ~i~0)) (not (< ~i~0 ~n~0))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (and (<= 0 ~i~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (< ~i~0 ~n~0))) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= 0 ~i~0) (< ~i~0 ~n~0)) (and (or (not (<= 0 ~i~0)) (not (< ~i~0 ~n~0))) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= ~j~0 ~i~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 7916#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 0))), Black: 9648#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (or (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (<= ~n~0 ~j~0) (< ~j~0 0)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1259#(= ~tmp1~0 0), Black: 9629#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n~0 2)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (or (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n~0 2)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (or (< ~n~0 2) (= (* ~i1~0 4) (* ~j~0 4))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1264#(and (= ~n2~0 0) (= ~tmp1~0 0)), Black: 9644#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (< ~i~0 ~n~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= ~j~0 ~i~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 11262#(= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))), Black: 1267#(and (<= 1 ~n1~0) (= ~n2~0 0) (= ~tmp1~0 0)), Black: 1258#(= ~n2~0 0), Black: 9566#(and (<= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 11379#(and (exists ((~i1~0 Int)) (and (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset))))) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset)) 4) ~f~0.offset)))), Black: 9627#(and (or (< (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (<= ~n~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4) ~f~0.offset)))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n~0 2)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (or (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< ~n~0 2)) (forall ((v_ArrVal_448 (Array Int Int))) (or (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ ~f~0.offset (* (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ (* ~i~0 4) ~f~0.offset))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (<= ~n~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_448) ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))))) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (or (< ~n~0 2) (= (* ~i1~0 4) (* ~j~0 4))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 11377#(and (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~i1~0 4) ~f~0.offset))) (= ~j~0 ~i~0)), Black: 9646#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (or (and (<= 0 ~i2~0) (<= (+ (* ~j~0 4) ~f~0.offset) 0) (<= 0 ~j~0) (<= (+ (* ~i2~0 4) ~f~0.offset) 0)) (and (<= ~i2~0 1) (= (+ (* ~j~0 4) ~f~0.offset) 4) (<= 1 ~i2~0))) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|))]) [2022-12-11 19:36:26,846 INFO L382 tUnfolder$Statistics]: this new event has 136 ancestors and is cut-off event [2022-12-11 19:36:26,847 INFO L385 tUnfolder$Statistics]: existing Event has 136 ancestors and is cut-off event [2022-12-11 19:36:26,847 INFO L385 tUnfolder$Statistics]: existing Event has 136 ancestors and is cut-off event [2022-12-11 19:36:26,847 INFO L385 tUnfolder$Statistics]: existing Event has 136 ancestors and is cut-off event [2022-12-11 19:36:31,381 INFO L130 PetriNetUnfolder]: 27938/64723 cut-off events. [2022-12-11 19:36:31,381 INFO L131 PetriNetUnfolder]: For 856811/871965 co-relation queries the response was YES. [2022-12-11 19:36:32,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 372431 conditions, 64723 events. 27938/64723 cut-off events. For 856811/871965 co-relation queries the response was YES. Maximal size of possible extension queue 3307. Compared 809184 event pairs, 10765 based on Foata normal form. 623/62336 useless extension candidates. Maximal degree in co-relation 372353. Up to 17030 conditions per place. [2022-12-11 19:36:33,179 INFO L137 encePairwiseOnDemand]: 160/172 looper letters, 1027 selfloop transitions, 30 changer transitions 23/1257 dead transitions. [2022-12-11 19:36:33,180 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 1257 transitions, 20068 flow [2022-12-11 19:36:33,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 19:36:33,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 19:36:33,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1461 transitions. [2022-12-11 19:36:33,181 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8494186046511628 [2022-12-11 19:36:33,181 INFO L175 Difference]: Start difference. First operand has 347 places, 465 transitions, 5231 flow. Second operand 10 states and 1461 transitions. [2022-12-11 19:36:33,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 1257 transitions, 20068 flow [2022-12-11 19:36:38,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 1257 transitions, 19311 flow, removed 14 selfloop flow, removed 17 redundant places. [2022-12-11 19:36:38,793 INFO L231 Difference]: Finished difference. Result has 334 places, 478 transitions, 5193 flow [2022-12-11 19:36:38,794 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=5026, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=465, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=444, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5193, PETRI_PLACES=334, PETRI_TRANSITIONS=478} [2022-12-11 19:36:38,794 INFO L295 CegarLoopForPetriNet]: 162 programPoint places, 172 predicate places. [2022-12-11 19:36:38,794 INFO L495 AbstractCegarLoop]: Abstraction has has 334 places, 478 transitions, 5193 flow [2022-12-11 19:36:38,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 137.875) internal successors, (1103), 8 states have internal predecessors, (1103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 19:36:38,795 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:36:38,795 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:36:38,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-11 19:36:38,795 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 19:36:38,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:36:38,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1412689375, now seen corresponding path program 20 times [2022-12-11 19:36:38,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:36:38,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552450952] [2022-12-11 19:36:38,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:36:38,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:36:38,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:36:40,476 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 19:36:40,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:36:40,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552450952] [2022-12-11 19:36:40,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552450952] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 19:36:40,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864875198] [2022-12-11 19:36:40,476 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-11 19:36:40,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 19:36:40,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 19:36:40,478 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 19:36:40,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-11 19:36:40,574 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-11 19:36:40,575 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 19:36:40,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 22 conjunts are in the unsatisfiable core [2022-12-11 19:36:40,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 19:36:40,954 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 19:36:40,954 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2022-12-11 19:36:40,964 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-11 19:36:40,965 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-11 19:36:40,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1864875198] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:36:40,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-11 19:36:40,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [32] total 39 [2022-12-11 19:36:40,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390902231] [2022-12-11 19:36:40,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:36:40,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-11 19:36:40,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:36:40,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-11 19:36:40,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1359, Unknown=0, NotChecked=0, Total=1482 [2022-12-11 19:36:40,966 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 172 [2022-12-11 19:36:40,967 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 478 transitions, 5193 flow. Second operand has 12 states, 12 states have (on average 106.83333333333333) internal successors, (1282), 12 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 19:36:40,967 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:36:40,967 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 172 [2022-12-11 19:36:40,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:36:52,562 INFO L130 PetriNetUnfolder]: 22911/61036 cut-off events. [2022-12-11 19:36:52,562 INFO L131 PetriNetUnfolder]: For 656519/659671 co-relation queries the response was YES. [2022-12-11 19:36:53,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 327417 conditions, 61036 events. 22911/61036 cut-off events. For 656519/659671 co-relation queries the response was YES. Maximal size of possible extension queue 3220. Compared 830563 event pairs, 4913 based on Foata normal form. 120/60002 useless extension candidates. Maximal degree in co-relation 327342. Up to 28934 conditions per place. [2022-12-11 19:36:53,950 INFO L137 encePairwiseOnDemand]: 158/172 looper letters, 358 selfloop transitions, 77 changer transitions 12/576 dead transitions. [2022-12-11 19:36:53,950 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 576 transitions, 7110 flow [2022-12-11 19:36:53,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-11 19:36:53,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-11 19:36:53,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1785 transitions. [2022-12-11 19:36:53,952 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6486191860465116 [2022-12-11 19:36:53,952 INFO L175 Difference]: Start difference. First operand has 334 places, 478 transitions, 5193 flow. Second operand 16 states and 1785 transitions. [2022-12-11 19:36:53,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 576 transitions, 7110 flow [2022-12-11 19:36:58,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 576 transitions, 7106 flow, removed 2 selfloop flow, removed 0 redundant places. [2022-12-11 19:36:58,965 INFO L231 Difference]: Finished difference. Result has 356 places, 504 transitions, 5810 flow [2022-12-11 19:36:58,965 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=5189, PETRI_DIFFERENCE_MINUEND_PLACES=334, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=478, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=415, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=5810, PETRI_PLACES=356, PETRI_TRANSITIONS=504} [2022-12-11 19:36:58,966 INFO L295 CegarLoopForPetriNet]: 162 programPoint places, 194 predicate places. [2022-12-11 19:36:58,966 INFO L495 AbstractCegarLoop]: Abstraction has has 356 places, 504 transitions, 5810 flow [2022-12-11 19:36:58,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 106.83333333333333) internal successors, (1282), 12 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 19:36:58,966 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:36:58,966 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:36:58,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-12-11 19:36:59,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 19:36:59,167 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 19:36:59,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:36:59,167 INFO L85 PathProgramCache]: Analyzing trace with hash -669478137, now seen corresponding path program 21 times [2022-12-11 19:36:59,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:36:59,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050505263] [2022-12-11 19:36:59,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:36:59,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:36:59,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:36:59,291 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-11 19:36:59,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:36:59,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050505263] [2022-12-11 19:36:59,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050505263] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:36:59,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:36:59,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-11 19:36:59,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227498128] [2022-12-11 19:36:59,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:36:59,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-11 19:36:59,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:36:59,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-11 19:36:59,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-11 19:36:59,293 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 172 [2022-12-11 19:36:59,294 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 504 transitions, 5810 flow. Second operand has 8 states, 8 states have (on average 137.875) internal successors, (1103), 8 states have internal predecessors, (1103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 19:36:59,294 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:36:59,294 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 172 [2022-12-11 19:36:59,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:37:14,103 INFO L130 PetriNetUnfolder]: 31043/74713 cut-off events. [2022-12-11 19:37:14,103 INFO L131 PetriNetUnfolder]: For 988074/1000429 co-relation queries the response was YES. [2022-12-11 19:37:15,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 433164 conditions, 74713 events. 31043/74713 cut-off events. For 988074/1000429 co-relation queries the response was YES. Maximal size of possible extension queue 3715. Compared 976379 event pairs, 11121 based on Foata normal form. 569/72508 useless extension candidates. Maximal degree in co-relation 433081. Up to 19424 conditions per place. [2022-12-11 19:37:15,791 INFO L137 encePairwiseOnDemand]: 161/172 looper letters, 1208 selfloop transitions, 37 changer transitions 29/1453 dead transitions. [2022-12-11 19:37:15,791 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 1453 transitions, 23803 flow [2022-12-11 19:37:15,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-11 19:37:15,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-11 19:37:15,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1595 transitions. [2022-12-11 19:37:15,794 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8430232558139535 [2022-12-11 19:37:15,794 INFO L175 Difference]: Start difference. First operand has 356 places, 504 transitions, 5810 flow. Second operand 11 states and 1595 transitions. [2022-12-11 19:37:15,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 1453 transitions, 23803 flow [2022-12-11 19:37:23,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 1453 transitions, 23087 flow, removed 309 selfloop flow, removed 7 redundant places. [2022-12-11 19:37:23,817 INFO L231 Difference]: Finished difference. Result has 361 places, 512 transitions, 5777 flow [2022-12-11 19:37:23,817 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=5607, PETRI_DIFFERENCE_MINUEND_PLACES=347, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=504, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=472, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5777, PETRI_PLACES=361, PETRI_TRANSITIONS=512} [2022-12-11 19:37:23,818 INFO L295 CegarLoopForPetriNet]: 162 programPoint places, 199 predicate places. [2022-12-11 19:37:23,818 INFO L495 AbstractCegarLoop]: Abstraction has has 361 places, 512 transitions, 5777 flow [2022-12-11 19:37:23,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 137.875) internal successors, (1103), 8 states have internal predecessors, (1103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 19:37:23,818 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:37:23,818 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:37:23,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-11 19:37:23,818 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 19:37:23,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:37:23,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1453063599, now seen corresponding path program 22 times [2022-12-11 19:37:23,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:37:23,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372300167] [2022-12-11 19:37:23,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:37:23,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:37:23,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:37:28,076 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 19:37:28,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:37:28,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372300167] [2022-12-11 19:37:28,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372300167] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 19:37:28,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201717958] [2022-12-11 19:37:28,077 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-11 19:37:28,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 19:37:28,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 19:37:28,078 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 19:37:28,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-11 19:37:28,170 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-11 19:37:28,171 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 19:37:28,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 46 conjunts are in the unsatisfiable core [2022-12-11 19:37:28,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 19:37:29,162 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 19:37:29,163 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2022-12-11 19:37:29,180 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 19:37:29,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 19:37:29,406 INFO L321 Elim1Store]: treesize reduction 10, result has 85.5 percent of original size [2022-12-11 19:37:29,406 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 78 [2022-12-11 19:37:29,746 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-11 19:37:29,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201717958] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-11 19:37:29,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-11 19:37:29,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [41, 24] total 70 [2022-12-11 19:37:29,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973010047] [2022-12-11 19:37:29,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:37:29,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-11 19:37:29,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:37:29,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-11 19:37:29,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=4545, Unknown=0, NotChecked=0, Total=4830 [2022-12-11 19:37:29,749 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 172 [2022-12-11 19:37:29,750 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 512 transitions, 5777 flow. Second operand has 15 states, 15 states have (on average 103.06666666666666) internal successors, (1546), 15 states have internal predecessors, (1546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 19:37:29,750 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:37:29,750 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 172 [2022-12-11 19:37:29,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:37:43,337 INFO L130 PetriNetUnfolder]: 25838/68821 cut-off events. [2022-12-11 19:37:43,337 INFO L131 PetriNetUnfolder]: For 776855/780732 co-relation queries the response was YES. [2022-12-11 19:37:44,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 380500 conditions, 68821 events. 25838/68821 cut-off events. For 776855/780732 co-relation queries the response was YES. Maximal size of possible extension queue 3698. Compared 952720 event pairs, 4409 based on Foata normal form. 345/67971 useless extension candidates. Maximal degree in co-relation 380414. Up to 24837 conditions per place. [2022-12-11 19:37:44,852 INFO L137 encePairwiseOnDemand]: 157/172 looper letters, 319 selfloop transitions, 204 changer transitions 27/684 dead transitions. [2022-12-11 19:37:44,852 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 684 transitions, 8951 flow [2022-12-11 19:37:44,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-11 19:37:44,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-11 19:37:44,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1983 transitions. [2022-12-11 19:37:44,854 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6405038759689923 [2022-12-11 19:37:44,854 INFO L175 Difference]: Start difference. First operand has 361 places, 512 transitions, 5777 flow. Second operand 18 states and 1983 transitions. [2022-12-11 19:37:44,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 684 transitions, 8951 flow [2022-12-11 19:37:51,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 684 transitions, 8941 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-11 19:37:51,448 INFO L231 Difference]: Finished difference. Result has 384 places, 550 transitions, 7121 flow [2022-12-11 19:37:51,448 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=5767, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=512, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=169, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=7121, PETRI_PLACES=384, PETRI_TRANSITIONS=550} [2022-12-11 19:37:51,449 INFO L295 CegarLoopForPetriNet]: 162 programPoint places, 222 predicate places. [2022-12-11 19:37:51,449 INFO L495 AbstractCegarLoop]: Abstraction has has 384 places, 550 transitions, 7121 flow [2022-12-11 19:37:51,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 103.06666666666666) internal successors, (1546), 15 states have internal predecessors, (1546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 19:37:51,449 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:37:51,449 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:37:51,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-12-11 19:37:51,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 19:37:51,651 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 19:37:51,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:37:51,651 INFO L85 PathProgramCache]: Analyzing trace with hash 288399081, now seen corresponding path program 23 times [2022-12-11 19:37:51,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:37:51,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712268858] [2022-12-11 19:37:51,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:37:51,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:37:51,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:37:54,754 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 19:37:54,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:37:54,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712268858] [2022-12-11 19:37:54,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712268858] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 19:37:54,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064116202] [2022-12-11 19:37:54,754 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-11 19:37:54,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 19:37:54,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 19:37:54,756 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 19:37:54,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-11 19:37:54,859 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-11 19:37:54,859 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 19:37:54,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-11 19:37:54,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 19:37:55,331 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 19:37:55,332 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2022-12-11 19:37:55,374 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-11 19:37:55,374 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 19:37:55,508 INFO L321 Elim1Store]: treesize reduction 10, result has 85.5 percent of original size [2022-12-11 19:37:55,509 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 78 [2022-12-11 19:37:55,678 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-11 19:37:55,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064116202] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-11 19:37:55,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-11 19:37:55,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [41, 15] total 55 [2022-12-11 19:37:55,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454898073] [2022-12-11 19:37:55,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:37:55,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-11 19:37:55,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:37:55,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-11 19:37:55,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=2772, Unknown=0, NotChecked=0, Total=2970 [2022-12-11 19:37:55,681 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 172 [2022-12-11 19:37:55,681 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 550 transitions, 7121 flow. Second operand has 12 states, 12 states have (on average 106.83333333333333) internal successors, (1282), 12 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 19:37:55,681 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:37:55,681 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 172 [2022-12-11 19:37:55,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:38:11,343 INFO L130 PetriNetUnfolder]: 25502/70366 cut-off events. [2022-12-11 19:38:11,343 INFO L131 PetriNetUnfolder]: For 849841/853292 co-relation queries the response was YES. [2022-12-11 19:38:12,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 394384 conditions, 70366 events. 25502/70366 cut-off events. For 849841/853292 co-relation queries the response was YES. Maximal size of possible extension queue 3766. Compared 993571 event pairs, 6615 based on Foata normal form. 256/69261 useless extension candidates. Maximal degree in co-relation 394291. Up to 33707 conditions per place. [2022-12-11 19:38:13,036 INFO L137 encePairwiseOnDemand]: 160/172 looper letters, 426 selfloop transitions, 81 changer transitions 19/663 dead transitions. [2022-12-11 19:38:13,036 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 398 places, 663 transitions, 9398 flow [2022-12-11 19:38:13,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-11 19:38:13,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-11 19:38:13,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1920 transitions. [2022-12-11 19:38:13,038 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6566347469220246 [2022-12-11 19:38:13,038 INFO L175 Difference]: Start difference. First operand has 384 places, 550 transitions, 7121 flow. Second operand 17 states and 1920 transitions. [2022-12-11 19:38:13,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 398 places, 663 transitions, 9398 flow [2022-12-11 19:38:21,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 663 transitions, 8961 flow, removed 79 selfloop flow, removed 17 redundant places. [2022-12-11 19:38:21,296 INFO L231 Difference]: Finished difference. Result has 386 places, 562 transitions, 7223 flow [2022-12-11 19:38:21,297 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=6725, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=550, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=475, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=7223, PETRI_PLACES=386, PETRI_TRANSITIONS=562} [2022-12-11 19:38:21,297 INFO L295 CegarLoopForPetriNet]: 162 programPoint places, 224 predicate places. [2022-12-11 19:38:21,297 INFO L495 AbstractCegarLoop]: Abstraction has has 386 places, 562 transitions, 7223 flow [2022-12-11 19:38:21,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 106.83333333333333) internal successors, (1282), 12 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 19:38:21,297 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:38:21,298 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:38:21,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-12-11 19:38:21,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 19:38:21,498 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 19:38:21,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:38:21,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1835197841, now seen corresponding path program 24 times [2022-12-11 19:38:21,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:38:21,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729405826] [2022-12-11 19:38:21,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:38:21,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:38:21,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:38:23,117 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 19:38:23,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:38:23,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729405826] [2022-12-11 19:38:23,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729405826] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 19:38:23,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907936043] [2022-12-11 19:38:23,118 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-11 19:38:23,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 19:38:23,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 19:38:23,119 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 19:38:23,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-11 19:38:23,228 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-12-11 19:38:23,228 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 19:38:23,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-11 19:38:23,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 19:38:23,547 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 19:38:23,547 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2022-12-11 19:38:23,561 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-11 19:38:23,562 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-11 19:38:23,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1907936043] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:38:23,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-11 19:38:23,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [33] total 40 [2022-12-11 19:38:23,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050212651] [2022-12-11 19:38:23,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:38:23,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-11 19:38:23,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:38:23,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-11 19:38:23,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1426, Unknown=0, NotChecked=0, Total=1560 [2022-12-11 19:38:23,564 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 172 [2022-12-11 19:38:23,564 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 386 places, 562 transitions, 7223 flow. Second operand has 12 states, 12 states have (on average 106.83333333333333) internal successors, (1282), 12 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 19:38:23,564 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:38:23,564 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 172 [2022-12-11 19:38:23,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:38:38,796 INFO L130 PetriNetUnfolder]: 25456/70536 cut-off events. [2022-12-11 19:38:38,796 INFO L131 PetriNetUnfolder]: For 813094/816825 co-relation queries the response was YES. [2022-12-11 19:38:40,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 390538 conditions, 70536 events. 25456/70536 cut-off events. For 813094/816825 co-relation queries the response was YES. Maximal size of possible extension queue 3788. Compared 999073 event pairs, 5929 based on Foata normal form. 257/69412 useless extension candidates. Maximal degree in co-relation 390448. Up to 33931 conditions per place. [2022-12-11 19:38:40,675 INFO L137 encePairwiseOnDemand]: 158/172 looper letters, 401 selfloop transitions, 81 changer transitions 10/629 dead transitions. [2022-12-11 19:38:40,675 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 629 transitions, 8832 flow [2022-12-11 19:38:40,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-11 19:38:40,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-11 19:38:40,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1779 transitions. [2022-12-11 19:38:40,677 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6464389534883721 [2022-12-11 19:38:40,677 INFO L175 Difference]: Start difference. First operand has 386 places, 562 transitions, 7223 flow. Second operand 16 states and 1779 transitions. [2022-12-11 19:38:40,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 629 transitions, 8832 flow [2022-12-11 19:38:48,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 629 transitions, 8561 flow, removed 102 selfloop flow, removed 9 redundant places. [2022-12-11 19:38:48,529 INFO L231 Difference]: Finished difference. Result has 392 places, 564 transitions, 7191 flow [2022-12-11 19:38:48,529 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=6963, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=562, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=482, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=7191, PETRI_PLACES=392, PETRI_TRANSITIONS=564} [2022-12-11 19:38:48,530 INFO L295 CegarLoopForPetriNet]: 162 programPoint places, 230 predicate places. [2022-12-11 19:38:48,530 INFO L495 AbstractCegarLoop]: Abstraction has has 392 places, 564 transitions, 7191 flow [2022-12-11 19:38:48,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 106.83333333333333) internal successors, (1282), 12 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 19:38:48,530 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:38:48,530 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:38:48,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-12-11 19:38:48,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-12-11 19:38:48,734 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 19:38:48,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:38:48,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1030360487, now seen corresponding path program 25 times [2022-12-11 19:38:48,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:38:48,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830350169] [2022-12-11 19:38:48,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:38:48,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:38:48,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:38:49,638 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 19:38:49,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:38:49,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830350169] [2022-12-11 19:38:49,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830350169] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 19:38:49,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169185141] [2022-12-11 19:38:49,639 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-11 19:38:49,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 19:38:49,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 19:38:49,640 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 19:38:49,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-11 19:38:49,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:38:49,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 53 conjunts are in the unsatisfiable core [2022-12-11 19:38:49,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 19:38:50,622 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-11 19:38:50,638 INFO L321 Elim1Store]: treesize reduction 35, result has 32.7 percent of original size [2022-12-11 19:38:50,638 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 39 [2022-12-11 19:38:50,655 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 19:38:50,655 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 19:38:50,936 INFO L321 Elim1Store]: treesize reduction 10, result has 85.5 percent of original size [2022-12-11 19:38:50,937 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 80 treesize of output 90 [2022-12-11 19:38:51,336 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-11 19:38:51,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169185141] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-11 19:38:51,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-11 19:38:51,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [27, 28] total 49 [2022-12-11 19:38:51,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573741394] [2022-12-11 19:38:51,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:38:51,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-11 19:38:51,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:38:51,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-11 19:38:51,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=2157, Unknown=0, NotChecked=0, Total=2352 [2022-12-11 19:38:51,338 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 172 [2022-12-11 19:38:51,339 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 564 transitions, 7191 flow. Second operand has 15 states, 15 states have (on average 103.06666666666666) internal successors, (1546), 15 states have internal predecessors, (1546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 19:38:51,339 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:38:51,339 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 172 [2022-12-11 19:38:51,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:39:10,273 INFO L130 PetriNetUnfolder]: 28496/81044 cut-off events. [2022-12-11 19:39:10,273 INFO L131 PetriNetUnfolder]: For 937440/941288 co-relation queries the response was YES. [2022-12-11 19:39:12,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445255 conditions, 81044 events. 28496/81044 cut-off events. For 937440/941288 co-relation queries the response was YES. Maximal size of possible extension queue 4345. Compared 1183432 event pairs, 7445 based on Foata normal form. 265/79776 useless extension candidates. Maximal degree in co-relation 445163. Up to 40702 conditions per place. [2022-12-11 19:39:12,371 INFO L137 encePairwiseOnDemand]: 154/172 looper letters, 449 selfloop transitions, 99 changer transitions 17/699 dead transitions. [2022-12-11 19:39:12,371 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 406 places, 699 transitions, 10033 flow [2022-12-11 19:39:12,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-11 19:39:12,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-11 19:39:12,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1853 transitions. [2022-12-11 19:39:12,373 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6337209302325582 [2022-12-11 19:39:12,373 INFO L175 Difference]: Start difference. First operand has 392 places, 564 transitions, 7191 flow. Second operand 17 states and 1853 transitions. [2022-12-11 19:39:12,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 406 places, 699 transitions, 10033 flow [2022-12-11 19:39:21,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 394 places, 699 transitions, 9659 flow, removed 65 selfloop flow, removed 12 redundant places. [2022-12-11 19:39:21,629 INFO L231 Difference]: Finished difference. Result has 403 places, 607 transitions, 8015 flow [2022-12-11 19:39:21,629 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=6970, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=564, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=486, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=8015, PETRI_PLACES=403, PETRI_TRANSITIONS=607} [2022-12-11 19:39:21,630 INFO L295 CegarLoopForPetriNet]: 162 programPoint places, 241 predicate places. [2022-12-11 19:39:21,630 INFO L495 AbstractCegarLoop]: Abstraction has has 403 places, 607 transitions, 8015 flow [2022-12-11 19:39:21,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 103.06666666666666) internal successors, (1546), 15 states have internal predecessors, (1546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 19:39:21,630 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:39:21,630 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:39:21,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-12-11 19:39:21,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-11 19:39:21,832 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 19:39:21,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:39:21,832 INFO L85 PathProgramCache]: Analyzing trace with hash -490757341, now seen corresponding path program 26 times [2022-12-11 19:39:21,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:39:21,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597087802] [2022-12-11 19:39:21,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:39:21,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:39:21,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:39:22,699 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 19:39:22,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:39:22,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597087802] [2022-12-11 19:39:22,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597087802] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 19:39:22,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188647386] [2022-12-11 19:39:22,699 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-11 19:39:22,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 19:39:22,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 19:39:22,701 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 19:39:22,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-11 19:39:22,807 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-11 19:39:22,807 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 19:39:22,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-11 19:39:22,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 19:39:23,087 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 19:39:23,087 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2022-12-11 19:39:23,100 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-11 19:39:23,100 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-11 19:39:23,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188647386] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:39:23,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-11 19:39:23,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [27] total 34 [2022-12-11 19:39:23,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710948896] [2022-12-11 19:39:23,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:39:23,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-11 19:39:23,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:39:23,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-11 19:39:23,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1037, Unknown=0, NotChecked=0, Total=1122 [2022-12-11 19:39:23,102 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 172 [2022-12-11 19:39:23,103 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 403 places, 607 transitions, 8015 flow. Second operand has 12 states, 12 states have (on average 106.83333333333333) internal successors, (1282), 12 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 19:39:23,103 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:39:23,103 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 172 [2022-12-11 19:39:23,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:39:42,241 INFO L130 PetriNetUnfolder]: 28598/81636 cut-off events. [2022-12-11 19:39:42,241 INFO L131 PetriNetUnfolder]: For 1045612/1049576 co-relation queries the response was YES. [2022-12-11 19:39:44,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 462057 conditions, 81636 events. 28598/81636 cut-off events. For 1045612/1049576 co-relation queries the response was YES. Maximal size of possible extension queue 4376. Compared 1194253 event pairs, 6287 based on Foata normal form. 292/80579 useless extension candidates. Maximal degree in co-relation 461958. Up to 35905 conditions per place. [2022-12-11 19:39:44,573 INFO L137 encePairwiseOnDemand]: 158/172 looper letters, 399 selfloop transitions, 103 changer transitions 51/690 dead transitions. [2022-12-11 19:39:44,573 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 690 transitions, 9932 flow [2022-12-11 19:39:44,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-11 19:39:44,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-11 19:39:44,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2002 transitions. [2022-12-11 19:39:44,574 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.646640826873385 [2022-12-11 19:39:44,574 INFO L175 Difference]: Start difference. First operand has 403 places, 607 transitions, 8015 flow. Second operand 18 states and 2002 transitions. [2022-12-11 19:39:44,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 690 transitions, 9932 flow [2022-12-11 19:39:55,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 690 transitions, 9692 flow, removed 100 selfloop flow, removed 7 redundant places. [2022-12-11 19:39:55,537 INFO L231 Difference]: Finished difference. Result has 412 places, 595 transitions, 7868 flow [2022-12-11 19:39:55,538 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=7791, PETRI_DIFFERENCE_MINUEND_PLACES=392, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=607, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=504, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=7868, PETRI_PLACES=412, PETRI_TRANSITIONS=595} [2022-12-11 19:39:55,538 INFO L295 CegarLoopForPetriNet]: 162 programPoint places, 250 predicate places. [2022-12-11 19:39:55,538 INFO L495 AbstractCegarLoop]: Abstraction has has 412 places, 595 transitions, 7868 flow [2022-12-11 19:39:55,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 106.83333333333333) internal successors, (1282), 12 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 19:39:55,539 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:39:55,539 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:39:55,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-12-11 19:39:55,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-11 19:39:55,740 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 19:39:55,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:39:55,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1671225823, now seen corresponding path program 27 times [2022-12-11 19:39:55,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:39:55,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377357701] [2022-12-11 19:39:55,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:39:55,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:39:55,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:39:57,511 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 19:39:57,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:39:57,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377357701] [2022-12-11 19:39:57,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377357701] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 19:39:57,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377512896] [2022-12-11 19:39:57,512 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-11 19:39:57,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 19:39:57,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 19:39:57,513 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 19:39:57,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-11 19:39:57,620 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-11 19:39:57,621 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 19:39:57,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-11 19:39:57,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 19:39:57,947 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 19:39:57,947 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2022-12-11 19:39:57,961 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-11 19:39:57,962 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-11 19:39:57,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [377512896] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:39:57,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-11 19:39:57,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [36] total 43 [2022-12-11 19:39:57,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111683280] [2022-12-11 19:39:57,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:39:57,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-11 19:39:57,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:39:57,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-11 19:39:57,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1691, Unknown=0, NotChecked=0, Total=1806 [2022-12-11 19:39:57,965 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 172 [2022-12-11 19:39:57,966 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 595 transitions, 7868 flow. Second operand has 12 states, 12 states have (on average 106.83333333333333) internal successors, (1282), 12 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 19:39:57,966 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:39:57,966 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 172 [2022-12-11 19:39:57,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand