/usr/bin/java -Xmx16000000000 -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-Before.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/unroll-cond-3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 09:25:29,121 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 09:25:29,123 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 09:25:29,173 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 09:25:29,173 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 09:25:29,174 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 09:25:29,175 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 09:25:29,177 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 09:25:29,178 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 09:25:29,179 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 09:25:29,180 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 09:25:29,181 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 09:25:29,181 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 09:25:29,182 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 09:25:29,183 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 09:25:29,199 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 09:25:29,200 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 09:25:29,201 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 09:25:29,202 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 09:25:29,204 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 09:25:29,205 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 09:25:29,206 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 09:25:29,207 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 09:25:29,207 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 09:25:29,209 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 09:25:29,210 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 09:25:29,210 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 09:25:29,210 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 09:25:29,211 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 09:25:29,212 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 09:25:29,212 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 09:25:29,212 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 09:25:29,213 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 09:25:29,214 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 09:25:29,214 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 09:25:29,215 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 09:25:29,215 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 09:25:29,215 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 09:25:29,216 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 09:25:29,216 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 09:25:29,217 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 09:25:29,218 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-Before.epf [2022-01-19 09:25:29,234 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 09:25:29,235 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 09:25:29,235 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 09:25:29,236 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 09:25:29,236 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 09:25:29,236 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 09:25:29,236 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 09:25:29,237 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 09:25:29,237 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 09:25:29,237 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 09:25:29,237 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 09:25:29,237 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 09:25:29,237 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 09:25:29,237 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 09:25:29,237 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 09:25:29,238 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 09:25:29,238 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 09:25:29,238 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 09:25:29,238 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 09:25:29,238 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 09:25:29,238 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 09:25:29,238 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 09:25:29,239 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 09:25:29,239 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 09:25:29,239 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 09:25:29,239 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 09:25:29,239 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 09:25:29,239 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 09:25:29,239 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 09:25:29,240 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 09:25:29,240 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 09:25:29,240 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=BEFORE [2022-01-19 09:25:29,240 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-01-19 09:25:29,418 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 09:25:29,436 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 09:25:29,438 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 09:25:29,439 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 09:25:29,440 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 09:25:29,441 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-cond-3.wvr.c [2022-01-19 09:25:29,505 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff65bed62/e71575d19bab41de87321a7658ce3225/FLAGedefd0ad7 [2022-01-19 09:25:29,878 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 09:25:29,878 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-3.wvr.c [2022-01-19 09:25:29,884 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff65bed62/e71575d19bab41de87321a7658ce3225/FLAGedefd0ad7 [2022-01-19 09:25:30,303 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff65bed62/e71575d19bab41de87321a7658ce3225 [2022-01-19 09:25:30,305 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 09:25:30,306 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 09:25:30,307 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 09:25:30,307 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 09:25:30,314 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 09:25:30,315 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 09:25:30" (1/1) ... [2022-01-19 09:25:30,315 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@88e36bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 09:25:30, skipping insertion in model container [2022-01-19 09:25:30,316 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 09:25:30" (1/1) ... [2022-01-19 09:25:30,321 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 09:25:30,336 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 09:25:30,498 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-3.wvr.c[2641,2654] [2022-01-19 09:25:30,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 09:25:30,510 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 09:25:30,528 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-3.wvr.c[2641,2654] [2022-01-19 09:25:30,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 09:25:30,542 INFO L208 MainTranslator]: Completed translation [2022-01-19 09:25:30,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 09:25:30 WrapperNode [2022-01-19 09:25:30,543 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 09:25:30,544 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 09:25:30,544 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 09:25:30,544 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 09:25:30,550 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 09:25:30" (1/1) ... [2022-01-19 09:25:30,557 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 09:25:30" (1/1) ... [2022-01-19 09:25:30,577 INFO L137 Inliner]: procedures = 24, calls = 37, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 162 [2022-01-19 09:25:30,578 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 09:25:30,578 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 09:25:30,578 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 09:25:30,579 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 09:25:30,589 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 09:25:30" (1/1) ... [2022-01-19 09:25:30,589 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 09:25:30" (1/1) ... [2022-01-19 09:25:30,592 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 09:25:30" (1/1) ... [2022-01-19 09:25:30,592 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 09:25:30" (1/1) ... [2022-01-19 09:25:30,599 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 09:25:30" (1/1) ... [2022-01-19 09:25:30,603 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 09:25:30" (1/1) ... [2022-01-19 09:25:30,604 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 09:25:30" (1/1) ... [2022-01-19 09:25:30,607 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 09:25:30,607 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 09:25:30,607 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 09:25:30,608 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 09:25:30,608 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 09:25:30" (1/1) ... [2022-01-19 09:25:30,614 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 09:25:30,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 09:25:30,649 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-01-19 09:25:30,674 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-01-19 09:25:30,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 09:25:30,693 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-01-19 09:25:30,693 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-01-19 09:25:30,693 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-01-19 09:25:30,693 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-01-19 09:25:30,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 09:25:30,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 09:25:30,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 09:25:30,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-19 09:25:30,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 09:25:30,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 09:25:30,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 09:25:30,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 09:25:30,697 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-19 09:25:30,797 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 09:25:30,798 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 09:25:31,145 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 09:25:31,154 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 09:25:31,154 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-19 09:25:31,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 09:25:31 BoogieIcfgContainer [2022-01-19 09:25:31,156 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 09:25:31,158 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 09:25:31,158 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 09:25:31,161 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 09:25:31,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 09:25:30" (1/3) ... [2022-01-19 09:25:31,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d5218f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 09:25:31, skipping insertion in model container [2022-01-19 09:25:31,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 09:25:30" (2/3) ... [2022-01-19 09:25:31,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d5218f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 09:25:31, skipping insertion in model container [2022-01-19 09:25:31,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 09:25:31" (3/3) ... [2022-01-19 09:25:31,163 INFO L111 eAbstractionObserver]: Analyzing ICFG unroll-cond-3.wvr.c [2022-01-19 09:25:31,168 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 09:25:31,168 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-19 09:25:31,168 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 09:25:31,208 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,209 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,209 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,209 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,210 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,210 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,210 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,210 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,211 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,211 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,211 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,211 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,211 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,212 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,212 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,212 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,212 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,212 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,212 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,212 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,213 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,213 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,213 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,213 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,214 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,214 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,214 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,214 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,214 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,214 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,214 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,215 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,215 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,215 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,215 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,215 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,215 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,216 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,217 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,217 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,217 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,217 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,218 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,218 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,219 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,219 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,219 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,220 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,220 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,220 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,221 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,221 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,222 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,222 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,222 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,222 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,223 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,223 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,223 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,223 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,223 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,223 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,223 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,224 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,224 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,224 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,224 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,224 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,225 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,225 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,225 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,225 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,225 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,225 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,225 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,225 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,226 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,226 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,226 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,226 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,226 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,226 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,226 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,227 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,227 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,227 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,227 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,227 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,227 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,227 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,228 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,228 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,228 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,228 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,228 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,229 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,229 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,229 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,229 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,230 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,230 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,230 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,230 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,230 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,230 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,231 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,231 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,231 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,231 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,231 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,231 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,231 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,232 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,232 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,232 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,232 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,232 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,232 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,232 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,232 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,233 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,233 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,233 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,233 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,233 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,233 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,233 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,234 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,234 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,234 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,234 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,234 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,234 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,234 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,234 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,235 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,235 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,235 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,235 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,235 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,235 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,236 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,236 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,236 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,236 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,236 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,236 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,236 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,236 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,237 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,237 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,237 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,237 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,237 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,238 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,238 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,238 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,238 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,238 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,238 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,238 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,239 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,239 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,239 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,239 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,239 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,239 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,240 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,240 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,240 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,240 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,240 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,240 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,241 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,241 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,241 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,241 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,241 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,241 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,241 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,242 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,242 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,242 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,242 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,242 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,243 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,243 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,243 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,243 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,243 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,243 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,243 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,243 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,244 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,244 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,244 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,246 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,247 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,247 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,247 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,247 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,247 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,247 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,249 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,249 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,249 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,250 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,250 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,250 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,250 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,250 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,250 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,250 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,251 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,251 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,251 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,251 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,251 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:25:31,257 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-01-19 09:25:31,297 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 09:25:31,304 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-19 09:25:31,304 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-01-19 09:25:31,318 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 198 places, 209 transitions, 434 flow [2022-01-19 09:25:31,386 INFO L129 PetriNetUnfolder]: 18/207 cut-off events. [2022-01-19 09:25:31,386 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-01-19 09:25:31,393 INFO L84 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 207 events. 18/207 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 316 event pairs, 0 based on Foata normal form. 0/188 useless extension candidates. Maximal degree in co-relation 111. Up to 2 conditions per place. [2022-01-19 09:25:31,393 INFO L82 GeneralOperation]: Start removeDead. Operand has 198 places, 209 transitions, 434 flow [2022-01-19 09:25:31,399 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 187 places, 198 transitions, 408 flow [2022-01-19 09:25:31,435 INFO L129 PetriNetUnfolder]: 16/182 cut-off events. [2022-01-19 09:25:31,435 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-01-19 09:25:31,439 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 09:25:31,440 INFO L254 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] [2022-01-19 09:25:31,441 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 09:25:31,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 09:25:31,448 INFO L85 PathProgramCache]: Analyzing trace with hash -641401192, now seen corresponding path program 1 times [2022-01-19 09:25:31,453 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 09:25:31,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284135241] [2022-01-19 09:25:31,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:25:31,455 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 09:25:31,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:25:31,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 09:25:31,664 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 09:25:31,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284135241] [2022-01-19 09:25:31,665 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284135241] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 09:25:31,665 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 09:25:31,665 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 09:25:31,667 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092027715] [2022-01-19 09:25:31,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 09:25:31,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-19 09:25:31,676 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 09:25:31,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-19 09:25:31,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-19 09:25:31,718 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 209 [2022-01-19 09:25:31,722 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 198 transitions, 408 flow. Second operand has 2 states, 2 states have (on average 194.0) internal successors, (388), 2 states have internal predecessors, (388), 0 states have call successors, (0), 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-01-19 09:25:31,722 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 09:25:31,722 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 209 [2022-01-19 09:25:31,723 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 09:25:31,767 INFO L129 PetriNetUnfolder]: 5/185 cut-off events. [2022-01-19 09:25:31,768 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-01-19 09:25:31,769 INFO L84 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 185 events. 5/185 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 284 event pairs, 0 based on Foata normal form. 16/186 useless extension candidates. Maximal degree in co-relation 104. Up to 5 conditions per place. [2022-01-19 09:25:31,771 INFO L132 encePairwiseOnDemand]: 196/209 looper letters, 4 selfloop transitions, 0 changer transitions 4/185 dead transitions. [2022-01-19 09:25:31,771 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 185 transitions, 390 flow [2022-01-19 09:25:31,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-19 09:25:31,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-01-19 09:25:31,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 399 transitions. [2022-01-19 09:25:31,784 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9545454545454546 [2022-01-19 09:25:31,784 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 399 transitions. [2022-01-19 09:25:31,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 399 transitions. [2022-01-19 09:25:31,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 09:25:31,788 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 399 transitions. [2022-01-19 09:25:31,791 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 199.5) internal successors, (399), 2 states have internal predecessors, (399), 0 states have call successors, (0), 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-01-19 09:25:31,797 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 0 states have call successors, (0), 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-01-19 09:25:31,798 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 0 states have call successors, (0), 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-01-19 09:25:31,800 INFO L186 Difference]: Start difference. First operand has 187 places, 198 transitions, 408 flow. Second operand 2 states and 399 transitions. [2022-01-19 09:25:31,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 185 transitions, 390 flow [2022-01-19 09:25:31,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 185 transitions, 382 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-01-19 09:25:31,809 INFO L242 Difference]: Finished difference. Result has 184 places, 181 transitions, 366 flow [2022-01-19 09:25:31,811 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=366, PETRI_PLACES=184, PETRI_TRANSITIONS=181} [2022-01-19 09:25:31,814 INFO L334 CegarLoopForPetriNet]: 187 programPoint places, -3 predicate places. [2022-01-19 09:25:31,814 INFO L470 AbstractCegarLoop]: Abstraction has has 184 places, 181 transitions, 366 flow [2022-01-19 09:25:31,815 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 194.0) internal successors, (388), 2 states have internal predecessors, (388), 0 states have call successors, (0), 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-01-19 09:25:31,815 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 09:25:31,815 INFO L254 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] [2022-01-19 09:25:31,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 09:25:31,816 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 09:25:31,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 09:25:31,816 INFO L85 PathProgramCache]: Analyzing trace with hash 317017016, now seen corresponding path program 1 times [2022-01-19 09:25:31,816 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 09:25:31,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044100503] [2022-01-19 09:25:31,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:25:31,817 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 09:25:31,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:25:32,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 09:25:32,096 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 09:25:32,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044100503] [2022-01-19 09:25:32,096 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044100503] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 09:25:32,096 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 09:25:32,097 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 09:25:32,097 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845537325] [2022-01-19 09:25:32,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 09:25:32,098 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 09:25:32,098 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 09:25:32,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 09:25:32,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-19 09:25:32,101 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 209 [2022-01-19 09:25:32,102 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 181 transitions, 366 flow. Second operand has 4 states, 4 states have (on average 172.75) internal successors, (691), 4 states have internal predecessors, (691), 0 states have call successors, (0), 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-01-19 09:25:32,102 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 09:25:32,102 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 209 [2022-01-19 09:25:32,102 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 09:25:32,295 INFO L129 PetriNetUnfolder]: 153/760 cut-off events. [2022-01-19 09:25:32,295 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2022-01-19 09:25:32,300 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1029 conditions, 760 events. 153/760 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3814 event pairs, 34 based on Foata normal form. 0/641 useless extension candidates. Maximal degree in co-relation 1026. Up to 164 conditions per place. [2022-01-19 09:25:32,304 INFO L132 encePairwiseOnDemand]: 202/209 looper letters, 39 selfloop transitions, 7 changer transitions 0/202 dead transitions. [2022-01-19 09:25:32,304 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 202 transitions, 502 flow [2022-01-19 09:25:32,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-19 09:25:32,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-01-19 09:25:32,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 727 transitions. [2022-01-19 09:25:32,309 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8696172248803827 [2022-01-19 09:25:32,309 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 727 transitions. [2022-01-19 09:25:32,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 727 transitions. [2022-01-19 09:25:32,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 09:25:32,310 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 727 transitions. [2022-01-19 09:25:32,312 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 181.75) internal successors, (727), 4 states have internal predecessors, (727), 0 states have call successors, (0), 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-01-19 09:25:32,316 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:25:32,316 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:25:32,317 INFO L186 Difference]: Start difference. First operand has 184 places, 181 transitions, 366 flow. Second operand 4 states and 727 transitions. [2022-01-19 09:25:32,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 202 transitions, 502 flow [2022-01-19 09:25:32,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 202 transitions, 502 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 09:25:32,325 INFO L242 Difference]: Finished difference. Result has 185 places, 187 transitions, 413 flow [2022-01-19 09:25:32,326 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=413, PETRI_PLACES=185, PETRI_TRANSITIONS=187} [2022-01-19 09:25:32,327 INFO L334 CegarLoopForPetriNet]: 187 programPoint places, -2 predicate places. [2022-01-19 09:25:32,327 INFO L470 AbstractCegarLoop]: Abstraction has has 185 places, 187 transitions, 413 flow [2022-01-19 09:25:32,327 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 172.75) internal successors, (691), 4 states have internal predecessors, (691), 0 states have call successors, (0), 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-01-19 09:25:32,327 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 09:25:32,328 INFO L254 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] [2022-01-19 09:25:32,328 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 09:25:32,328 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 09:25:32,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 09:25:32,329 INFO L85 PathProgramCache]: Analyzing trace with hash -299465594, now seen corresponding path program 1 times [2022-01-19 09:25:32,330 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 09:25:32,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192049749] [2022-01-19 09:25:32,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:25:32,330 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 09:25:32,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:25:32,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 09:25:32,496 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 09:25:32,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192049749] [2022-01-19 09:25:32,497 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192049749] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 09:25:32,497 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 09:25:32,497 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 09:25:32,497 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473608209] [2022-01-19 09:25:32,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 09:25:32,498 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 09:25:32,498 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 09:25:32,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 09:25:32,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-19 09:25:32,501 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 209 [2022-01-19 09:25:32,502 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 187 transitions, 413 flow. Second operand has 5 states, 5 states have (on average 169.8) internal successors, (849), 5 states have internal predecessors, (849), 0 states have call successors, (0), 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-01-19 09:25:32,502 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 09:25:32,502 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 209 [2022-01-19 09:25:32,502 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 09:25:32,845 INFO L129 PetriNetUnfolder]: 355/1781 cut-off events. [2022-01-19 09:25:32,845 INFO L130 PetriNetUnfolder]: For 193/195 co-relation queries the response was YES. [2022-01-19 09:25:32,849 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2710 conditions, 1781 events. 355/1781 cut-off events. For 193/195 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 12993 event pairs, 127 based on Foata normal form. 8/1643 useless extension candidates. Maximal degree in co-relation 2704. Up to 366 conditions per place. [2022-01-19 09:25:32,856 INFO L132 encePairwiseOnDemand]: 200/209 looper letters, 82 selfloop transitions, 7 changer transitions 0/242 dead transitions. [2022-01-19 09:25:32,856 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 242 transitions, 770 flow [2022-01-19 09:25:32,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 09:25:32,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 09:25:32,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1077 transitions. [2022-01-19 09:25:32,859 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8588516746411483 [2022-01-19 09:25:32,859 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1077 transitions. [2022-01-19 09:25:32,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1077 transitions. [2022-01-19 09:25:32,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 09:25:32,860 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1077 transitions. [2022-01-19 09:25:32,862 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 179.5) internal successors, (1077), 6 states have internal predecessors, (1077), 0 states have call successors, (0), 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-01-19 09:25:32,864 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 209.0) internal successors, (1463), 7 states have internal predecessors, (1463), 0 states have call successors, (0), 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-01-19 09:25:32,865 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 209.0) internal successors, (1463), 7 states have internal predecessors, (1463), 0 states have call successors, (0), 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-01-19 09:25:32,865 INFO L186 Difference]: Start difference. First operand has 185 places, 187 transitions, 413 flow. Second operand 6 states and 1077 transitions. [2022-01-19 09:25:32,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 242 transitions, 770 flow [2022-01-19 09:25:32,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 242 transitions, 770 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 09:25:32,874 INFO L242 Difference]: Finished difference. Result has 193 places, 191 transitions, 461 flow [2022-01-19 09:25:32,875 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=461, PETRI_PLACES=193, PETRI_TRANSITIONS=191} [2022-01-19 09:25:32,877 INFO L334 CegarLoopForPetriNet]: 187 programPoint places, 6 predicate places. [2022-01-19 09:25:32,877 INFO L470 AbstractCegarLoop]: Abstraction has has 193 places, 191 transitions, 461 flow [2022-01-19 09:25:32,878 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 169.8) internal successors, (849), 5 states have internal predecessors, (849), 0 states have call successors, (0), 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-01-19 09:25:32,878 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 09:25:32,878 INFO L254 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] [2022-01-19 09:25:32,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 09:25:32,878 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 09:25:32,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 09:25:32,879 INFO L85 PathProgramCache]: Analyzing trace with hash 781561804, now seen corresponding path program 2 times [2022-01-19 09:25:32,880 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 09:25:32,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377510288] [2022-01-19 09:25:32,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:25:32,880 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 09:25:32,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:25:33,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 09:25:33,242 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 09:25:33,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377510288] [2022-01-19 09:25:33,242 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377510288] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 09:25:33,242 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 09:25:33,243 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 09:25:33,243 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633585167] [2022-01-19 09:25:33,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 09:25:33,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 09:25:33,244 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 09:25:33,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 09:25:33,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-01-19 09:25:33,249 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 209 [2022-01-19 09:25:33,250 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 191 transitions, 461 flow. Second operand has 5 states, 5 states have (on average 172.6) internal successors, (863), 5 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:25:33,250 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 09:25:33,250 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 209 [2022-01-19 09:25:33,251 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 09:25:33,473 INFO L129 PetriNetUnfolder]: 183/1122 cut-off events. [2022-01-19 09:25:33,473 INFO L130 PetriNetUnfolder]: For 329/381 co-relation queries the response was YES. [2022-01-19 09:25:33,477 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1778 conditions, 1122 events. 183/1122 cut-off events. For 329/381 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 7694 event pairs, 101 based on Foata normal form. 49/1081 useless extension candidates. Maximal degree in co-relation 1768. Up to 243 conditions per place. [2022-01-19 09:25:33,481 INFO L132 encePairwiseOnDemand]: 201/209 looper letters, 37 selfloop transitions, 11 changer transitions 3/208 dead transitions. [2022-01-19 09:25:33,482 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 208 transitions, 623 flow [2022-01-19 09:25:33,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 09:25:33,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 09:25:33,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 893 transitions. [2022-01-19 09:25:33,484 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8545454545454545 [2022-01-19 09:25:33,484 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 893 transitions. [2022-01-19 09:25:33,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 893 transitions. [2022-01-19 09:25:33,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 09:25:33,485 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 893 transitions. [2022-01-19 09:25:33,487 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 178.6) internal successors, (893), 5 states have internal predecessors, (893), 0 states have call successors, (0), 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-01-19 09:25:33,488 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 209.0) internal successors, (1254), 6 states have internal predecessors, (1254), 0 states have call successors, (0), 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-01-19 09:25:33,489 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 209.0) internal successors, (1254), 6 states have internal predecessors, (1254), 0 states have call successors, (0), 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-01-19 09:25:33,489 INFO L186 Difference]: Start difference. First operand has 193 places, 191 transitions, 461 flow. Second operand 5 states and 893 transitions. [2022-01-19 09:25:33,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 208 transitions, 623 flow [2022-01-19 09:25:33,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 208 transitions, 615 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-01-19 09:25:33,496 INFO L242 Difference]: Finished difference. Result has 198 places, 192 transitions, 496 flow [2022-01-19 09:25:33,497 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=496, PETRI_PLACES=198, PETRI_TRANSITIONS=192} [2022-01-19 09:25:33,498 INFO L334 CegarLoopForPetriNet]: 187 programPoint places, 11 predicate places. [2022-01-19 09:25:33,498 INFO L470 AbstractCegarLoop]: Abstraction has has 198 places, 192 transitions, 496 flow [2022-01-19 09:25:33,499 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 172.6) internal successors, (863), 5 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:25:33,499 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 09:25:33,499 INFO L254 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] [2022-01-19 09:25:33,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 09:25:33,499 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 09:25:33,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 09:25:33,501 INFO L85 PathProgramCache]: Analyzing trace with hash -119616610, now seen corresponding path program 1 times [2022-01-19 09:25:33,501 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 09:25:33,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825067089] [2022-01-19 09:25:33,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:25:33,502 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 09:25:33,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:25:33,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 09:25:33,758 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 09:25:33,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825067089] [2022-01-19 09:25:33,758 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825067089] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 09:25:33,758 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 09:25:33,758 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 09:25:33,758 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126981521] [2022-01-19 09:25:33,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 09:25:33,759 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 09:25:33,759 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 09:25:33,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 09:25:33,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-19 09:25:33,761 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 209 [2022-01-19 09:25:33,762 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 192 transitions, 496 flow. Second operand has 6 states, 6 states have (on average 169.33333333333334) internal successors, (1016), 6 states have internal predecessors, (1016), 0 states have call successors, (0), 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-01-19 09:25:33,762 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 09:25:33,762 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 209 [2022-01-19 09:25:33,762 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 09:25:34,068 INFO L129 PetriNetUnfolder]: 373/1941 cut-off events. [2022-01-19 09:25:34,069 INFO L130 PetriNetUnfolder]: For 807/819 co-relation queries the response was YES. [2022-01-19 09:25:34,074 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3340 conditions, 1941 events. 373/1941 cut-off events. For 807/819 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 14729 event pairs, 168 based on Foata normal form. 14/1822 useless extension candidates. Maximal degree in co-relation 3327. Up to 352 conditions per place. [2022-01-19 09:25:34,091 INFO L132 encePairwiseOnDemand]: 201/209 looper letters, 80 selfloop transitions, 13 changer transitions 2/248 dead transitions. [2022-01-19 09:25:34,091 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 248 transitions, 935 flow [2022-01-19 09:25:34,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 09:25:34,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 09:25:34,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1082 transitions. [2022-01-19 09:25:34,094 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8628389154704944 [2022-01-19 09:25:34,095 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1082 transitions. [2022-01-19 09:25:34,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1082 transitions. [2022-01-19 09:25:34,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 09:25:34,095 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1082 transitions. [2022-01-19 09:25:34,098 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 180.33333333333334) internal successors, (1082), 6 states have internal predecessors, (1082), 0 states have call successors, (0), 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-01-19 09:25:34,100 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 209.0) internal successors, (1463), 7 states have internal predecessors, (1463), 0 states have call successors, (0), 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-01-19 09:25:34,101 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 209.0) internal successors, (1463), 7 states have internal predecessors, (1463), 0 states have call successors, (0), 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-01-19 09:25:34,101 INFO L186 Difference]: Start difference. First operand has 198 places, 192 transitions, 496 flow. Second operand 6 states and 1082 transitions. [2022-01-19 09:25:34,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 248 transitions, 935 flow [2022-01-19 09:25:34,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 248 transitions, 920 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 09:25:34,109 INFO L242 Difference]: Finished difference. Result has 206 places, 200 transitions, 609 flow [2022-01-19 09:25:34,109 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=609, PETRI_PLACES=206, PETRI_TRANSITIONS=200} [2022-01-19 09:25:34,110 INFO L334 CegarLoopForPetriNet]: 187 programPoint places, 19 predicate places. [2022-01-19 09:25:34,110 INFO L470 AbstractCegarLoop]: Abstraction has has 206 places, 200 transitions, 609 flow [2022-01-19 09:25:34,111 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 169.33333333333334) internal successors, (1016), 6 states have internal predecessors, (1016), 0 states have call successors, (0), 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-01-19 09:25:34,111 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 09:25:34,111 INFO L254 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] [2022-01-19 09:25:34,111 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 09:25:34,111 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 09:25:34,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 09:25:34,112 INFO L85 PathProgramCache]: Analyzing trace with hash 527597564, now seen corresponding path program 2 times [2022-01-19 09:25:34,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 09:25:34,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475147024] [2022-01-19 09:25:34,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:25:34,112 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 09:25:34,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:25:34,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 09:25:34,273 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 09:25:34,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475147024] [2022-01-19 09:25:34,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475147024] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 09:25:34,273 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 09:25:34,274 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 09:25:34,274 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342689552] [2022-01-19 09:25:34,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 09:25:34,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 09:25:34,274 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 09:25:34,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 09:25:34,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-01-19 09:25:34,277 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 209 [2022-01-19 09:25:34,278 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 200 transitions, 609 flow. Second operand has 6 states, 6 states have (on average 169.33333333333334) internal successors, (1016), 6 states have internal predecessors, (1016), 0 states have call successors, (0), 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-01-19 09:25:34,278 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 09:25:34,278 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 209 [2022-01-19 09:25:34,278 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 09:25:34,642 INFO L129 PetriNetUnfolder]: 394/2019 cut-off events. [2022-01-19 09:25:34,643 INFO L130 PetriNetUnfolder]: For 1472/1474 co-relation queries the response was YES. [2022-01-19 09:25:34,651 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3708 conditions, 2019 events. 394/2019 cut-off events. For 1472/1474 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 15554 event pairs, 195 based on Foata normal form. 10/1894 useless extension candidates. Maximal degree in co-relation 3691. Up to 465 conditions per place. [2022-01-19 09:25:34,659 INFO L132 encePairwiseOnDemand]: 202/209 looper letters, 62 selfloop transitions, 18 changer transitions 0/233 dead transitions. [2022-01-19 09:25:34,659 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 233 transitions, 912 flow [2022-01-19 09:25:34,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 09:25:34,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 09:25:34,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1064 transitions. [2022-01-19 09:25:34,662 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8484848484848485 [2022-01-19 09:25:34,662 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1064 transitions. [2022-01-19 09:25:34,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1064 transitions. [2022-01-19 09:25:34,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 09:25:34,663 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1064 transitions. [2022-01-19 09:25:34,665 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 177.33333333333334) internal successors, (1064), 6 states have internal predecessors, (1064), 0 states have call successors, (0), 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-01-19 09:25:34,667 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 209.0) internal successors, (1463), 7 states have internal predecessors, (1463), 0 states have call successors, (0), 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-01-19 09:25:34,667 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 209.0) internal successors, (1463), 7 states have internal predecessors, (1463), 0 states have call successors, (0), 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-01-19 09:25:34,667 INFO L186 Difference]: Start difference. First operand has 206 places, 200 transitions, 609 flow. Second operand 6 states and 1064 transitions. [2022-01-19 09:25:34,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 233 transitions, 912 flow [2022-01-19 09:25:34,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 233 transitions, 889 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-01-19 09:25:34,679 INFO L242 Difference]: Finished difference. Result has 211 places, 204 transitions, 682 flow [2022-01-19 09:25:34,680 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=596, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=682, PETRI_PLACES=211, PETRI_TRANSITIONS=204} [2022-01-19 09:25:34,681 INFO L334 CegarLoopForPetriNet]: 187 programPoint places, 24 predicate places. [2022-01-19 09:25:34,682 INFO L470 AbstractCegarLoop]: Abstraction has has 211 places, 204 transitions, 682 flow [2022-01-19 09:25:34,682 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 169.33333333333334) internal successors, (1016), 6 states have internal predecessors, (1016), 0 states have call successors, (0), 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-01-19 09:25:34,682 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 09:25:34,682 INFO L254 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] [2022-01-19 09:25:34,682 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-19 09:25:34,683 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 09:25:34,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 09:25:34,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1665551690, now seen corresponding path program 3 times [2022-01-19 09:25:34,684 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 09:25:34,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236247510] [2022-01-19 09:25:34,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:25:34,684 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 09:25:34,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:25:34,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 09:25:34,824 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 09:25:34,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236247510] [2022-01-19 09:25:34,825 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236247510] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 09:25:34,825 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 09:25:34,825 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 09:25:34,825 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646662248] [2022-01-19 09:25:34,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 09:25:34,829 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 09:25:34,829 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 09:25:34,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 09:25:34,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-19 09:25:34,831 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 209 [2022-01-19 09:25:34,832 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 204 transitions, 682 flow. Second operand has 6 states, 6 states have (on average 169.33333333333334) internal successors, (1016), 6 states have internal predecessors, (1016), 0 states have call successors, (0), 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-01-19 09:25:34,832 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 09:25:34,832 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 209 [2022-01-19 09:25:34,832 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 09:25:35,301 INFO L129 PetriNetUnfolder]: 465/2340 cut-off events. [2022-01-19 09:25:35,301 INFO L130 PetriNetUnfolder]: For 2549/2551 co-relation queries the response was YES. [2022-01-19 09:25:35,310 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4415 conditions, 2340 events. 465/2340 cut-off events. For 2549/2551 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 18640 event pairs, 201 based on Foata normal form. 7/2198 useless extension candidates. Maximal degree in co-relation 4396. Up to 410 conditions per place. [2022-01-19 09:25:35,318 INFO L132 encePairwiseOnDemand]: 202/209 looper letters, 74 selfloop transitions, 20 changer transitions 0/247 dead transitions. [2022-01-19 09:25:35,318 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 247 transitions, 1066 flow [2022-01-19 09:25:35,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 09:25:35,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 09:25:35,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1241 transitions. [2022-01-19 09:25:35,321 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.848257006151743 [2022-01-19 09:25:35,321 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1241 transitions. [2022-01-19 09:25:35,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1241 transitions. [2022-01-19 09:25:35,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 09:25:35,322 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1241 transitions. [2022-01-19 09:25:35,324 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 177.28571428571428) internal successors, (1241), 7 states have internal predecessors, (1241), 0 states have call successors, (0), 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-01-19 09:25:35,327 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 209.0) internal successors, (1672), 8 states have internal predecessors, (1672), 0 states have call successors, (0), 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-01-19 09:25:35,329 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 209.0) internal successors, (1672), 8 states have internal predecessors, (1672), 0 states have call successors, (0), 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-01-19 09:25:35,329 INFO L186 Difference]: Start difference. First operand has 211 places, 204 transitions, 682 flow. Second operand 7 states and 1241 transitions. [2022-01-19 09:25:35,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 247 transitions, 1066 flow [2022-01-19 09:25:35,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 247 transitions, 1032 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-01-19 09:25:35,343 INFO L242 Difference]: Finished difference. Result has 216 places, 206 transitions, 721 flow [2022-01-19 09:25:35,344 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=648, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=721, PETRI_PLACES=216, PETRI_TRANSITIONS=206} [2022-01-19 09:25:35,345 INFO L334 CegarLoopForPetriNet]: 187 programPoint places, 29 predicate places. [2022-01-19 09:25:35,346 INFO L470 AbstractCegarLoop]: Abstraction has has 216 places, 206 transitions, 721 flow [2022-01-19 09:25:35,346 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 169.33333333333334) internal successors, (1016), 6 states have internal predecessors, (1016), 0 states have call successors, (0), 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-01-19 09:25:35,346 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 09:25:35,346 INFO L254 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] [2022-01-19 09:25:35,346 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-19 09:25:35,347 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 09:25:35,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 09:25:35,347 INFO L85 PathProgramCache]: Analyzing trace with hash 21117964, now seen corresponding path program 4 times [2022-01-19 09:25:35,347 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 09:25:35,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109617132] [2022-01-19 09:25:35,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:25:35,347 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 09:25:35,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:25:35,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 09:25:35,432 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 09:25:35,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109617132] [2022-01-19 09:25:35,432 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109617132] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 09:25:35,432 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 09:25:35,432 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 09:25:35,433 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240253370] [2022-01-19 09:25:35,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 09:25:35,433 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 09:25:35,433 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 09:25:35,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 09:25:35,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-19 09:25:35,435 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 209 [2022-01-19 09:25:35,435 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 206 transitions, 721 flow. Second operand has 5 states, 5 states have (on average 169.8) internal successors, (849), 5 states have internal predecessors, (849), 0 states have call successors, (0), 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-01-19 09:25:35,436 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 09:25:35,436 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 209 [2022-01-19 09:25:35,436 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 09:25:35,768 INFO L129 PetriNetUnfolder]: 447/2285 cut-off events. [2022-01-19 09:25:35,768 INFO L130 PetriNetUnfolder]: For 2796/2798 co-relation queries the response was YES. [2022-01-19 09:25:35,780 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4428 conditions, 2285 events. 447/2285 cut-off events. For 2796/2798 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 18098 event pairs, 190 based on Foata normal form. 2/2130 useless extension candidates. Maximal degree in co-relation 4407. Up to 414 conditions per place. [2022-01-19 09:25:35,789 INFO L132 encePairwiseOnDemand]: 202/209 looper letters, 75 selfloop transitions, 18 changer transitions 0/246 dead transitions. [2022-01-19 09:25:35,789 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 246 transitions, 1096 flow [2022-01-19 09:25:35,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 09:25:35,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 09:25:35,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 904 transitions. [2022-01-19 09:25:35,792 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8650717703349282 [2022-01-19 09:25:35,792 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 904 transitions. [2022-01-19 09:25:35,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 904 transitions. [2022-01-19 09:25:35,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 09:25:35,792 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 904 transitions. [2022-01-19 09:25:35,794 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 180.8) internal successors, (904), 5 states have internal predecessors, (904), 0 states have call successors, (0), 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-01-19 09:25:35,796 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 209.0) internal successors, (1254), 6 states have internal predecessors, (1254), 0 states have call successors, (0), 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-01-19 09:25:35,796 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 209.0) internal successors, (1254), 6 states have internal predecessors, (1254), 0 states have call successors, (0), 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-01-19 09:25:35,796 INFO L186 Difference]: Start difference. First operand has 216 places, 206 transitions, 721 flow. Second operand 5 states and 904 transitions. [2022-01-19 09:25:35,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 246 transitions, 1096 flow [2022-01-19 09:25:35,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 246 transitions, 1044 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-01-19 09:25:35,810 INFO L242 Difference]: Finished difference. Result has 218 places, 208 transitions, 760 flow [2022-01-19 09:25:35,811 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=760, PETRI_PLACES=218, PETRI_TRANSITIONS=208} [2022-01-19 09:25:35,811 INFO L334 CegarLoopForPetriNet]: 187 programPoint places, 31 predicate places. [2022-01-19 09:25:35,811 INFO L470 AbstractCegarLoop]: Abstraction has has 218 places, 208 transitions, 760 flow [2022-01-19 09:25:35,812 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 169.8) internal successors, (849), 5 states have internal predecessors, (849), 0 states have call successors, (0), 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-01-19 09:25:35,812 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 09:25:35,812 INFO L254 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] [2022-01-19 09:25:35,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-19 09:25:35,812 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 09:25:35,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 09:25:35,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1070521520, now seen corresponding path program 5 times [2022-01-19 09:25:35,813 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 09:25:35,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057879160] [2022-01-19 09:25:35,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:25:35,813 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 09:25:35,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:25:35,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 09:25:35,895 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 09:25:35,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057879160] [2022-01-19 09:25:35,895 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057879160] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 09:25:35,896 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 09:25:35,896 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 09:25:35,896 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737358727] [2022-01-19 09:25:35,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 09:25:35,896 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 09:25:35,896 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 09:25:35,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 09:25:35,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-19 09:25:35,898 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 209 [2022-01-19 09:25:35,899 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 208 transitions, 760 flow. Second operand has 5 states, 5 states have (on average 169.8) internal successors, (849), 5 states have internal predecessors, (849), 0 states have call successors, (0), 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-01-19 09:25:35,899 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 09:25:35,899 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 209 [2022-01-19 09:25:35,899 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 09:25:36,200 INFO L129 PetriNetUnfolder]: 458/2294 cut-off events. [2022-01-19 09:25:36,200 INFO L130 PetriNetUnfolder]: For 2983/2986 co-relation queries the response was YES. [2022-01-19 09:25:36,208 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4454 conditions, 2294 events. 458/2294 cut-off events. For 2983/2986 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 18005 event pairs, 236 based on Foata normal form. 4/2140 useless extension candidates. Maximal degree in co-relation 4431. Up to 607 conditions per place. [2022-01-19 09:25:36,215 INFO L132 encePairwiseOnDemand]: 202/209 looper letters, 64 selfloop transitions, 22 changer transitions 0/239 dead transitions. [2022-01-19 09:25:36,215 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 239 transitions, 1103 flow [2022-01-19 09:25:36,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 09:25:36,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 09:25:36,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 895 transitions. [2022-01-19 09:25:36,218 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8564593301435407 [2022-01-19 09:25:36,218 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 895 transitions. [2022-01-19 09:25:36,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 895 transitions. [2022-01-19 09:25:36,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 09:25:36,218 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 895 transitions. [2022-01-19 09:25:36,220 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 179.0) internal successors, (895), 5 states have internal predecessors, (895), 0 states have call successors, (0), 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-01-19 09:25:36,221 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 209.0) internal successors, (1254), 6 states have internal predecessors, (1254), 0 states have call successors, (0), 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-01-19 09:25:36,222 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 209.0) internal successors, (1254), 6 states have internal predecessors, (1254), 0 states have call successors, (0), 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-01-19 09:25:36,222 INFO L186 Difference]: Start difference. First operand has 218 places, 208 transitions, 760 flow. Second operand 5 states and 895 transitions. [2022-01-19 09:25:36,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 239 transitions, 1103 flow [2022-01-19 09:25:36,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 239 transitions, 1066 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-01-19 09:25:36,233 INFO L242 Difference]: Finished difference. Result has 223 places, 216 transitions, 893 flow [2022-01-19 09:25:36,233 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=727, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=893, PETRI_PLACES=223, PETRI_TRANSITIONS=216} [2022-01-19 09:25:36,234 INFO L334 CegarLoopForPetriNet]: 187 programPoint places, 36 predicate places. [2022-01-19 09:25:36,234 INFO L470 AbstractCegarLoop]: Abstraction has has 223 places, 216 transitions, 893 flow [2022-01-19 09:25:36,235 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 169.8) internal successors, (849), 5 states have internal predecessors, (849), 0 states have call successors, (0), 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-01-19 09:25:36,235 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 09:25:36,235 INFO L254 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] [2022-01-19 09:25:36,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-19 09:25:36,235 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 09:25:36,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 09:25:36,235 INFO L85 PathProgramCache]: Analyzing trace with hash 486915966, now seen corresponding path program 6 times [2022-01-19 09:25:36,236 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 09:25:36,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916379848] [2022-01-19 09:25:36,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:25:36,236 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 09:25:36,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:25:36,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 09:25:36,380 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 09:25:36,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916379848] [2022-01-19 09:25:36,380 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916379848] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 09:25:36,380 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 09:25:36,380 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 09:25:36,380 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296601655] [2022-01-19 09:25:36,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 09:25:36,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 09:25:36,381 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 09:25:36,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 09:25:36,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-01-19 09:25:36,382 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 209 [2022-01-19 09:25:36,383 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 216 transitions, 893 flow. Second operand has 6 states, 6 states have (on average 169.33333333333334) internal successors, (1016), 6 states have internal predecessors, (1016), 0 states have call successors, (0), 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-01-19 09:25:36,383 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 09:25:36,383 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 209 [2022-01-19 09:25:36,383 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 09:25:36,709 INFO L129 PetriNetUnfolder]: 444/2213 cut-off events. [2022-01-19 09:25:36,709 INFO L130 PetriNetUnfolder]: For 3403/3405 co-relation queries the response was YES. [2022-01-19 09:25:36,720 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4364 conditions, 2213 events. 444/2213 cut-off events. For 3403/3405 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 17196 event pairs, 221 based on Foata normal form. 10/2076 useless extension candidates. Maximal degree in co-relation 4338. Up to 563 conditions per place. [2022-01-19 09:25:36,727 INFO L132 encePairwiseOnDemand]: 202/209 looper letters, 69 selfloop transitions, 24 changer transitions 0/246 dead transitions. [2022-01-19 09:25:36,727 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 246 transitions, 1190 flow [2022-01-19 09:25:36,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 09:25:36,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 09:25:36,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1070 transitions. [2022-01-19 09:25:36,730 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8532695374800638 [2022-01-19 09:25:36,730 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1070 transitions. [2022-01-19 09:25:36,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1070 transitions. [2022-01-19 09:25:36,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 09:25:36,731 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1070 transitions. [2022-01-19 09:25:36,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 178.33333333333334) internal successors, (1070), 6 states have internal predecessors, (1070), 0 states have call successors, (0), 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-01-19 09:25:36,734 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 209.0) internal successors, (1463), 7 states have internal predecessors, (1463), 0 states have call successors, (0), 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-01-19 09:25:36,735 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 209.0) internal successors, (1463), 7 states have internal predecessors, (1463), 0 states have call successors, (0), 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-01-19 09:25:36,735 INFO L186 Difference]: Start difference. First operand has 223 places, 216 transitions, 893 flow. Second operand 6 states and 1070 transitions. [2022-01-19 09:25:36,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 246 transitions, 1190 flow [2022-01-19 09:25:36,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 246 transitions, 1150 flow, removed 12 selfloop flow, removed 1 redundant places. [2022-01-19 09:25:36,749 INFO L242 Difference]: Finished difference. Result has 230 places, 219 transitions, 964 flow [2022-01-19 09:25:36,749 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=842, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=964, PETRI_PLACES=230, PETRI_TRANSITIONS=219} [2022-01-19 09:25:36,749 INFO L334 CegarLoopForPetriNet]: 187 programPoint places, 43 predicate places. [2022-01-19 09:25:36,750 INFO L470 AbstractCegarLoop]: Abstraction has has 230 places, 219 transitions, 964 flow [2022-01-19 09:25:36,750 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 169.33333333333334) internal successors, (1016), 6 states have internal predecessors, (1016), 0 states have call successors, (0), 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-01-19 09:25:36,750 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 09:25:36,750 INFO L254 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] [2022-01-19 09:25:36,750 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-19 09:25:36,751 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 09:25:36,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 09:25:36,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1410643597, now seen corresponding path program 1 times [2022-01-19 09:25:36,751 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 09:25:36,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121808627] [2022-01-19 09:25:36,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:25:36,751 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 09:25:36,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:25:36,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 09:25:36,909 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 09:25:36,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121808627] [2022-01-19 09:25:36,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121808627] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 09:25:36,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491961228] [2022-01-19 09:25:36,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:25:36,910 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 09:25:36,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 09:25:36,915 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-01-19 09:25:36,922 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-01-19 09:25:37,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:25:37,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 27 conjunts are in the unsatisfiable core [2022-01-19 09:25:37,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 09:25:37,784 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-19 09:25:37,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 09:25:37,869 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 09:25:38,020 INFO L353 Elim1Store]: treesize reduction 9, result has 43.8 percent of original size [2022-01-19 09:25:38,020 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-01-19 09:25:38,186 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 09:25:38,187 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1491961228] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 09:25:38,187 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 09:25:38,187 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15, 9] total 23 [2022-01-19 09:25:38,187 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915406316] [2022-01-19 09:25:38,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 09:25:38,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-19 09:25:38,188 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 09:25:38,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-19 09:25:38,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2022-01-19 09:25:38,191 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 209 [2022-01-19 09:25:38,194 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 219 transitions, 964 flow. Second operand has 23 states, 23 states have (on average 113.17391304347827) internal successors, (2603), 23 states have internal predecessors, (2603), 0 states have call successors, (0), 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-01-19 09:25:38,194 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 09:25:38,194 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 209 [2022-01-19 09:25:38,194 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 09:25:42,512 INFO L129 PetriNetUnfolder]: 7342/17187 cut-off events. [2022-01-19 09:25:42,513 INFO L130 PetriNetUnfolder]: For 20602/20602 co-relation queries the response was YES. [2022-01-19 09:25:42,593 INFO L84 FinitePrefix]: Finished finitePrefix Result has 37360 conditions, 17187 events. 7342/17187 cut-off events. For 20602/20602 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 161010 event pairs, 392 based on Foata normal form. 33/16538 useless extension candidates. Maximal degree in co-relation 37331. Up to 3162 conditions per place. [2022-01-19 09:25:42,655 INFO L132 encePairwiseOnDemand]: 177/209 looper letters, 666 selfloop transitions, 140 changer transitions 8/910 dead transitions. [2022-01-19 09:25:42,656 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 910 transitions, 5589 flow [2022-01-19 09:25:42,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-01-19 09:25:42,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2022-01-19 09:25:42,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 6228 transitions. [2022-01-19 09:25:42,670 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5730585204269415 [2022-01-19 09:25:42,670 INFO L72 ComplementDD]: Start complementDD. Operand 52 states and 6228 transitions. [2022-01-19 09:25:42,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 6228 transitions. [2022-01-19 09:25:42,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 09:25:42,674 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 52 states and 6228 transitions. [2022-01-19 09:25:42,685 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 53 states, 52 states have (on average 119.76923076923077) internal successors, (6228), 52 states have internal predecessors, (6228), 0 states have call successors, (0), 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-01-19 09:25:42,765 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 53 states, 53 states have (on average 209.0) internal successors, (11077), 53 states have internal predecessors, (11077), 0 states have call successors, (0), 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-01-19 09:25:42,768 INFO L81 ComplementDD]: Finished complementDD. Result has 53 states, 53 states have (on average 209.0) internal successors, (11077), 53 states have internal predecessors, (11077), 0 states have call successors, (0), 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-01-19 09:25:42,769 INFO L186 Difference]: Start difference. First operand has 230 places, 219 transitions, 964 flow. Second operand 52 states and 6228 transitions. [2022-01-19 09:25:42,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 910 transitions, 5589 flow [2022-01-19 09:25:42,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 910 transitions, 5398 flow, removed 27 selfloop flow, removed 2 redundant places. [2022-01-19 09:25:42,855 INFO L242 Difference]: Finished difference. Result has 310 places, 362 transitions, 2066 flow [2022-01-19 09:25:42,856 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=916, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=52, PETRI_FLOW=2066, PETRI_PLACES=310, PETRI_TRANSITIONS=362} [2022-01-19 09:25:42,856 INFO L334 CegarLoopForPetriNet]: 187 programPoint places, 123 predicate places. [2022-01-19 09:25:42,856 INFO L470 AbstractCegarLoop]: Abstraction has has 310 places, 362 transitions, 2066 flow [2022-01-19 09:25:42,857 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 113.17391304347827) internal successors, (2603), 23 states have internal predecessors, (2603), 0 states have call successors, (0), 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-01-19 09:25:42,857 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 09:25:42,857 INFO L254 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] [2022-01-19 09:25:42,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-19 09:25:43,070 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-01-19 09:25:43,071 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 09:25:43,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 09:25:43,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1359667531, now seen corresponding path program 2 times [2022-01-19 09:25:43,072 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 09:25:43,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850893823] [2022-01-19 09:25:43,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:25:43,072 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 09:25:43,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:25:43,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 09:25:43,279 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 09:25:43,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850893823] [2022-01-19 09:25:43,280 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850893823] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 09:25:43,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920406379] [2022-01-19 09:25:43,280 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 09:25:43,280 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 09:25:43,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 09:25:43,281 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-01-19 09:25:43,308 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-01-19 09:25:43,366 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-01-19 09:25:43,366 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 09:25:43,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-19 09:25:43,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 09:25:43,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 09:25:43,795 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 09:25:43,795 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [920406379] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 09:25:43,796 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 09:25:43,796 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2022-01-19 09:25:43,796 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158538682] [2022-01-19 09:25:43,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 09:25:43,797 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 09:25:43,797 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 09:25:43,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 09:25:43,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-01-19 09:25:43,799 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 209 [2022-01-19 09:25:43,800 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 362 transitions, 2066 flow. Second operand has 9 states, 9 states have (on average 140.66666666666666) internal successors, (1266), 9 states have internal predecessors, (1266), 0 states have call successors, (0), 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-01-19 09:25:43,800 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 09:25:43,800 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 209 [2022-01-19 09:25:43,800 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 09:25:44,766 INFO L129 PetriNetUnfolder]: 1112/5337 cut-off events. [2022-01-19 09:25:44,766 INFO L130 PetriNetUnfolder]: For 9151/9242 co-relation queries the response was YES. [2022-01-19 09:25:44,804 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12509 conditions, 5337 events. 1112/5337 cut-off events. For 9151/9242 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 53502 event pairs, 257 based on Foata normal form. 14/4996 useless extension candidates. Maximal degree in co-relation 12449. Up to 1393 conditions per place. [2022-01-19 09:25:44,817 INFO L132 encePairwiseOnDemand]: 188/209 looper letters, 94 selfloop transitions, 54 changer transitions 19/413 dead transitions. [2022-01-19 09:25:44,817 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 413 transitions, 2546 flow [2022-01-19 09:25:44,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-19 09:25:44,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-01-19 09:25:44,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1756 transitions. [2022-01-19 09:25:44,820 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7001594896331739 [2022-01-19 09:25:44,820 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1756 transitions. [2022-01-19 09:25:44,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1756 transitions. [2022-01-19 09:25:44,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 09:25:44,821 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1756 transitions. [2022-01-19 09:25:44,824 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 146.33333333333334) internal successors, (1756), 12 states have internal predecessors, (1756), 0 states have call successors, (0), 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-01-19 09:25:44,828 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 209.0) internal successors, (2717), 13 states have internal predecessors, (2717), 0 states have call successors, (0), 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-01-19 09:25:44,828 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 209.0) internal successors, (2717), 13 states have internal predecessors, (2717), 0 states have call successors, (0), 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-01-19 09:25:44,828 INFO L186 Difference]: Start difference. First operand has 310 places, 362 transitions, 2066 flow. Second operand 12 states and 1756 transitions. [2022-01-19 09:25:44,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 413 transitions, 2546 flow [2022-01-19 09:25:44,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 413 transitions, 2456 flow, removed 19 selfloop flow, removed 10 redundant places. [2022-01-19 09:25:44,889 INFO L242 Difference]: Finished difference. Result has 314 places, 377 transitions, 2225 flow [2022-01-19 09:25:44,889 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=1976, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2225, PETRI_PLACES=314, PETRI_TRANSITIONS=377} [2022-01-19 09:25:44,891 INFO L334 CegarLoopForPetriNet]: 187 programPoint places, 127 predicate places. [2022-01-19 09:25:44,891 INFO L470 AbstractCegarLoop]: Abstraction has has 314 places, 377 transitions, 2225 flow [2022-01-19 09:25:44,891 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 140.66666666666666) internal successors, (1266), 9 states have internal predecessors, (1266), 0 states have call successors, (0), 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-01-19 09:25:44,891 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 09:25:44,892 INFO L254 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] [2022-01-19 09:25:44,918 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-01-19 09:25:45,115 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-01-19 09:25:45,115 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 09:25:45,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 09:25:45,116 INFO L85 PathProgramCache]: Analyzing trace with hash 2032396257, now seen corresponding path program 1 times [2022-01-19 09:25:45,116 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 09:25:45,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297276069] [2022-01-19 09:25:45,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:25:45,116 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 09:25:45,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:25:45,356 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 09:25:45,357 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 09:25:45,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297276069] [2022-01-19 09:25:45,357 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297276069] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 09:25:45,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11981890] [2022-01-19 09:25:45,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:25:45,357 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 09:25:45,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 09:25:45,360 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-01-19 09:25:45,391 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-01-19 09:25:45,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:25:45,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 27 conjunts are in the unsatisfiable core [2022-01-19 09:25:45,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 09:25:46,094 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-19 09:25:46,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 09:25:46,206 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 09:25:46,306 INFO L353 Elim1Store]: treesize reduction 9, result has 43.8 percent of original size [2022-01-19 09:25:46,307 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-01-19 09:25:46,478 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 09:25:46,478 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11981890] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 09:25:46,478 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 09:25:46,478 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15, 9] total 22 [2022-01-19 09:25:46,478 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779619318] [2022-01-19 09:25:46,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 09:25:46,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-01-19 09:25:46,479 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 09:25:46,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-01-19 09:25:46,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2022-01-19 09:25:46,482 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 209 [2022-01-19 09:25:46,483 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 377 transitions, 2225 flow. Second operand has 22 states, 22 states have (on average 113.27272727272727) internal successors, (2492), 22 states have internal predecessors, (2492), 0 states have call successors, (0), 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-01-19 09:25:46,484 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 09:25:46,484 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 209 [2022-01-19 09:25:46,484 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 09:25:51,150 INFO L129 PetriNetUnfolder]: 8548/19653 cut-off events. [2022-01-19 09:25:51,151 INFO L130 PetriNetUnfolder]: For 52327/52421 co-relation queries the response was YES. [2022-01-19 09:25:51,303 INFO L84 FinitePrefix]: Finished finitePrefix Result has 58485 conditions, 19653 events. 8548/19653 cut-off events. For 52327/52421 co-relation queries the response was YES. Maximal size of possible extension queue 501. Compared 185765 event pairs, 2091 based on Foata normal form. 71/19376 useless extension candidates. Maximal degree in co-relation 58422. Up to 7621 conditions per place. [2022-01-19 09:25:51,375 INFO L132 encePairwiseOnDemand]: 178/209 looper letters, 588 selfloop transitions, 208 changer transitions 4/899 dead transitions. [2022-01-19 09:25:51,375 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 899 transitions, 7137 flow [2022-01-19 09:25:51,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-01-19 09:25:51,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2022-01-19 09:25:51,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 7007 transitions. [2022-01-19 09:25:51,385 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5496117342536669 [2022-01-19 09:25:51,386 INFO L72 ComplementDD]: Start complementDD. Operand 61 states and 7007 transitions. [2022-01-19 09:25:51,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 7007 transitions. [2022-01-19 09:25:51,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 09:25:51,391 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 61 states and 7007 transitions. [2022-01-19 09:25:51,400 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 62 states, 61 states have (on average 114.8688524590164) internal successors, (7007), 61 states have internal predecessors, (7007), 0 states have call successors, (0), 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-01-19 09:25:51,415 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 62 states, 62 states have (on average 209.0) internal successors, (12958), 62 states have internal predecessors, (12958), 0 states have call successors, (0), 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-01-19 09:25:51,419 INFO L81 ComplementDD]: Finished complementDD. Result has 62 states, 62 states have (on average 209.0) internal successors, (12958), 62 states have internal predecessors, (12958), 0 states have call successors, (0), 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-01-19 09:25:51,419 INFO L186 Difference]: Start difference. First operand has 314 places, 377 transitions, 2225 flow. Second operand 61 states and 7007 transitions. [2022-01-19 09:25:51,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 899 transitions, 7137 flow [2022-01-19 09:25:51,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 899 transitions, 7075 flow, removed 27 selfloop flow, removed 6 redundant places. [2022-01-19 09:25:51,681 INFO L242 Difference]: Finished difference. Result has 396 places, 539 transitions, 4662 flow [2022-01-19 09:25:51,682 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=2205, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=61, PETRI_FLOW=4662, PETRI_PLACES=396, PETRI_TRANSITIONS=539} [2022-01-19 09:25:51,683 INFO L334 CegarLoopForPetriNet]: 187 programPoint places, 209 predicate places. [2022-01-19 09:25:51,683 INFO L470 AbstractCegarLoop]: Abstraction has has 396 places, 539 transitions, 4662 flow [2022-01-19 09:25:51,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 113.27272727272727) internal successors, (2492), 22 states have internal predecessors, (2492), 0 states have call successors, (0), 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-01-19 09:25:51,684 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 09:25:51,684 INFO L254 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] [2022-01-19 09:25:51,707 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-01-19 09:25:51,903 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 09:25:51,904 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 09:25:51,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 09:25:51,904 INFO L85 PathProgramCache]: Analyzing trace with hash -575446859, now seen corresponding path program 2 times [2022-01-19 09:25:51,904 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 09:25:51,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153257993] [2022-01-19 09:25:51,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:25:51,904 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 09:25:51,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:25:52,111 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 09:25:52,111 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 09:25:52,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153257993] [2022-01-19 09:25:52,111 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153257993] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 09:25:52,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113903729] [2022-01-19 09:25:52,111 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 09:25:52,112 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 09:25:52,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 09:25:52,116 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-01-19 09:25:52,125 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-01-19 09:25:52,321 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-01-19 09:25:52,321 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 09:25:52,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-19 09:25:52,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 09:25:52,770 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-19 09:25:52,770 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 09:25:52,770 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113903729] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 09:25:52,770 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 09:25:52,770 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2022-01-19 09:25:52,771 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402490029] [2022-01-19 09:25:52,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 09:25:52,771 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 09:25:52,771 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 09:25:52,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 09:25:52,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-01-19 09:25:52,774 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 209 [2022-01-19 09:25:52,774 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 539 transitions, 4662 flow. Second operand has 6 states, 6 states have (on average 171.5) internal successors, (1029), 6 states have internal predecessors, (1029), 0 states have call successors, (0), 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-01-19 09:25:52,775 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 09:25:52,775 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 209 [2022-01-19 09:25:52,775 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 09:25:53,818 INFO L129 PetriNetUnfolder]: 937/4709 cut-off events. [2022-01-19 09:25:53,818 INFO L130 PetriNetUnfolder]: For 19373/19544 co-relation queries the response was YES. [2022-01-19 09:25:53,854 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14334 conditions, 4709 events. 937/4709 cut-off events. For 19373/19544 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 44506 event pairs, 181 based on Foata normal form. 110/4662 useless extension candidates. Maximal degree in co-relation 14242. Up to 605 conditions per place. [2022-01-19 09:25:53,869 INFO L132 encePairwiseOnDemand]: 201/209 looper letters, 81 selfloop transitions, 48 changer transitions 0/581 dead transitions. [2022-01-19 09:25:53,870 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 581 transitions, 5202 flow [2022-01-19 09:25:53,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 09:25:53,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 09:25:53,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1236 transitions. [2022-01-19 09:25:53,872 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8448393711551606 [2022-01-19 09:25:53,872 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1236 transitions. [2022-01-19 09:25:53,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1236 transitions. [2022-01-19 09:25:53,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 09:25:53,872 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1236 transitions. [2022-01-19 09:25:53,874 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 176.57142857142858) internal successors, (1236), 7 states have internal predecessors, (1236), 0 states have call successors, (0), 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-01-19 09:25:53,876 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 209.0) internal successors, (1672), 8 states have internal predecessors, (1672), 0 states have call successors, (0), 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-01-19 09:25:53,876 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 209.0) internal successors, (1672), 8 states have internal predecessors, (1672), 0 states have call successors, (0), 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-01-19 09:25:53,876 INFO L186 Difference]: Start difference. First operand has 396 places, 539 transitions, 4662 flow. Second operand 7 states and 1236 transitions. [2022-01-19 09:25:53,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 400 places, 581 transitions, 5202 flow [2022-01-19 09:25:54,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 391 places, 581 transitions, 4702 flow, removed 243 selfloop flow, removed 9 redundant places. [2022-01-19 09:25:54,140 INFO L242 Difference]: Finished difference. Result has 394 places, 542 transitions, 4302 flow [2022-01-19 09:25:54,141 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=4162, PETRI_DIFFERENCE_MINUEND_PLACES=385, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=539, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=491, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4302, PETRI_PLACES=394, PETRI_TRANSITIONS=542} [2022-01-19 09:25:54,141 INFO L334 CegarLoopForPetriNet]: 187 programPoint places, 207 predicate places. [2022-01-19 09:25:54,141 INFO L470 AbstractCegarLoop]: Abstraction has has 394 places, 542 transitions, 4302 flow [2022-01-19 09:25:54,142 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 171.5) internal successors, (1029), 6 states have internal predecessors, (1029), 0 states have call successors, (0), 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-01-19 09:25:54,142 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 09:25:54,142 INFO L254 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] [2022-01-19 09:25:54,154 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-01-19 09:25:54,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 09:25:54,348 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 09:25:54,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 09:25:54,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1266164479, now seen corresponding path program 1 times [2022-01-19 09:25:54,349 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 09:25:54,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361692560] [2022-01-19 09:25:54,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:25:54,349 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 09:25:54,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:25:54,600 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 09:25:54,600 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 09:25:54,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361692560] [2022-01-19 09:25:54,601 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361692560] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 09:25:54,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546756440] [2022-01-19 09:25:54,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:25:54,601 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 09:25:54,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 09:25:54,602 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-01-19 09:25:54,603 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-01-19 09:25:54,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:25:54,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 38 conjunts are in the unsatisfiable core [2022-01-19 09:25:54,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 09:25:56,016 INFO L353 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-01-19 09:25:56,016 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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-01-19 09:25:56,232 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 09:25:56,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 09:25:56,593 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 09:25:56,594 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 30 [2022-01-19 09:25:57,852 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 09:25:57,852 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546756440] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 09:25:57,852 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 09:25:57,852 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 21, 21] total 47 [2022-01-19 09:25:57,853 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704943897] [2022-01-19 09:25:57,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 09:25:57,853 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-01-19 09:25:57,853 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 09:25:57,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-01-19 09:25:57,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=1958, Unknown=0, NotChecked=0, Total=2162 [2022-01-19 09:25:57,857 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 209 [2022-01-19 09:25:57,860 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 394 places, 542 transitions, 4302 flow. Second operand has 47 states, 47 states have (on average 85.76595744680851) internal successors, (4031), 47 states have internal predecessors, (4031), 0 states have call successors, (0), 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-01-19 09:25:57,860 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 09:25:57,860 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 209 [2022-01-19 09:25:57,860 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 09:26:15,307 INFO L129 PetriNetUnfolder]: 17676/37846 cut-off events. [2022-01-19 09:26:15,307 INFO L130 PetriNetUnfolder]: For 163093/163397 co-relation queries the response was YES. [2022-01-19 09:26:16,022 INFO L84 FinitePrefix]: Finished finitePrefix Result has 127641 conditions, 37846 events. 17676/37846 cut-off events. For 163093/163397 co-relation queries the response was YES. Maximal size of possible extension queue 819. Compared 386617 event pairs, 2606 based on Foata normal form. 119/37322 useless extension candidates. Maximal degree in co-relation 127547. Up to 13620 conditions per place. [2022-01-19 09:26:16,135 INFO L132 encePairwiseOnDemand]: 144/209 looper letters, 1131 selfloop transitions, 541 changer transitions 306/2110 dead transitions. [2022-01-19 09:26:16,135 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 545 places, 2110 transitions, 17936 flow [2022-01-19 09:26:16,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2022-01-19 09:26:16,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2022-01-19 09:26:16,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 13768 transitions. [2022-01-19 09:26:16,162 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.43339209267187107 [2022-01-19 09:26:16,162 INFO L72 ComplementDD]: Start complementDD. Operand 152 states and 13768 transitions. [2022-01-19 09:26:16,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 152 states and 13768 transitions. [2022-01-19 09:26:16,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 09:26:16,169 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 152 states and 13768 transitions. [2022-01-19 09:26:16,189 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 153 states, 152 states have (on average 90.57894736842105) internal successors, (13768), 152 states have internal predecessors, (13768), 0 states have call successors, (0), 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-01-19 09:26:16,224 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 153 states, 153 states have (on average 209.0) internal successors, (31977), 153 states have internal predecessors, (31977), 0 states have call successors, (0), 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-01-19 09:26:16,232 INFO L81 ComplementDD]: Finished complementDD. Result has 153 states, 153 states have (on average 209.0) internal successors, (31977), 153 states have internal predecessors, (31977), 0 states have call successors, (0), 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-01-19 09:26:16,232 INFO L186 Difference]: Start difference. First operand has 394 places, 542 transitions, 4302 flow. Second operand 152 states and 13768 transitions. [2022-01-19 09:26:16,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 545 places, 2110 transitions, 17936 flow [2022-01-19 09:26:17,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 543 places, 2110 transitions, 17739 flow, removed 51 selfloop flow, removed 2 redundant places. [2022-01-19 09:26:17,625 INFO L242 Difference]: Finished difference. Result has 635 places, 961 transitions, 9462 flow [2022-01-19 09:26:17,626 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=4253, PETRI_DIFFERENCE_MINUEND_PLACES=392, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=542, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=141, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=361, PETRI_DIFFERENCE_SUBTRAHEND_STATES=152, PETRI_FLOW=9462, PETRI_PLACES=635, PETRI_TRANSITIONS=961} [2022-01-19 09:26:17,626 INFO L334 CegarLoopForPetriNet]: 187 programPoint places, 448 predicate places. [2022-01-19 09:26:17,626 INFO L470 AbstractCegarLoop]: Abstraction has has 635 places, 961 transitions, 9462 flow [2022-01-19 09:26:17,627 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 85.76595744680851) internal successors, (4031), 47 states have internal predecessors, (4031), 0 states have call successors, (0), 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-01-19 09:26:17,627 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 09:26:17,627 INFO L254 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] [2022-01-19 09:26:17,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-01-19 09:26:17,827 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-01-19 09:26:17,828 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 09:26:17,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 09:26:17,828 INFO L85 PathProgramCache]: Analyzing trace with hash -443919373, now seen corresponding path program 2 times [2022-01-19 09:26:17,828 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 09:26:17,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246675442] [2022-01-19 09:26:17,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:26:17,829 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 09:26:17,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:26:18,040 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 09:26:18,040 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 09:26:18,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246675442] [2022-01-19 09:26:18,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246675442] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 09:26:18,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169592275] [2022-01-19 09:26:18,041 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 09:26:18,041 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 09:26:18,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 09:26:18,042 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-01-19 09:26:18,043 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-01-19 09:26:18,152 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 09:26:18,152 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 09:26:18,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 55 conjunts are in the unsatisfiable core [2022-01-19 09:26:18,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 09:26:18,603 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-19 09:26:18,849 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-19 09:26:18,911 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-19 09:26:19,859 INFO L353 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-01-19 09:26:19,859 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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-01-19 09:26:20,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 09:26:20,025 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 09:26:43,704 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 09:26:43,704 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 78 [2022-01-19 09:26:43,717 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 09:26:43,717 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 488 treesize of output 444 [2022-01-19 09:26:43,735 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 09:26:43,736 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 496 treesize of output 378 [2022-01-19 09:26:43,753 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 09:26:43,754 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 352 treesize of output 306 [2022-01-19 09:26:53,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 09:26:53,275 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [169592275] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 09:26:53,275 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 09:26:53,275 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 30, 27] total 61 [2022-01-19 09:26:53,275 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269422528] [2022-01-19 09:26:53,275 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 09:26:53,276 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-01-19 09:26:53,276 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 09:26:53,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-01-19 09:26:53,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=346, Invalid=3202, Unknown=112, NotChecked=0, Total=3660 [2022-01-19 09:26:53,281 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 209 [2022-01-19 09:26:53,283 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 635 places, 961 transitions, 9462 flow. Second operand has 61 states, 61 states have (on average 71.21311475409836) internal successors, (4344), 61 states have internal predecessors, (4344), 0 states have call successors, (0), 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-01-19 09:26:53,283 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 09:26:53,283 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 209 [2022-01-19 09:26:53,284 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 09:27:17,014 INFO L129 PetriNetUnfolder]: 19477/42396 cut-off events. [2022-01-19 09:27:17,015 INFO L130 PetriNetUnfolder]: For 1482183/1482581 co-relation queries the response was YES. [2022-01-19 09:27:18,638 INFO L84 FinitePrefix]: Finished finitePrefix Result has 320280 conditions, 42396 events. 19477/42396 cut-off events. For 1482183/1482581 co-relation queries the response was YES. Maximal size of possible extension queue 879. Compared 446841 event pairs, 3379 based on Foata normal form. 128/41828 useless extension candidates. Maximal degree in co-relation 320094. Up to 15506 conditions per place. [2022-01-19 09:27:19,023 INFO L132 encePairwiseOnDemand]: 135/209 looper letters, 1347 selfloop transitions, 692 changer transitions 84/2245 dead transitions. [2022-01-19 09:27:19,023 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 732 places, 2245 transitions, 31603 flow [2022-01-19 09:27:19,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2022-01-19 09:27:19,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2022-01-19 09:27:19,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 10101 transitions. [2022-01-19 09:27:19,037 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.36613745106568074 [2022-01-19 09:27:19,037 INFO L72 ComplementDD]: Start complementDD. Operand 132 states and 10101 transitions. [2022-01-19 09:27:19,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 132 states and 10101 transitions. [2022-01-19 09:27:19,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 09:27:19,041 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 132 states and 10101 transitions. [2022-01-19 09:27:19,055 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 133 states, 132 states have (on average 76.52272727272727) internal successors, (10101), 132 states have internal predecessors, (10101), 0 states have call successors, (0), 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-01-19 09:27:19,080 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 133 states, 133 states have (on average 209.0) internal successors, (27797), 133 states have internal predecessors, (27797), 0 states have call successors, (0), 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-01-19 09:27:19,086 INFO L81 ComplementDD]: Finished complementDD. Result has 133 states, 133 states have (on average 209.0) internal successors, (27797), 133 states have internal predecessors, (27797), 0 states have call successors, (0), 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-01-19 09:27:19,086 INFO L186 Difference]: Start difference. First operand has 635 places, 961 transitions, 9462 flow. Second operand 132 states and 10101 transitions. [2022-01-19 09:27:19,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 732 places, 2245 transitions, 31603 flow [2022-01-19 09:27:25,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 720 places, 2245 transitions, 30576 flow, removed 468 selfloop flow, removed 12 redundant places. [2022-01-19 09:27:25,110 INFO L242 Difference]: Finished difference. Result has 792 places, 1303 transitions, 15748 flow [2022-01-19 09:27:25,111 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=8913, PETRI_DIFFERENCE_MINUEND_PLACES=589, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=961, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=387, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=466, PETRI_DIFFERENCE_SUBTRAHEND_STATES=132, PETRI_FLOW=15748, PETRI_PLACES=792, PETRI_TRANSITIONS=1303} [2022-01-19 09:27:25,111 INFO L334 CegarLoopForPetriNet]: 187 programPoint places, 605 predicate places. [2022-01-19 09:27:25,111 INFO L470 AbstractCegarLoop]: Abstraction has has 792 places, 1303 transitions, 15748 flow [2022-01-19 09:27:25,112 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 71.21311475409836) internal successors, (4344), 61 states have internal predecessors, (4344), 0 states have call successors, (0), 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-01-19 09:27:25,112 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 09:27:25,112 INFO L254 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] [2022-01-19 09:27:25,119 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-01-19 09:27:25,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-01-19 09:27:25,319 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 09:27:25,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 09:27:25,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1960467287, now seen corresponding path program 1 times [2022-01-19 09:27:25,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 09:27:25,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160813446] [2022-01-19 09:27:25,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:27:25,320 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 09:27:25,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:27:25,518 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 09:27:25,518 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 09:27:25,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160813446] [2022-01-19 09:27:25,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160813446] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 09:27:25,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850901194] [2022-01-19 09:27:25,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:27:25,519 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 09:27:25,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 09:27:25,528 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-01-19 09:27:25,530 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-01-19 09:27:25,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:27:25,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-19 09:27:25,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 09:27:25,895 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 09:27:25,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 09:27:26,198 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 09:27:26,199 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850901194] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 09:27:26,199 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 09:27:26,199 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 19 [2022-01-19 09:27:26,199 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008954986] [2022-01-19 09:27:26,199 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 09:27:26,200 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-19 09:27:26,200 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 09:27:26,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-19 09:27:26,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-01-19 09:27:26,202 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 209 [2022-01-19 09:27:26,204 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 792 places, 1303 transitions, 15748 flow. Second operand has 19 states, 19 states have (on average 167.47368421052633) internal successors, (3182), 19 states have internal predecessors, (3182), 0 states have call successors, (0), 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-01-19 09:27:26,204 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 09:27:26,204 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 209 [2022-01-19 09:27:26,204 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 09:27:37,855 INFO L129 PetriNetUnfolder]: 6033/25718 cut-off events. [2022-01-19 09:27:37,856 INFO L130 PetriNetUnfolder]: For 1024327/1040762 co-relation queries the response was YES. [2022-01-19 09:27:39,255 INFO L84 FinitePrefix]: Finished finitePrefix Result has 172868 conditions, 25718 events. 6033/25718 cut-off events. For 1024327/1040762 co-relation queries the response was YES. Maximal size of possible extension queue 674. Compared 330169 event pairs, 1433 based on Foata normal form. 305/24767 useless extension candidates. Maximal degree in co-relation 172616. Up to 3960 conditions per place. [2022-01-19 09:27:39,363 INFO L132 encePairwiseOnDemand]: 187/209 looper letters, 340 selfloop transitions, 477 changer transitions 10/1708 dead transitions. [2022-01-19 09:27:39,363 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 812 places, 1708 transitions, 23273 flow [2022-01-19 09:27:39,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-01-19 09:27:39,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-01-19 09:27:39,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 5176 transitions. [2022-01-19 09:27:39,367 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.825518341307815 [2022-01-19 09:27:39,367 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 5176 transitions. [2022-01-19 09:27:39,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 5176 transitions. [2022-01-19 09:27:39,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 09:27:39,369 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 5176 transitions. [2022-01-19 09:27:39,374 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 172.53333333333333) internal successors, (5176), 30 states have internal predecessors, (5176), 0 states have call successors, (0), 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-01-19 09:27:39,379 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 209.0) internal successors, (6479), 31 states have internal predecessors, (6479), 0 states have call successors, (0), 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-01-19 09:27:39,380 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 209.0) internal successors, (6479), 31 states have internal predecessors, (6479), 0 states have call successors, (0), 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-01-19 09:27:39,380 INFO L186 Difference]: Start difference. First operand has 792 places, 1303 transitions, 15748 flow. Second operand 30 states and 5176 transitions. [2022-01-19 09:27:39,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 812 places, 1708 transitions, 23273 flow [2022-01-19 09:27:45,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 781 places, 1708 transitions, 21214 flow, removed 939 selfloop flow, removed 31 redundant places. [2022-01-19 09:27:45,890 INFO L242 Difference]: Finished difference. Result has 795 places, 1524 transitions, 19061 flow [2022-01-19 09:27:45,891 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=14177, PETRI_DIFFERENCE_MINUEND_PLACES=752, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=287, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=996, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=19061, PETRI_PLACES=795, PETRI_TRANSITIONS=1524} [2022-01-19 09:27:45,891 INFO L334 CegarLoopForPetriNet]: 187 programPoint places, 608 predicate places. [2022-01-19 09:27:45,891 INFO L470 AbstractCegarLoop]: Abstraction has has 795 places, 1524 transitions, 19061 flow [2022-01-19 09:27:45,892 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 167.47368421052633) internal successors, (3182), 19 states have internal predecessors, (3182), 0 states have call successors, (0), 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-01-19 09:27:45,892 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 09:27:45,892 INFO L254 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] [2022-01-19 09:27:45,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-01-19 09:27:46,115 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 09:27:46,115 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 09:27:46,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 09:27:46,116 INFO L85 PathProgramCache]: Analyzing trace with hash 337846925, now seen corresponding path program 3 times [2022-01-19 09:27:46,116 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 09:27:46,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683818144] [2022-01-19 09:27:46,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:27:46,116 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 09:27:46,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:27:46,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 09:27:46,348 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 09:27:46,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683818144] [2022-01-19 09:27:46,348 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683818144] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 09:27:46,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311438867] [2022-01-19 09:27:46,348 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-19 09:27:46,348 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 09:27:46,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 09:27:46,352 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-01-19 09:27:46,353 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-01-19 09:27:46,490 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-19 09:27:46,490 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 09:27:46,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 40 conjunts are in the unsatisfiable core [2022-01-19 09:27:46,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 09:27:47,564 INFO L353 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-01-19 09:27:47,564 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 13 [2022-01-19 09:27:47,675 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 09:27:47,675 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 09:27:48,163 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 09:27:48,163 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 26 [2022-01-19 09:27:49,585 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 09:27:49,585 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1311438867] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 09:27:49,585 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 09:27:49,586 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 21, 22] total 46 [2022-01-19 09:27:49,586 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283699689] [2022-01-19 09:27:49,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 09:27:49,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-01-19 09:27:49,586 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 09:27:49,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-01-19 09:27:49,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1901, Unknown=0, NotChecked=0, Total=2070 [2022-01-19 09:27:49,590 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 209 [2022-01-19 09:27:49,593 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 795 places, 1524 transitions, 19061 flow. Second operand has 46 states, 46 states have (on average 85.8695652173913) internal successors, (3950), 46 states have internal predecessors, (3950), 0 states have call successors, (0), 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-01-19 09:27:49,593 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 09:27:49,593 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 209 [2022-01-19 09:27:49,593 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 09:28:49,397 INFO L129 PetriNetUnfolder]: 35420/82717 cut-off events. [2022-01-19 09:28:49,397 INFO L130 PetriNetUnfolder]: For 5859006/5859689 co-relation queries the response was YES. [2022-01-19 09:28:54,814 INFO L84 FinitePrefix]: Finished finitePrefix Result has 806246 conditions, 82717 events. 35420/82717 cut-off events. For 5859006/5859689 co-relation queries the response was YES. Maximal size of possible extension queue 2230. Compared 1011979 event pairs, 7015 based on Foata normal form. 315/81550 useless extension candidates. Maximal degree in co-relation 805989. Up to 23528 conditions per place. [2022-01-19 09:28:55,549 INFO L132 encePairwiseOnDemand]: 147/209 looper letters, 2000 selfloop transitions, 1321 changer transitions 154/3627 dead transitions. [2022-01-19 09:28:55,549 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 958 places, 3627 transitions, 60088 flow [2022-01-19 09:28:55,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2022-01-19 09:28:55,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2022-01-19 09:28:55,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 14556 transitions. [2022-01-19 09:28:55,565 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4246703232582565 [2022-01-19 09:28:55,565 INFO L72 ComplementDD]: Start complementDD. Operand 164 states and 14556 transitions. [2022-01-19 09:28:55,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 164 states and 14556 transitions. [2022-01-19 09:28:55,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 09:28:55,570 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 164 states and 14556 transitions. [2022-01-19 09:28:55,588 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 165 states, 164 states have (on average 88.7560975609756) internal successors, (14556), 164 states have internal predecessors, (14556), 0 states have call successors, (0), 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-01-19 09:28:55,624 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 165 states, 165 states have (on average 209.0) internal successors, (34485), 165 states have internal predecessors, (34485), 0 states have call successors, (0), 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-01-19 09:28:55,631 INFO L81 ComplementDD]: Finished complementDD. Result has 165 states, 165 states have (on average 209.0) internal successors, (34485), 165 states have internal predecessors, (34485), 0 states have call successors, (0), 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-01-19 09:28:55,631 INFO L186 Difference]: Start difference. First operand has 795 places, 1524 transitions, 19061 flow. Second operand 164 states and 14556 transitions. [2022-01-19 09:28:55,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 958 places, 3627 transitions, 60088 flow [2022-01-19 09:29:29,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 950 places, 3627 transitions, 58622 flow, removed 592 selfloop flow, removed 8 redundant places. [2022-01-19 09:29:29,504 INFO L242 Difference]: Finished difference. Result has 1031 places, 2312 transitions, 33729 flow [2022-01-19 09:29:29,506 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=18349, PETRI_DIFFERENCE_MINUEND_PLACES=787, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1524, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=628, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=762, PETRI_DIFFERENCE_SUBTRAHEND_STATES=164, PETRI_FLOW=33729, PETRI_PLACES=1031, PETRI_TRANSITIONS=2312} [2022-01-19 09:29:29,507 INFO L334 CegarLoopForPetriNet]: 187 programPoint places, 844 predicate places. [2022-01-19 09:29:29,507 INFO L470 AbstractCegarLoop]: Abstraction has has 1031 places, 2312 transitions, 33729 flow [2022-01-19 09:29:29,507 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 85.8695652173913) internal successors, (3950), 46 states have internal predecessors, (3950), 0 states have call successors, (0), 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-01-19 09:29:29,507 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 09:29:29,508 INFO L254 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] [2022-01-19 09:29:29,514 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-01-19 09:29:29,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-01-19 09:29:29,712 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 09:29:29,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 09:29:29,712 INFO L85 PathProgramCache]: Analyzing trace with hash 2141440705, now seen corresponding path program 2 times [2022-01-19 09:29:29,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 09:29:29,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838999352] [2022-01-19 09:29:29,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:29:29,713 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 09:29:29,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:29:29,908 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 09:29:29,908 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 09:29:29,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838999352] [2022-01-19 09:29:29,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838999352] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 09:29:29,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118323514] [2022-01-19 09:29:29,908 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 09:29:29,909 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 09:29:29,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 09:29:29,912 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-01-19 09:29:29,913 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-01-19 09:29:29,997 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 09:29:29,997 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 09:29:29,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-19 09:29:30,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 09:29:30,376 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 09:29:30,376 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 09:29:30,682 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 09:29:30,682 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118323514] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 09:29:30,682 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 09:29:30,682 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 18 [2022-01-19 09:29:30,682 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429166837] [2022-01-19 09:29:30,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 09:29:30,683 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-19 09:29:30,683 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 09:29:30,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-19 09:29:30,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2022-01-19 09:29:30,685 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 209 [2022-01-19 09:29:30,687 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1031 places, 2312 transitions, 33729 flow. Second operand has 18 states, 18 states have (on average 167.55555555555554) internal successors, (3016), 18 states have internal predecessors, (3016), 0 states have call successors, (0), 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-01-19 09:29:30,687 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 09:29:30,687 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 209 [2022-01-19 09:29:30,687 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 09:29:57,115 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([507] L51-1-->L51-2: Formula: (= v_~x1~0_3 |v_thread1Thread1of1ForFork0_#t~mem1#1_3|) InVars {thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_3|} OutVars{thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_3|, ~x1~0=v_~x1~0_3} AuxVars[] AssignedVars[~x1~0][1500], [4040#true, 79#L95-1true, Black: 5606#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= 0 (+ (- 1) |thread1Thread1of1ForFork0_~i~0#1|))), Black: 6164#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 0 (div (+ (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (* (- 1) (mod (+ |thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296))) 4294967296)) (not (< (mod (+ |thread2Thread1of1ForFork1_#t~post10#1| 1) 4294967296) (mod ~n~0 4294967296)))), Black: 6156#(and (not (< 1 (mod ~n~0 4294967296))) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= 0 (+ (- 1) |thread1Thread1of1ForFork0_~i~0#1|))), 1529#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0))), Black: 6146#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= 0 (+ (- 1) |thread1Thread1of1ForFork0_~i~0#1|)) (= |thread1Thread1of1ForFork0_#t~post2#1| 0)), Black: 6148#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (not (< (mod (+ |thread2Thread1of1ForFork1_#t~post10#1| 1) 4294967296) (mod ~n~0 4294967296)))), Black: 6154#(and (< (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296)) (+ (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (div (+ 4294967294 ~n~0) 4294967296))) (= |thread1Thread1of1ForFork0_~i~0#1| 1) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 6130#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (not (< (mod (+ |thread2Thread1of1ForFork1_#t~post10#1| 1) 4294967296) (mod ~n~0 4294967296))) (not (< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (mod ~n~0 4294967296))) (not (< (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod ~n~0 4294967296)))), Black: 6158#(and (<= 0 (div (+ (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (* (- 1) (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296))) 4294967296)) (not (< (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (mod ~n~0 4294967296)))), Black: 6136#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 0 (div (+ (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (* (- 1) (mod (+ |thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296))) 4294967296))), Black: 5298#true, Black: 5823#(<= 0 (div (+ (mod (+ |thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) (* (- 1) (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296))) 4294967296)), Black: 5787#(not (< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (mod ~n~0 4294967296))), 2805#true, Black: 1099#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ (* (div (+ (* (- 1) |thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1) ~n~0) (= ~x2~0 ~x1~0)), Black: 1083#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem9#1|) (= ~x2~0 ~x1~0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0))), Black: 1105#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset))) (<= (+ (* (div (+ (* (- 1) |thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1) ~n~0) (= ~x2~0 ~x1~0)), Black: 1057#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0)), Black: 1035#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0)) (= ~x2~0 0) (= ~f~0.offset 0)), Black: 1107#(and (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset))) (<= (+ (* (div (+ (* (- 1) |thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1) ~n~0)), Black: 1067#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem9#1|) (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0)) (= ~x2~0 0) (= ~f~0.offset 0)), Black: 1037#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0)) (= ~x2~0 0) (= ~f~0.offset 0)), 235#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 1093#(and (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem9#1|) (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ (* (div (+ (* (- 1) |thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1) ~n~0) (= ~x2~0 ~x1~0)), Black: 1097#(and (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem9#1|) (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ (* (div (+ 4294967294 ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1) ~n~0) (<= (+ (* (div (+ (* (- 1) |thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1) ~n~0) (= ~x2~0 ~x1~0)), Black: 1091#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x2~0 ~x1~0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0)) (= |thread1Thread1of1ForFork0_#t~post2#1| 0)), Black: 1045#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ (* (div (+ (* (- 1) |thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1) ~n~0) (= ~x2~0 0) (= ~f~0.offset 0)), Black: 1041#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ (* (div (+ (* (- 1) |thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1) ~n~0) (= |thread1Thread1of1ForFork0_#t~post2#1| 0) (= ~x2~0 0) (= ~f~0.offset 0)), Black: 1050#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ (* (div (+ 4294967294 ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1) ~n~0) (<= (+ (* (div (+ (* (- 1) |thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1) ~n~0) (= ~x2~0 0) (= ~f~0.offset 0)), Black: 5190#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (<= 2 |thread2Thread1of1ForFork1_#t~post8#1|) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (<= (+ |thread2Thread1of1ForFork1_#t~post8#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0))), Black: 1103#(and (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem9#1|) (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset))) (<= (+ (* (div (+ (* (- 1) |thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1) ~n~0) (= ~x2~0 ~x1~0)), Black: 5074#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ ~f~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~f~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~x1~0 0) (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= ~size~0 1) (< ~x2~0 ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (exists ((~x2~0 Int)) (and (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) |thread2Thread1of1ForFork1_#t~mem5#1|) (<= 0 ~x2~0) (< ~x2~0 ~size~0)))), Black: 1026#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (= ~x2~0 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: 5164#(and (< |thread2Thread1of1ForFork1_#t~mem7#1| 1) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (<= 0 |thread2Thread1of1ForFork1_#t~mem7#1|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1)), Black: 1069#(and (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ (* (div (+ (* (- 1) |thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1) ~n~0) (<= (+ 4294967295 ~n~0 (* (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 4294967296)) (* (div (+ 4294967295 ~n~0) 4294967296) 4294967296)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= ~x2~0 0) (= ~f~0.offset 0)), Black: 4042#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 1039#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0)) (= |thread1Thread1of1ForFork0_#t~post2#1| 0) (= ~x2~0 0) (= ~f~0.offset 0)), Black: 5091#(and (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (= ~x1~0 0) (exists ((v_~x2~0_27 Int)) (and (<= 0 v_~x2~0_27) (< v_~x2~0_27 ~size~0) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~x2~0_27 4) ~f~0.offset)) ~x2~0))) (<= ~size~0 1)), Black: 1109#(and (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ (* (div (+ (* (- 1) |thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1) ~n~0)), Black: 5161#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1)), Black: 5079#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ ~f~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~f~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~x1~0 0) (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= ~size~0 1) (< ~x2~0 ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1)) (exists ((~x2~0 Int)) (and (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) |thread2Thread1of1ForFork1_#t~mem5#1|) (<= 0 ~x2~0) (< ~x2~0 ~size~0)))), Black: 1061#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0))), Black: 1053#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ (* (div (+ 4294967294 ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1) ~n~0) (<= (+ (* (div (+ (* (- 1) |thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1) ~n~0)), Black: 1085#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x2~0 ~x1~0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0))), Black: 4050#(and (not (<= (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (div (+ 4294967294 ~n~0) 4294967296))) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 3 ~n~0))), Black: 1028#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0)) (= ~x2~0 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: 5167#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296))), Black: 5185#(and (not (<= (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (div (+ 4294967294 ~n~0) 4294967296))) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 3 ~n~0)) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1)), Black: 1071#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ (* (div (+ (* (- 1) |thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1) ~n~0) (<= (+ 4294967295 ~n~0 (* (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 4294967296)) (* (div (+ 4294967295 ~n~0) 4294967296) 4294967296)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 1089#(and (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem9#1|) (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ (* (div (+ (* (- 1) |thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1) ~n~0) (= ~x2~0 ~x1~0) (= |thread1Thread1of1ForFork0_#t~post2#1| 0)), Black: 1087#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem9#1|) (= ~x2~0 ~x1~0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0)) (= |thread1Thread1of1ForFork0_#t~post2#1| 0)), Black: 5101#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296))), Black: 1101#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ (* (div (+ 4294967294 ~n~0 (* (div ~n~0 4294967296) (- 4294967296))) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1) ~n~0) (<= (+ (* (div (+ (* (- 1) |thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1) ~n~0) (= ~x2~0 ~x1~0)), Black: 1095#(and (<= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ (* (div (+ (* (- 1) |thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296) 1) ~n~0) (= ~x2~0 ~x1~0) (= |thread1Thread1of1ForFork0_#t~post2#1| 0)), Black: 5158#(and (< |thread2Thread1of1ForFork1_#t~mem7#1| 1) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (<= 0 |thread2Thread1of1ForFork1_#t~mem7#1|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296))), Black: 725#(= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0), Black: 4945#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (<= ~size~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret15#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret15#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 5096#(and (<= (+ |thread2Thread1of1ForFork1_#t~post6#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1)) (= ~x1~0 0) (exists ((v_~x2~0_27 Int)) (and (<= 0 v_~x2~0_27) (< v_~x2~0_27 ~size~0) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~x2~0_27 4) ~f~0.offset)) ~x2~0))) (<= ~size~0 1) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (<= 1 |thread2Thread1of1ForFork1_#t~post6#1|)), Black: 5106#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (or (< (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) 0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) (+ ~f~0.offset (* (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) 4)))) (<= ~size~0 (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset))))), Black: 5118#(and (or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (or (< (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) 0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) (+ ~f~0.offset (* (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) 4)))) (<= ~size~0 (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset))))), Black: 5108#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (exists ((v_~x2~0_27 Int)) (and (or (and (or (and (< v_~x2~0_27 ~x2~0) (< v_~x2~0_27 1)) (and (< v_~x2~0_27 1) (not (<= 0 ~x2~0)))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (and (< v_~x2~0_27 1) (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 1))) (<= 0 v_~x2~0_27) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~x2~0_27 4) ~f~0.offset)) ~x2~0)))), Black: 5192#(and (not (<= (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (div (+ 4294967294 ~n~0) 4294967296))) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 3 ~n~0)) (<= 2 |thread2Thread1of1ForFork1_#t~post8#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (<= (+ |thread2Thread1of1ForFork1_#t~post8#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0))), Black: 5155#(and (< |thread2Thread1of1ForFork1_#t~mem7#1| 1) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (<= 0 |thread2Thread1of1ForFork1_#t~mem7#1|) (= ~x1~0 0)), Black: 5141#(and (< |thread2Thread1of1ForFork1_#t~mem7#1| 1) (<= 0 |thread2Thread1of1ForFork1_#t~mem7#1|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1)), 201#true, Black: 5116#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (exists ((v_~x2~0_27 Int)) (and (<= 0 v_~x2~0_27) (or (and (< v_~x2~0_27 1) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (and (or (and (< v_~x2~0_27 ~x2~0) (< v_~x2~0_27 1)) (and (< v_~x2~0_27 1) (not (<= 0 ~x2~0)))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~x2~0_27 4) ~f~0.offset)) ~x2~0)))), Black: 4081#(= ~x1~0 0), Black: 5143#(and (< |thread2Thread1of1ForFork1_#t~mem7#1| 1) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 0 |thread2Thread1of1ForFork1_#t~mem7#1|) (= ~x1~0 0)), Black: 4941#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (<= ~size~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 4546#(= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0), Black: 4048#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296))), Black: 4426#(and (< |thread2Thread1of1ForFork1_#t~mem7#1| 1) (<= 0 |thread2Thread1of1ForFork1_#t~mem7#1|) (= ~x1~0 0)), Black: 4046#(and (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1))), Black: 4502#(= ~x2~0 ~x1~0), Black: 5207#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (= ~x1~0 0)), Black: 5126#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (exists ((v_~x2~0_27 Int)) (and (< v_~x2~0_27 1) (<= 0 v_~x2~0_27) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~x2~0_27 4) ~f~0.offset)) ~x2~0)))), Black: 5147#(and (< |thread2Thread1of1ForFork1_#t~mem7#1| 1) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (<= 0 |thread2Thread1of1ForFork1_#t~mem7#1|) (= ~x1~0 0) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296))), Black: 5171#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1)), Black: 4416#(and (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (exists ((v_~x2~0_27 Int)) (and (< v_~x2~0_27 1) (<= 0 v_~x2~0_27) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~x2~0_27 4) ~f~0.offset)) ~x2~0)))), Black: 4285#(and (= ~x1~0 0) (<= ~size~0 1)), Black: 5205#(and (not (<= (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (div (+ 4294967294 ~n~0) 4294967296))) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 3 ~n~0)) (= ~x1~0 0)), Black: 4386#(and (= ~x1~0 0) (exists ((v_~x2~0_27 Int)) (and (<= 0 v_~x2~0_27) (< v_~x2~0_27 ~size~0) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~x2~0_27 4) ~f~0.offset)) ~x2~0))) (<= ~size~0 1)), Black: 5149#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (or (< (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) 0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) (+ ~f~0.offset (* (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) 4)))) (<= ~size~0 (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset))))), Black: 5045#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~x1~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 4412#(and (= ~x1~0 0) (exists ((v_~x2~0_27 Int)) (and (<= 0 v_~x2~0_27) (or (and (< v_~x2~0_27 1) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (and (or (and (< v_~x2~0_27 ~x2~0) (< v_~x2~0_27 1)) (and (< v_~x2~0_27 1) (not (<= 0 ~x2~0)))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~x2~0_27 4) ~f~0.offset)) ~x2~0)))), Black: 5152#(and (< |thread2Thread1of1ForFork1_#t~mem7#1| 1) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 0 |thread2Thread1of1ForFork1_#t~mem7#1|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1)), Black: 5182#(and (not (<= (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (div (+ 4294967294 ~n~0) 4294967296))) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 3 ~n~0)) (= ~x1~0 0) (<= 0 ~x2~0) (<= 2 |thread2Thread1of1ForFork1_#t~post8#1|) (< ~x2~0 1) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (<= (+ |thread2Thread1of1ForFork1_#t~post8#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0))), Black: 5177#(and (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem7#1|) (= ~x2~0 ~x1~0)), Black: 4430#(and (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1)), 204#true, Black: 5124#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (= ~x1~0 0) (exists ((v_~x2~0_27 Int)) (and (<= 0 v_~x2~0_27) (or (and (< v_~x2~0_27 1) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (and (or (and (< v_~x2~0_27 ~x2~0) (< v_~x2~0_27 1)) (and (< v_~x2~0_27 1) (not (<= 0 ~x2~0)))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~x2~0_27 4) ~f~0.offset)) ~x2~0)))), Black: 4542#(= ~x1~0 |thread2Thread1of1ForFork1_#t~mem7#1|), Black: 5175#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (= ~x1~0 0) (<= 0 ~x2~0) (<= 2 |thread2Thread1of1ForFork1_#t~post8#1|) (< ~x2~0 1) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (<= (+ |thread2Thread1of1ForFork1_#t~post8#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0))), Black: 5201#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0)), Black: 5099#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (= ~x1~0 0) (exists ((v_~x2~0_27 Int)) (and (<= 0 v_~x2~0_27) (< v_~x2~0_27 ~size~0) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~x2~0_27 4) ~f~0.offset)) ~x2~0))) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= ~size~0 1) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296))), Black: 5120#(and (<= (+ |thread2Thread1of1ForFork1_#t~post6#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1)) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= 1 |thread2Thread1of1ForFork1_#t~post6#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1))), Black: 4405#(and (= ~x1~0 0) (exists ((v_~x2~0_27 Int)) (and (or (and (or (and (< v_~x2~0_27 ~x2~0) (< v_~x2~0_27 1)) (and (< v_~x2~0_27 1) (not (<= 0 ~x2~0)))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (and (< v_~x2~0_27 1) (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 1))) (<= 0 v_~x2~0_27) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~x2~0_27 4) ~f~0.offset)) ~x2~0)))), Black: 5071#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~x1~0 0) (= |thread2Thread1of1ForFork1_#t~post4#1| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1))), Black: 4947#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ ~f~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~f~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (<= ~size~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret15#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret15#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 5088#(and (= ~x1~0 0) (exists ((v_~x2~0_27 Int)) (and (<= 0 v_~x2~0_27) (< v_~x2~0_27 ~size~0) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~x2~0_27 4) ~f~0.offset)) ~x2~0))) (<= ~size~0 1) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1))), Black: 5012#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ ~f~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~f~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~x1~0 0) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 5021#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ ~f~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~f~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~x1~0 0) (= |thread2Thread1of1ForFork1_#t~post4#1| 0) (<= ~size~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1))), Black: 5068#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ ~f~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~f~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~x1~0 0) (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= ~size~0 1) (< ~x2~0 ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (exists ((~x2~0 Int)) (and (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) |thread2Thread1of1ForFork1_#t~mem5#1|) (<= 0 ~x2~0) (< ~x2~0 ~size~0)))), Black: 5129#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (<= (+ |thread2Thread1of1ForFork1_#t~post6#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1)) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (<= 1 |thread2Thread1of1ForFork1_#t~post6#1|)), Black: 5132#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (exists ((v_~x2~0_27 Int)) (and (< v_~x2~0_27 1) (<= 0 v_~x2~0_27) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~x2~0_27 4) ~f~0.offset)) ~x2~0)))), Black: 4943#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (<= ~size~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 5084#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (exists ((v_~x2~0_27 Int)) (and (<= 0 v_~x2~0_27) (< v_~x2~0_27 ~size~0) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~x2~0_27 4) ~f~0.offset)) ~x2~0))) (<= ~size~0 1)), Black: 5081#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ ~f~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~f~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~x1~0 0) (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= ~size~0 1) (< ~x2~0 ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (exists ((~x2~0 Int)) (and (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) |thread2Thread1of1ForFork1_#t~mem5#1|) (<= 0 ~x2~0) (< ~x2~0 ~size~0)))), Black: 5122#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (= ~x1~0 0) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (exists ((v_~x2~0_27 Int)) (and (<= 0 v_~x2~0_27) (or (and (< v_~x2~0_27 1) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (and (or (and (< v_~x2~0_27 ~x2~0) (< v_~x2~0_27 1)) (and (< v_~x2~0_27 1) (not (<= 0 ~x2~0)))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~x2~0_27 4) ~f~0.offset)) ~x2~0)))), 299#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0))), Black: 207#(and (<= (+ 4294967295 (* (div ~n~0 4294967296) 4294967296) (* (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 4294967296)) (+ (* (div (+ 4294967295 ~n~0) 4294967296) 4294967296) |thread2Thread1of1ForFork1_~i~1#1|)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 206#(= |thread2Thread1of1ForFork1_~i~1#1| 0), Black: 219#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ ~n~0 (* (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 4294967296)) (* (div ~n~0 4294967296) 4294967296))), Black: 217#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 0 (div (+ (* (- 1) ~n~0) (* (div ~n~0 4294967296) 4294967296)) 4294967296))), Black: 227#(and (or (not (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296))) (<= (+ 4294967294 ~n~0 (* (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 4294967296)) (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296)))) (or (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)))), Black: 226#(or (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296))), Black: 236#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 238#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= (+ 2 (* (div (+ 4294967295 ~n~0) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0 (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296)))), Black: 2760#(and (= |thread2Thread1of1ForFork1_~i~1#1| 1) (not (< 0 (mod (+ 4294967294 ~n~0) 4294967296)))), Black: 2656#(and (not (< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (mod (+ 4294967294 ~n~0) 4294967296))) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 2800#(and (= |thread2Thread1of1ForFork1_#t~post10#1| 0) (= |thread2Thread1of1ForFork1_~i~1#1| 1) (not (< (mod |thread2Thread1of1ForFork1_#t~post10#1| 4294967296) (mod (+ 4294967294 ~n~0) 4294967296)))), Black: 248#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (< (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296)) (+ (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (div (+ 4294967294 ~n~0) 4294967296))) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 247#(and (< (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296)) (div (+ 4294967294 ~n~0) 4294967296)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 249#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= (+ 2 (* (div (+ 4294967295 ~n~0) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0 (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296)))), Black: 259#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= (+ 2 (* (div (+ 4294967295 ~n~0) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0 (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296)))), Black: 258#(<= (+ (div ~n~0 4294967296) 1) (+ (div (+ 4294967294 ~n~0 (* (div (+ 4294967295 ~n~0) 4294967296) (- 4294967296))) 4294967296) (div (+ 4294967294 ~n~0) 4294967296))), Black: 278#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 281#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296) (+ ~n~0 (* (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 4294967296))) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 277#(= |thread2Thread1of1ForFork1_~i~1#1| 0), Black: 289#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 291#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= (+ 2 (* (div (+ 4294967295 ~n~0) 4294967296) 4294967296) (* (div ~n~0 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0 (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296)))), Black: 290#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (< (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296)) (+ (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (div (+ 4294967294 ~n~0) 4294967296))) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 7257#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (<= (+ |thread2Thread1of1ForFork1_#t~post6#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1)) (= ~x1~0 0) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= 1 |thread2Thread1of1ForFork1_#t~post6#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1)) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), 5300#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 7155#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (= ~x1~0 0) (<= ~size~0 1) (or (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))) (and (or (not (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))) (not (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))) (or (and (or (not (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))) (not (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)))) (= ~x2~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1))), Black: 7412#(and (not (<= (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (div (+ 4294967294 ~n~0) 4294967296))) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 3 ~n~0)) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 7415#(and (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem7#1|) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296))), Black: 7265#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (<= (+ |thread2Thread1of1ForFork1_#t~post6#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1)) (= ~x1~0 0) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 1 |thread2Thread1of1ForFork1_#t~post6#1|) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 7300#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (<= (+ |thread2Thread1of1ForFork1_#t~post6#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1)) (= ~x1~0 0) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= 1 |thread2Thread1of1ForFork1_#t~post6#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1)) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 7408#(and (not (<= (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (div (+ 4294967294 ~n~0) 4294967296))) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 3 ~n~0)) (= ~x1~0 0) (<= 0 ~x2~0) (<= 2 |thread2Thread1of1ForFork1_#t~post8#1|) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (<= (+ |thread2Thread1of1ForFork1_#t~post8#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 7379#(and (< |thread2Thread1of1ForFork1_#t~mem7#1| 1) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (<= 0 |thread2Thread1of1ForFork1_#t~mem7#1|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 7237#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (= ~x1~0 0) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1)) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 7095#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (= (select (select |#memory_int| ~f~0.base) ~f~0.offset) |thread2Thread1of1ForFork1_#t~mem3#1|) (= ~x1~0 0) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= ~x2~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 7061#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (= ~x1~0 0) (<= ~size~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~x2~0 0)), Black: 7424#(and (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem7#1|)), Black: 7244#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (= ~x1~0 0) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 7091#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= (select (select |#memory_int| ~f~0.base) ~f~0.offset) |thread2Thread1of1ForFork1_#t~mem3#1|) (= ~x1~0 0) (<= ~size~0 1) (= ~x2~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 7308#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (or (and (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 1)) (and (or (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~x2~0) (not (<= 0 ~x2~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))) (= ~x1~0 0) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 7359#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 7298#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (= ~x1~0 0) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1)) (forall ((~x2~0 Int)) (or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (<= ~size~0 ~x2~0) (< ~x2~0 0)))), Black: 7291#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (or (and (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 1)) (and (or (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~x2~0) (not (<= 0 ~x2~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))) (= ~x1~0 0) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 7371#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (= ~x1~0 0) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 7059#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= ~size~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~x2~0 0)), Black: 6196#(and (not (<= (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (div (+ 4294967294 ~n~0) 4294967296))) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 3 ~n~0))), Black: 7349#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (or (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (and (or (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~x2~0)) (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (not (<= 0 ~x2~0)))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))) (= ~x1~0 0) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 7462#(and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 7132#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (= ~x1~0 0) (<= ~size~0 1) (or (and (or (not (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))) (not (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)))) (= ~x2~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1))), Black: 7441#(and (not (<= (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (div (+ 4294967294 ~n~0) 4294967296))) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 3 ~n~0)) (<= 2 |thread2Thread1of1ForFork1_#t~post8#1|) (= ~x2~0 ~x1~0) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (<= (+ |thread2Thread1of1ForFork1_#t~post8#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0))), Black: 7363#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 7070#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (= ~x1~0 0) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~x2~0 0)), Black: 6553#(and (or (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (and (or (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~x2~0)) (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (not (<= 0 ~x2~0)))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))) (= ~x1~0 0) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 7233#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (= ~x1~0 0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (forall ((~x2~0 Int)) (or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (<= ~size~0 ~x2~0) (< ~x2~0 0)))) (<= ~size~0 1) (or (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))) (and (or (not (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))) (not (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))) (= ~x2~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1)) (or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))), Black: 7422#(and (not (<= (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (div (+ 4294967294 ~n~0) 4294967296))) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 3 ~n~0)) (<= 2 |thread2Thread1of1ForFork1_#t~post8#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (<= (+ |thread2Thread1of1ForFork1_#t~post8#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0))), Black: 7401#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (= ~x1~0 0) (<= 0 ~x2~0) (<= 2 |thread2Thread1of1ForFork1_#t~post8#1|) (< ~x2~0 1) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (<= (+ |thread2Thread1of1ForFork1_#t~post8#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 2356#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x2~0 ~x1~0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0))), Black: 7417#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (<= 2 |thread2Thread1of1ForFork1_#t~post8#1|) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (<= (+ |thread2Thread1of1ForFork1_#t~post8#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0))), Black: 2324#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= (select (select |#memory_int| ~f~0.base) ~f~0.offset) |thread2Thread1of1ForFork1_#t~mem9#1|) (= ~x1~0 0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0)) (= ~f~0.offset 0)), Black: 7317#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (<= (+ |thread2Thread1of1ForFork1_#t~post6#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1)) (= ~x1~0 0) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 1 |thread2Thread1of1ForFork1_#t~post6#1|) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 7128#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (= ~x1~0 0) (<= ~size~0 1) (or (and (or (not (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))) (not (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)))) (= ~x2~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 2348#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem9#1|) (= |thread1Thread1of1ForFork0_#t~mem1#1| |thread2Thread1of1ForFork1_#t~mem9#1|) (= ~x2~0 ~x1~0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0))), Black: 7426#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (= ~x2~0 ~x1~0) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296))), Black: 2306#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| 4294967295 (* (div ~n~0 4294967296) 4294967296) (* (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) |thread2Thread1of1ForFork1_~i~1#1| (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296))) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= ~x2~0 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: 7157#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (= ~x1~0 0) (<= ~size~0 1) (or (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))) (and (or (not (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))) (not (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))) (or (and (or (not (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))) (not (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)))) (= ~x2~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 1533#(and (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296)) (+ 4294967295 ~n~0)) (<= (+ (div ~n~0 4294967296) 1) (+ (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (div (+ 4294967294 ~n~0) 4294967296))) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 7255#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (= ~x1~0 0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (forall ((~x2~0 Int)) (or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (<= ~size~0 ~x2~0) (< ~x2~0 0)))) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (forall ((~x2~0 Int)) (or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (<= ~size~0 ~x2~0) (< ~x2~0 0)))) (<= ~size~0 1) (= ~x2~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1)) (or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))), Black: 2378#(and (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem9#1|) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296)) (+ 4294967295 ~n~0)) (<= (+ (div ~n~0 4294967296) 1) (+ (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (div (+ 4294967294 ~n~0) 4294967296))) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= ~x2~0 ~x1~0)), Black: 7240#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (= ~x1~0 0) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 2344#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem9#1|) (= |thread1Thread1of1ForFork0_#t~mem1#1| |thread2Thread1of1ForFork1_#t~mem9#1|) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| 4294967295 (* (div ~n~0 4294967296) 4294967296) (* (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) |thread2Thread1of1ForFork1_~i~1#1| (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296))) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 7288#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))), Black: 7338#(and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 2350#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem9#1|) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| 4294967295 (* (div ~n~0 4294967296) 4294967296) (* (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) |thread2Thread1of1ForFork1_~i~1#1| (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296))) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 2299#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0)) (= ~x2~0 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: 7280#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (or (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (and (not (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))) (or (and (or (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~x2~0)) (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (not (<= 0 ~x2~0)))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 1))) (<= ~size~0 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 2310#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= (select (select |#memory_int| ~f~0.base) ~f~0.offset) |thread2Thread1of1ForFork1_#t~mem9#1|) (= ~x1~0 0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0)) (= ~x2~0 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: 7355#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (<= (+ |thread2Thread1of1ForFork1_#t~post6#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1)) (= ~x1~0 0) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= 1 |thread2Thread1of1ForFork1_#t~post6#1|) (forall ((~x2~0 Int)) (or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (<= ~size~0 ~x2~0) (< ~x2~0 0)))), Black: 7458#(and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 2332#(and (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296)) (+ 4294967295 ~n~0)) (<= (+ (div ~n~0 4294967296) 1) (+ (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (div (+ 4294967294 ~n~0) 4294967296))) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= |thread1Thread1of1ForFork0_#t~post2#1| 0) (<= (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (div (+ 4294967294 ~n~0) 4294967296))), Black: 7148#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= ~size~0 1) (or (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))) (and (or (not (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))) (not (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))) (or (and (or (not (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))) (not (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)))) (= ~x2~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 1531#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| 4294967295 (* (div ~n~0 4294967296) 4294967296) (* (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) |thread2Thread1of1ForFork1_~i~1#1| (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296))) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 7374#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (= ~x1~0 0) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (forall ((~x2~0 Int)) (or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (<= ~size~0 ~x2~0) (< ~x2~0 0)))), Black: 2366#(and (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem9#1|) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296)) (+ 4294967295 ~n~0)) (<= (+ (div ~n~0 4294967296) 1) (+ (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (div (+ 4294967294 ~n~0) 4294967296))) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= |thread1Thread1of1ForFork0_#t~post2#1| 0) (<= (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (div (+ 4294967294 ~n~0) 4294967296))), Black: 7304#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (or (and (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 1)) (and (or (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~x2~0) (not (<= 0 ~x2~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))) (= ~x1~0 0) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 2297#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (= ~x2~0 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: 7055#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= ~size~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~x2~0 0)), Black: 2352#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem9#1|) (= |thread1Thread1of1ForFork0_#t~mem1#1| |thread2Thread1of1ForFork1_#t~mem9#1|) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| 4294967295 (* (div ~n~0 4294967296) 4294967296) (* (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) |thread2Thread1of1ForFork1_~i~1#1| (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296))) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= ~x2~0 ~x1~0)), Black: 7368#(and (< |thread2Thread1of1ForFork1_#t~mem7#1| 1) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (<= 0 |thread2Thread1of1ForFork1_#t~mem7#1|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 7097#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0)), Black: 2326#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= (select (select |#memory_int| ~f~0.base) ~f~0.offset) |thread2Thread1of1ForFork1_#t~mem9#1|) (= ~x1~0 0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| 4294967295 (* (div ~n~0 4294967296) 4294967296) (* (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) |thread2Thread1of1ForFork1_~i~1#1| (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296))) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= ~f~0.offset 0)), Black: 2374#(and (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem9#1|) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296)) (+ 4294967295 ~n~0)) (<= (+ (div ~n~0 4294967296) 1) (+ (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (div (+ 4294967294 ~n~0) 4294967296))) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 7123#(and (= ~x1~0 0) (<= ~size~0 1) (or (and (or (not (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))) (not (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)))) (= ~x2~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 6227#(= ~x1~0 0), Black: 1868#(= ~x2~0 ~x1~0), Black: 2376#(and (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296)) (+ 4294967295 ~n~0)) (<= (+ (div ~n~0 4294967296) 1) (+ (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (div (+ 4294967294 ~n~0) 4294967296))) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= ~x2~0 ~x1~0) (= |thread1Thread1of1ForFork0_#t~post2#1| 0) (<= (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (div (+ 4294967294 ~n~0) 4294967296))), Black: 7100#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (= (select (select |#memory_int| ~f~0.base) ~f~0.offset) |thread2Thread1of1ForFork1_#t~mem3#1|) (= ~x1~0 0) (<= ~size~0 1) (= ~x2~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 2372#(and (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem9#1|) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296)) (+ 4294967295 ~n~0)) (<= (+ (div ~n~0 4294967296) 1) (+ (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (div (+ 4294967294 ~n~0) 4294967296))) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= ~x2~0 ~x1~0) (= |thread1Thread1of1ForFork0_#t~post2#1| 0) (<= (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (div (+ 4294967294 ~n~0) 4294967296))), Black: 7126#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= ~size~0 1) (or (and (or (not (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))) (not (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)))) (= ~x2~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 2318#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= (select (select |#memory_int| ~f~0.base) ~f~0.offset) |thread2Thread1of1ForFork1_#t~mem9#1|) (= ~x1~0 0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| 4294967295 (* (div ~n~0 4294967296) 4294967296) (* (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) |thread2Thread1of1ForFork1_~i~1#1| (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296))) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= ~x2~0 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: 7275#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (= ~x1~0 0) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 2358#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem9#1|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= |thread1Thread1of1ForFork0_#t~post2#1| 0) (<= (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (div (+ 4294967294 ~n~0) 4294967296))), Black: 6639#(= ~x2~0 ~x1~0), Black: 1825#(= ~x1~0 |thread2Thread1of1ForFork1_#t~mem9#1|), Black: 7336#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (or (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (and (or (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~x2~0)) (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (not (<= 0 ~x2~0)))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))) (= ~x1~0 0) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 7366#(and (< |thread2Thread1of1ForFork1_#t~mem7#1| 1) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (<= 0 |thread2Thread1of1ForFork1_#t~mem7#1|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 2380#(and (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296)) (+ 4294967295 ~n~0)) (<= (+ (div ~n~0 4294967296) 1) (+ (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (div (+ 4294967294 ~n~0) 4294967296))) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= ~x2~0 ~x1~0)), Black: 2362#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| 4294967295 (* (div ~n~0 4294967296) 4294967296) (* (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) |thread2Thread1of1ForFork1_~i~1#1| (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296))) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= ~x2~0 ~x1~0)), Black: 7322#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (or (and (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 1)) (and (or (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~x2~0) (not (<= 0 ~x2~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))) (= ~x1~0 0) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= ~size~0 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 2816#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 3 ~n~0)) (<= (div (+ 4294967294 ~n~0) 4294967296) (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296)))), Black: 2342#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem9#1|) (= |thread1Thread1of1ForFork0_#t~mem1#1| |thread2Thread1of1ForFork1_#t~mem9#1|) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0))), Black: 7352#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 3708#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (or (and (or (not (<= 0 ~x2~0)) (not (< ~x2~0 ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (and (< ~x2~0 ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1))) (or (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 ~size~0)) (and (or (not (<= 0 ~x2~0)) (not (< ~x2~0 ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~size~0 (+ ~x1~0 1))), Black: 3794#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296)) (+ ~n~0 (* (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 4294967296) 4294967293)) (= ~x1~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2360#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem9#1|) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| 4294967295 (* (div ~n~0 4294967296) 4294967296) (* (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) |thread2Thread1of1ForFork1_~i~1#1| (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296))) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= ~x2~0 ~x1~0)), Black: 7464#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 2346#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem9#1|) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 4294967296) 4294967296) 1) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0))), Black: 7302#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (<= (+ |thread2Thread1of1ForFork1_#t~post6#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1)) (= ~x1~0 0) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= 1 |thread2Thread1of1ForFork1_#t~post6#1|)), Black: 3889#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (= ~x1~0 0) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (exists ((v_~x2~0_22 Int)) (and (<= 0 v_~x2~0_22) (= ~x2~0 (select (select |#memory_int| ~f~0.base) (+ ~f~0.offset (* v_~x2~0_22 4)))) (or (and (or (and (< v_~x2~0_22 1) (< v_~x2~0_22 ~x2~0)) (and (< v_~x2~0_22 1) (not (<= 0 ~x2~0)))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (and (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (< v_~x2~0_22 1)))))), Black: 7228#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 2295#(and (= ~x1~0 0) (= ~x2~0 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: 3922#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (<= 2 |thread2Thread1of1ForFork1_#t~post8#1|) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (<= (+ |thread2Thread1of1ForFork1_#t~post8#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0))), Black: 7449#(and (not (<= (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (div (+ 4294967294 ~n~0) 4294967296))) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 3 ~n~0)) (= ~x1~0 0)), Black: 3695#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (or (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 ~size~0)) (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (< ~x2~0 ~size~0)))) (<= 0 ~x2~0) (< ~x2~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~size~0 (+ ~x1~0 1))), Black: 3717#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (or (and (or (not (<= 0 ~x2~0)) (not (< ~x2~0 ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (and (< ~x2~0 ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1))) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (or (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 ~size~0)) (and (or (not (<= 0 ~x2~0)) (not (< ~x2~0 ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296))) (<= ~size~0 (+ ~x1~0 1))), Black: 7282#(and (= ~x1~0 0) (or (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (and (not (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))) (or (and (or (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~x2~0)) (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (not (<= 0 ~x2~0)))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 1))) (<= ~size~0 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 7431#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 3159#(and (= ~x1~0 0) (exists ((v_~x2~0_22 Int)) (and (<= 0 v_~x2~0_22) (or (and (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 1) (< v_~x2~0_22 1)) (and (or (and (< v_~x2~0_22 1) (< v_~x2~0_22 ~x2~0)) (and (< v_~x2~0_22 1) (not (<= 0 ~x2~0)))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))) (= ~x2~0 (select (select |#memory_int| ~f~0.base) (+ ~f~0.offset (* v_~x2~0_22 4))))))), Black: 6690#(or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)), Black: 3878#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (exists ((v_~x2~0_22 Int)) (and (<= 0 v_~x2~0_22) (or (and (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 1) (< v_~x2~0_22 1)) (and (or (and (< v_~x2~0_22 1) (< v_~x2~0_22 ~x2~0)) (and (< v_~x2~0_22 1) (not (<= 0 ~x2~0)))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))) (= ~x2~0 (select (select |#memory_int| ~f~0.base) (+ ~f~0.offset (* v_~x2~0_22 4))))))), Black: 7446#(and (not (<= (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (div (+ 4294967294 ~n~0) 4294967296))) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 3 ~n~0)) (= ~x2~0 ~x1~0)), Black: 2808#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 3667#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 6194#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296))), Black: 7220#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (= ~x1~0 0) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1))), Black: 7272#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (= ~x1~0 0) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1)) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 7205#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (= ~x1~0 0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (forall ((~x2~0 Int)) (or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (<= ~size~0 ~x2~0) (< ~x2~0 0)))) (<= ~size~0 1) (= ~x2~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1)) (or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))), Black: 3704#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (or (and (or (not (<= 0 ~x2~0)) (not (< ~x2~0 ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (and (< ~x2~0 ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1))) (or (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 ~size~0)) (and (or (not (<= 0 ~x2~0)) (not (< ~x2~0 ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~size~0 (+ ~x1~0 1))), Black: 3880#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (= ~x1~0 0) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (exists ((v_~x2~0_22 Int)) (and (<= 0 v_~x2~0_22) (or (and (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 1) (< v_~x2~0_22 1)) (and (or (and (< v_~x2~0_22 1) (< v_~x2~0_22 ~x2~0)) (and (< v_~x2~0_22 1) (not (<= 0 ~x2~0)))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))) (= ~x2~0 (select (select |#memory_int| ~f~0.base) (+ ~f~0.offset (* v_~x2~0_22 4))))))), Black: 7433#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (<= 2 |thread2Thread1of1ForFork1_#t~post8#1|) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (= ~x2~0 ~x1~0) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (<= (+ |thread2Thread1of1ForFork1_#t~post8#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0))), Black: 7242#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 3887#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (exists ((v_~x2~0_22 Int)) (and (<= 0 v_~x2~0_22) (= ~x2~0 (select (select |#memory_int| ~f~0.base) (+ ~f~0.offset (* v_~x2~0_22 4)))) (or (and (or (and (< v_~x2~0_22 1) (< v_~x2~0_22 ~x2~0)) (and (< v_~x2~0_22 1) (not (<= 0 ~x2~0)))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (and (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (< v_~x2~0_22 1)))))), Black: 3851#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread2Thread1of1ForFork1_#t~post4#1| 0) (or (<= (+ 3 (* (div ~n~0 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0)) (<= (+ (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (div (+ 4294967294 ~n~0) 4294967296)) (div ~n~0 4294967296))) (<= |thread2Thread1of1ForFork1_~i~1#1| 1) (or (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ 3 (* (div ~n~0 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0)))), Black: 7438#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), 127#L64-2true, Black: 3910#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1)), Black: 7083#(and (= (select (select |#memory_int| ~f~0.base) ~f~0.offset) |thread2Thread1of1ForFork1_#t~mem3#1|) (= ~x1~0 0) (<= ~size~0 1) (= ~x2~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 6557#(and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 3177#(and (< |thread2Thread1of1ForFork1_#t~mem7#1| 1) (<= 0 |thread2Thread1of1ForFork1_#t~mem7#1|) (= ~x1~0 0)), Black: 3845#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (and (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (div (+ 4294967294 ~n~0) 4294967296)) (div ~n~0 4294967296))) (<= (+ 3 (* (div ~n~0 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0))) (= ~x1~0 0) (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= ~size~0 1) (< ~x2~0 ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= |thread2Thread1of1ForFork1_~i~1#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (exists ((~x2~0 Int)) (and (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) |thread2Thread1of1ForFork1_#t~mem5#1|) (<= 0 ~x2~0) (< ~x2~0 ~size~0)))), Black: 7313#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (= ~x1~0 0) (or (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (and (not (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~size~0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))) (or (and (or (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) ~x2~0)) (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (not (<= 0 ~x2~0)))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (and (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 1))) (<= ~size~0 1) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 7460#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (< (select (select |#memory_int| ~f~0.base) ~f~0.offset) 1) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 (select (select |#memory_int| ~f~0.base) ~f~0.offset))), Black: 3693#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (or (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 ~size~0)) (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (< ~x2~0 ~size~0)))) (<= 0 ~x2~0) (< ~x2~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~size~0 (+ ~x1~0 1))), Black: 3901#(and (< |thread2Thread1of1ForFork1_#t~mem7#1| 1) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 0 |thread2Thread1of1ForFork1_#t~mem7#1|) (= ~x1~0 0)), Black: 7340#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (<= (+ |thread2Thread1of1ForFork1_#t~post6#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1)) (= ~x1~0 0) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= 1 |thread2Thread1of1ForFork1_#t~post6#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1)) (forall ((~x2~0 Int)) (or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (<= ~size~0 ~x2~0) (< ~x2~0 0)))), Black: 7285#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (* (div ~n~0 4294967296) 4294967296)) (<= (+ |thread2Thread1of1ForFork1_#t~post6#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1)) (= ~x1~0 0) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= 1 |thread2Thread1of1ForFork1_#t~post6#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1))), Black: 3746#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= ~size~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3916#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 3 ~n~0)) (= ~x1~0 0) (<= 0 ~x2~0) (<= 2 |thread2Thread1of1ForFork1_#t~post8#1|) (< ~x2~0 1) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (<= (+ |thread2Thread1of1ForFork1_#t~post8#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (<= (div (+ 4294967294 ~n~0) 4294967296) (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296)))), Black: 3754#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296)))), 8384#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (mod ~n~0 4294967296))), Black: 3327#(or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (<= ~size~0 ~x2~0) (< ~x2~0 0)), Black: 3780#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= ~size~0 1) (<= |thread2Thread1of1ForFork1_~i~1#1| 1) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296)))), Black: 3818#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (or (and (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 ~size~0)) (and (or (not (<= 0 ~x2~0)) (not (< ~x2~0 ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))) (<= ~size~0 1) (or (and (or (not (<= 0 ~x2~0)) (not (< ~x2~0 ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (and (<= 0 ~x2~0) (< ~x2~0 ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1))) (<= |thread2Thread1of1ForFork1_~i~1#1| 1) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296)))), Black: 3689#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296))) (<= ~size~0 (+ ~x1~0 1))), Black: 3673#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (<= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3715#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (or (and (or (not (<= 0 ~x2~0)) (not (< ~x2~0 ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (and (< ~x2~0 ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1))) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (or (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 ~size~0)) (and (or (not (<= 0 ~x2~0)) (not (< ~x2~0 ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~size~0 (+ ~x1~0 1))), Black: 3181#(and (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1)), 152#L51-2true, Black: 3681#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~size~0 (+ ~x1~0 1))), Black: 3829#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (= |thread2Thread1of1ForFork1_#t~post4#1| 0) (or (<= (+ 3 (* (div ~n~0 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0)) (<= (+ (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (div (+ 4294967294 ~n~0) 4294967296)) (div ~n~0 4294967296))) (<= |thread2Thread1of1ForFork1_~i~1#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ 3 (* (div ~n~0 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0)))), Black: 3899#(and (< |thread2Thread1of1ForFork1_#t~mem7#1| 1) (<= 0 |thread2Thread1of1ForFork1_#t~mem7#1|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1)), Black: 2812#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= |thread2Thread1of1ForFork1_#t~post6#1| 1) (or (and (<= 1 |thread2Thread1of1ForFork1_#t~post6#1|) (<= (+ (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (div (+ 4294967294 ~n~0) 4294967296)) (div ~n~0 4294967296))) (<= (+ 3 (* (div ~n~0 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0)))), 6188#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 3891#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (exists ((v_~x2~0_22 Int)) (and (<= 0 v_~x2~0_22) (= ~x2~0 (select (select |#memory_int| ~f~0.base) (+ ~f~0.offset (* v_~x2~0_22 4)))) (< v_~x2~0_22 1)))), Black: 3907#(and (< |thread2Thread1of1ForFork1_#t~mem7#1| 1) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (<= 0 |thread2Thread1of1ForFork1_#t~mem7#1|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296))), Black: 3119#(and (= ~x1~0 0) (<= ~size~0 1) (exists ((v_~x2~0_22 Int)) (and (<= 0 v_~x2~0_22) (< v_~x2~0_22 ~size~0) (= ~x2~0 (select (select |#memory_int| ~f~0.base) (+ ~f~0.offset (* v_~x2~0_22 4))))))), Black: 2814#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296))), Black: 3838#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (= |thread2Thread1of1ForFork1_#t~post4#1| 0) (<= |thread2Thread1of1ForFork1_~i~1#1| 1) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296)))), Black: 3706#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296)) (+ ~n~0 (* (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 4294967296) 4294967293)) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (or (and (or (not (<= 0 ~x2~0)) (not (< ~x2~0 ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (and (< ~x2~0 ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1))) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (or (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 ~size~0)) (and (or (not (<= 0 ~x2~0)) (not (< ~x2~0 ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~size~0 (+ ~x1~0 1))), Black: 2809#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296)) (+ ~n~0 (* (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 4294967296) 4294967293)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 3895#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (exists ((v_~x2~0_22 Int)) (and (<= 0 v_~x2~0_22) (= ~x2~0 (select (select |#memory_int| ~f~0.base) (+ ~f~0.offset (* v_~x2~0_22 4)))) (< v_~x2~0_22 1))) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296))), Black: 3729#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3166#(and (= ~x1~0 0) (exists ((v_~x2~0_22 Int)) (and (<= 0 v_~x2~0_22) (= ~x2~0 (select (select |#memory_int| ~f~0.base) (+ ~f~0.offset (* v_~x2~0_22 4)))) (or (and (or (and (< v_~x2~0_22 1) (< v_~x2~0_22 ~x2~0)) (and (< v_~x2~0_22 1) (not (<= 0 ~x2~0)))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (and (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (< v_~x2~0_22 1)))))), Black: 3912#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296))), Black: 3918#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 3 ~n~0)) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (<= (div (+ 4294967294 ~n~0) 4294967296) (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296)))), Black: 3808#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (and (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (div (+ 4294967294 ~n~0) 4294967296)) (div ~n~0 4294967296))) (<= (+ 3 (* (div ~n~0 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0))) (= ~x1~0 0) (or (and (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 ~size~0)) (and (or (not (<= 0 ~x2~0)) (not (< ~x2~0 ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))) (<= ~size~0 1) (or (and (or (not (<= 0 ~x2~0)) (not (< ~x2~0 ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (and (<= 0 ~x2~0) (< ~x2~0 ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1))) (<= |thread2Thread1of1ForFork1_~i~1#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3669#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3762#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (= |thread2Thread1of1ForFork1_#t~post4#1| 0) (or (<= (+ 3 (* (div ~n~0 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0)) (<= (+ (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (div (+ 4294967294 ~n~0) 4294967296)) (div ~n~0 4294967296))) (<= ~size~0 1) (<= |thread2Thread1of1ForFork1_~i~1#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ 3 (* (div ~n~0 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0)))), Black: 3700#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (or (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 ~size~0)) (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (< ~x2~0 ~size~0)))) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~size~0 (+ ~x1~0 1))), 1146#true, Black: 3857#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= ~size~0 1) (exists ((v_~x2~0_22 Int)) (and (<= 0 v_~x2~0_22) (< v_~x2~0_22 ~size~0) (= ~x2~0 (select (select |#memory_int| ~f~0.base) (+ ~f~0.offset (* v_~x2~0_22 4))))))), Black: 3840#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (and (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (div (+ 4294967294 ~n~0) 4294967296)) (div ~n~0 4294967296))) (<= (+ 3 (* (div ~n~0 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0))) (= ~x1~0 0) (<= |thread2Thread1of1ForFork1_~i~1#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3810#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (or (and (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 ~size~0)) (and (or (not (<= 0 ~x2~0)) (not (< ~x2~0 ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))) (<= ~size~0 1) (or (and (or (not (<= 0 ~x2~0)) (not (< ~x2~0 ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (and (<= 0 ~x2~0) (< ~x2~0 ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1))) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3802#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (or (and (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 ~size~0)) (and (or (not (<= 0 ~x2~0)) (not (< ~x2~0 ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))) (<= ~size~0 1) (or (and (or (not (<= 0 ~x2~0)) (not (< ~x2~0 ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (and (<= 0 ~x2~0) (< ~x2~0 ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1))) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3861#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= |thread2Thread1of1ForFork1_#t~post6#1| 1) (<= ~size~0 1) (or (and (<= 1 |thread2Thread1of1ForFork1_#t~post6#1|) (<= (+ (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (div (+ 4294967294 ~n~0) 4294967296)) (div ~n~0 4294967296))) (<= (+ 3 (* (div ~n~0 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0))) (exists ((v_~x2~0_22 Int)) (and (<= 0 v_~x2~0_22) (< v_~x2~0_22 ~size~0) (= ~x2~0 (select (select |#memory_int| ~f~0.base) (+ ~f~0.offset (* v_~x2~0_22 4))))))), Black: 3800#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (or (and (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 ~size~0)) (and (or (not (<= 0 ~x2~0)) (not (< ~x2~0 ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))) (<= ~size~0 1) (<= |thread2Thread1of1ForFork1_~i~1#1| 1) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296)))), Black: 3170#(and (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (exists ((v_~x2~0_22 Int)) (and (<= 0 v_~x2~0_22) (= ~x2~0 (select (select |#memory_int| ~f~0.base) (+ ~f~0.offset (* v_~x2~0_22 4)))) (< v_~x2~0_22 1)))), Black: 3768#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (= |thread2Thread1of1ForFork1_#t~post4#1| 0) (<= ~size~0 1) (<= |thread2Thread1of1ForFork1_~i~1#1| 1) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296)))), Black: 3725#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= ~size~0 1) (< ~x2~0 ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3697#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296)) (+ ~n~0 (* (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 4294967296) 4294967293)) (= ~x1~0 0) (or (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 ~size~0)) (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (< ~x2~0 ~size~0)))) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~size~0 (+ ~x1~0 1))), Black: 3816#(and (or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (or (and (or (<= ~x1~0 0) (<= ~size~0 0)) (or (<= ~size~0 (+ ~x2~0 1)) (<= ~size~0 0)) (or (<= ~x2~0 0) (<= ~size~0 0)) (or (<= ~size~0 0) (<= ~size~0 (+ ~x1~0 1)))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))), Black: 3748#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296)) (+ ~n~0 (* (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 4294967296) 4294967293)) (= ~x1~0 0) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3932#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 3 ~n~0)) (= ~x1~0 0) (<= (div (+ 4294967294 ~n~0) 4294967296) (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296)))), Black: 3770#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (and (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (div (+ 4294967294 ~n~0) 4294967296)) (div ~n~0 4294967296))) (<= (+ 3 (* (div ~n~0 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0))) (= ~x1~0 0) (<= ~size~0 1) (<= |thread2Thread1of1ForFork1_~i~1#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3903#(and (< |thread2Thread1of1ForFork1_#t~mem7#1| 1) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (<= 0 |thread2Thread1of1ForFork1_#t~mem7#1|) (= ~x1~0 0) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296))), Black: 3905#(and (< |thread2Thread1of1ForFork1_#t~mem7#1| 1) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 0 |thread2Thread1of1ForFork1_#t~mem7#1|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1)), Black: 3691#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div (+ 4294967294 ~n~0) 4294967296) 4294967296)) (+ ~n~0 (* (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 4294967296) 4294967293)) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~size~0 (+ ~x1~0 1))), Black: 3926#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 3 ~n~0)) (<= 2 |thread2Thread1of1ForFork1_#t~post8#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (<= (+ |thread2Thread1of1ForFork1_#t~post8#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (<= (div (+ 4294967294 ~n~0) 4294967296) (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296)))), Black: 3914#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (= ~x1~0 0) (<= 0 ~x2~0) (<= 2 |thread2Thread1of1ForFork1_#t~post8#1|) (< ~x2~0 1) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (<= (+ |thread2Thread1of1ForFork1_#t~post8#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0))), Black: 3820#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (and (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (div (+ 4294967294 ~n~0) 4294967296)) (div ~n~0 4294967296))) (<= (+ 3 (* (div ~n~0 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0))) (= ~x1~0 0) (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= ~size~0 1) (< ~x2~0 ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= |thread2Thread1of1ForFork1_~i~1#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3792#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (or (and (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 ~size~0)) (and (or (not (<= 0 ~x2~0)) (not (< ~x2~0 ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))) (<= ~size~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3871#(and (<= (+ |thread2Thread1of1ForFork1_~i~1#1| (* (div ~n~0 4294967296) 4294967296)) (+ 2 ~n~0)) (= ~x1~0 0) (<= 2 |thread2Thread1of1ForFork1_~i~1#1|) (<= ~size~0 1) (exists ((v_~x2~0_22 Int)) (and (<= 0 v_~x2~0_22) (< v_~x2~0_22 ~size~0) (= ~x2~0 (select (select |#memory_int| ~f~0.base) (+ ~f~0.offset (* v_~x2~0_22 4)))))) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296))), Black: 3687#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~size~0 (+ ~x1~0 1))), Black: 3865#(and (<= (+ |thread2Thread1of1ForFork1_#t~post6#1| (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 1)) (= ~x1~0 0) (<= ~size~0 1) (exists ((v_~x2~0_22 Int)) (and (<= 0 v_~x2~0_22) (< v_~x2~0_22 ~size~0) (= ~x2~0 (select (select |#memory_int| ~f~0.base) (+ ~f~0.offset (* v_~x2~0_22 4)))))) (<= (div (+ 4294967294 ~n~0) 4294967296) (div ~n~0 4294967296)) (<= 1 |thread2Thread1of1ForFork1_#t~post6#1|)), Black: 2811#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (or (and (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (div (+ 4294967294 ~n~0) 4294967296)) (div ~n~0 4294967296))) (<= (+ 3 (* (div ~n~0 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0))) (<= |thread2Thread1of1ForFork1_~i~1#1| 1)), Black: 3804#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296)))), Black: 3831#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= ~size~0 1) (< ~x2~0 ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= |thread2Thread1of1ForFork1_~i~1#1| 1) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296)))), Black: 3855#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (or (and (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (div (+ 4294967294 ~n~0) 4294967296)) (div ~n~0 4294967296))) (<= (+ 3 (* (div ~n~0 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0))) (= ~x1~0 0) (<= ~size~0 1) (<= |thread2Thread1of1ForFork1_~i~1#1| 1) (exists ((v_~x2~0_22 Int)) (and (<= 0 v_~x2~0_22) (< v_~x2~0_22 ~size~0) (= ~x2~0 (select (select |#memory_int| ~f~0.base) (+ ~f~0.offset (* v_~x2~0_22 4))))))), Black: 3782#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (or (and (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 ~size~0)) (and (or (not (<= 0 ~x2~0)) (not (< ~x2~0 ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))) (<= ~size~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3677#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~size~0 (+ ~x1~0 1))), Black: 3750#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= ~size~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3788#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (and (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (div (+ 4294967294 ~n~0) 4294967296)) (div ~n~0 4294967296))) (<= (+ 3 (* (div ~n~0 4294967296) 4294967296)) (+ (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296) ~n~0))) (= ~x1~0 0) (or (and (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 ~size~0)) (and (or (not (<= 0 ~x2~0)) (not (< ~x2~0 ~size~0))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))) (<= ~size~0 1) (<= |thread2Thread1of1ForFork1_~i~1#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3702#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (or (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (< ~x2~0 ~size~0)) (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (not (< ~x2~0 ~size~0)))) (<= 0 ~x2~0) (< ~x2~0 1) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (div (+ 4294967294 ~n~0) 4294967296) (+ (div ~n~0 4294967296) (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296))) (<= ~size~0 (+ ~x1~0 1))), Black: 3712#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (<= ~size~0 1) (< ~x2~0 ~size~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3675#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~x1~0 0) (<= 0 ~x2~0) (< ~x2~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 213#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 1509#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 ~x2~0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1511#(and (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= 0 ~x2~0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0))]) [2022-01-19 09:29:57,118 INFO L384 tUnfolder$Statistics]: this new event has 146 ancestors and is cut-off event [2022-01-19 09:29:57,118 INFO L387 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-01-19 09:29:57,119 INFO L387 tUnfolder$Statistics]: existing Event has 109 ancestors and is cut-off event [2022-01-19 09:29:57,119 INFO L387 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-01-19 09:30:02,478 INFO L129 PetriNetUnfolder]: 10118/46247 cut-off events. [2022-01-19 09:30:02,478 INFO L130 PetriNetUnfolder]: For 2162749/2185545 co-relation queries the response was YES. [2022-01-19 09:30:06,675 INFO L84 FinitePrefix]: Finished finitePrefix Result has 340708 conditions, 46247 events. 10118/46247 cut-off events. For 2162749/2185545 co-relation queries the response was YES. Maximal size of possible extension queue 1277. Compared 667983 event pairs, 2147 based on Foata normal form. 946/45202 useless extension candidates. Maximal degree in co-relation 340373. Up to 7042 conditions per place. [2022-01-19 09:30:06,890 INFO L132 encePairwiseOnDemand]: 192/209 looper letters, 684 selfloop transitions, 657 changer transitions 0/2827 dead transitions. [2022-01-19 09:30:06,890 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1063 places, 2827 transitions, 45204 flow [2022-01-19 09:30:06,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-01-19 09:30:06,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2022-01-19 09:30:06,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 7521 transitions. [2022-01-19 09:30:06,896 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8178555893866899 [2022-01-19 09:30:06,896 INFO L72 ComplementDD]: Start complementDD. Operand 44 states and 7521 transitions. [2022-01-19 09:30:06,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 7521 transitions. [2022-01-19 09:30:06,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 09:30:06,898 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 44 states and 7521 transitions. [2022-01-19 09:30:06,906 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 45 states, 44 states have (on average 170.9318181818182) internal successors, (7521), 44 states have internal predecessors, (7521), 0 states have call successors, (0), 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-01-19 09:30:06,913 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 45 states, 45 states have (on average 209.0) internal successors, (9405), 45 states have internal predecessors, (9405), 0 states have call successors, (0), 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-01-19 09:30:06,914 INFO L81 ComplementDD]: Finished complementDD. Result has 45 states, 45 states have (on average 209.0) internal successors, (9405), 45 states have internal predecessors, (9405), 0 states have call successors, (0), 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-01-19 09:30:06,915 INFO L186 Difference]: Start difference. First operand has 1031 places, 2312 transitions, 33729 flow. Second operand 44 states and 7521 transitions. [2022-01-19 09:30:06,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1063 places, 2827 transitions, 45204 flow [2022-01-19 09:30:30,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1031 places, 2827 transitions, 43338 flow, removed 870 selfloop flow, removed 32 redundant places. [2022-01-19 09:30:30,414 INFO L242 Difference]: Finished difference. Result has 1052 places, 2623 transitions, 39767 flow [2022-01-19 09:30:30,416 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=31887, PETRI_DIFFERENCE_MINUEND_PLACES=988, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=374, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1912, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=39767, PETRI_PLACES=1052, PETRI_TRANSITIONS=2623} [2022-01-19 09:30:30,417 INFO L334 CegarLoopForPetriNet]: 187 programPoint places, 865 predicate places. [2022-01-19 09:30:30,417 INFO L470 AbstractCegarLoop]: Abstraction has has 1052 places, 2623 transitions, 39767 flow [2022-01-19 09:30:30,417 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 167.55555555555554) internal successors, (3016), 18 states have internal predecessors, (3016), 0 states have call successors, (0), 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-01-19 09:30:30,417 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 09:30:30,418 INFO L254 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] [2022-01-19 09:30:30,442 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-01-19 09:30:30,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 09:30:30,631 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 09:30:30,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 09:30:30,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1222766085, now seen corresponding path program 3 times [2022-01-19 09:30:30,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 09:30:30,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339274963] [2022-01-19 09:30:30,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:30:30,632 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 09:30:30,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:30:30,767 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 09:30:30,768 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 09:30:30,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339274963] [2022-01-19 09:30:30,768 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339274963] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 09:30:30,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703994830] [2022-01-19 09:30:30,768 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-19 09:30:30,768 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 09:30:30,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 09:30:30,769 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-01-19 09:30:30,772 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-01-19 09:30:30,906 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-19 09:30:30,906 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 09:30:30,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-19 09:30:30,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 09:30:31,204 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 09:30:31,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 09:30:31,491 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 09:30:31,491 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703994830] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 09:30:31,492 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 09:30:31,492 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-01-19 09:30:31,492 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595336209] [2022-01-19 09:30:31,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 09:30:31,492 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-19 09:30:31,492 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 09:30:31,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-19 09:30:31,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2022-01-19 09:30:31,494 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 209 [2022-01-19 09:30:31,496 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1052 places, 2623 transitions, 39767 flow. Second operand has 19 states, 19 states have (on average 167.42105263157896) internal successors, (3181), 19 states have internal predecessors, (3181), 0 states have call successors, (0), 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-01-19 09:30:31,496 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 09:30:31,496 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 209 [2022-01-19 09:30:31,496 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand