/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 19:24:31,203 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 19:24:31,205 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 19:24:31,244 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 19:24:31,244 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 19:24:31,245 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 19:24:31,246 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 19:24:31,253 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 19:24:31,255 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 19:24:31,259 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 19:24:31,260 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 19:24:31,261 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 19:24:31,261 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 19:24:31,263 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 19:24:31,264 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 19:24:31,266 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 19:24:31,267 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 19:24:31,267 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 19:24:31,273 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 19:24:31,280 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 19:24:31,281 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 19:24:31,282 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 19:24:31,284 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 19:24:31,285 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 19:24:31,291 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 19:24:31,292 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 19:24:31,292 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 19:24:31,293 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 19:24:31,293 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 19:24:31,294 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 19:24:31,294 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 19:24:31,294 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 19:24:31,295 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 19:24:31,295 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 19:24:31,296 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 19:24:31,296 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 19:24:31,297 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 19:24:31,297 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 19:24:31,297 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 19:24:31,298 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 19:24:31,298 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 19:24:31,302 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2022-03-15 19:24:31,334 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 19:24:31,334 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 19:24:31,335 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 19:24:31,335 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 19:24:31,336 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 19:24:31,336 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 19:24:31,336 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 19:24:31,336 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 19:24:31,336 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 19:24:31,336 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 19:24:31,337 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 19:24:31,337 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 19:24:31,337 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 19:24:31,337 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 19:24:31,338 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 19:24:31,338 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 19:24:31,338 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 19:24:31,338 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 19:24:31,338 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 19:24:31,338 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 19:24:31,338 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 19:24:31,338 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 19:24:31,338 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 19:24:31,339 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 19:24:31,339 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 19:24:31,339 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 19:24:31,339 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 19:24:31,339 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 19:24:31,340 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 19:24:31,340 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 19:24:31,341 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 19:24:31,341 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 19:24:31,341 INFO L138 SettingsManager]: * Interpolant automaton=MCR 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-03-15 19:24:31,542 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 19:24:31,559 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 19:24:31,561 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 19:24:31,561 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 19:24:31,562 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 19:24:31,563 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c [2022-03-15 19:24:31,624 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e664ee98/49e35f04edce46709ba13d840e0c19f3/FLAG25f019fec [2022-03-15 19:24:32,011 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 19:24:32,012 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c [2022-03-15 19:24:32,019 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e664ee98/49e35f04edce46709ba13d840e0c19f3/FLAG25f019fec [2022-03-15 19:24:32,028 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e664ee98/49e35f04edce46709ba13d840e0c19f3 [2022-03-15 19:24:32,029 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 19:24:32,030 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 19:24:32,031 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 19:24:32,032 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 19:24:32,035 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 19:24:32,036 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 07:24:32" (1/1) ... [2022-03-15 19:24:32,036 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c898e4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:24:32, skipping insertion in model container [2022-03-15 19:24:32,037 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 07:24:32" (1/1) ... [2022-03-15 19:24:32,042 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 19:24:32,055 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 19:24:32,196 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/popl20-more-max-array-hom.wvr.c[2586,2599] [2022-03-15 19:24:32,203 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 19:24:32,208 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 19:24:32,225 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/popl20-more-max-array-hom.wvr.c[2586,2599] [2022-03-15 19:24:32,232 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 19:24:32,243 INFO L208 MainTranslator]: Completed translation [2022-03-15 19:24:32,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:24:32 WrapperNode [2022-03-15 19:24:32,243 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 19:24:32,244 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 19:24:32,244 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 19:24:32,244 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 19:24:32,249 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:24:32" (1/1) ... [2022-03-15 19:24:32,259 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:24:32" (1/1) ... [2022-03-15 19:24:32,280 INFO L137 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 106 [2022-03-15 19:24:32,280 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 19:24:32,281 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 19:24:32,281 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 19:24:32,281 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 19:24:32,288 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:24:32" (1/1) ... [2022-03-15 19:24:32,288 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:24:32" (1/1) ... [2022-03-15 19:24:32,291 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:24:32" (1/1) ... [2022-03-15 19:24:32,291 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:24:32" (1/1) ... [2022-03-15 19:24:32,296 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:24:32" (1/1) ... [2022-03-15 19:24:32,299 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:24:32" (1/1) ... [2022-03-15 19:24:32,301 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:24:32" (1/1) ... [2022-03-15 19:24:32,303 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 19:24:32,304 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 19:24:32,304 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 19:24:32,304 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 19:24:32,305 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:24:32" (1/1) ... [2022-03-15 19:24:32,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 19:24:32,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:24:32,336 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-03-15 19:24:32,365 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-03-15 19:24:32,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 19:24:32,388 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 19:24:32,388 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 19:24:32,388 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 19:24:32,389 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 19:24:32,389 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 19:24:32,389 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 19:24:32,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 19:24:32,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 19:24:32,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 19:24:32,390 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-15 19:24:32,390 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-15 19:24:32,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-15 19:24:32,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 19:24:32,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 19:24:32,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 19:24:32,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 19:24:32,392 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 19:24:32,506 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 19:24:32,507 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 19:24:32,738 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 19:24:32,791 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 19:24:32,791 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-03-15 19:24:32,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 07:24:32 BoogieIcfgContainer [2022-03-15 19:24:32,793 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 19:24:32,795 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 19:24:32,795 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 19:24:32,798 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 19:24:32,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 07:24:32" (1/3) ... [2022-03-15 19:24:32,798 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4267edd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 07:24:32, skipping insertion in model container [2022-03-15 19:24:32,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:24:32" (2/3) ... [2022-03-15 19:24:32,799 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4267edd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 07:24:32, skipping insertion in model container [2022-03-15 19:24:32,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 07:24:32" (3/3) ... [2022-03-15 19:24:32,800 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-more-max-array-hom.wvr.c [2022-03-15 19:24:32,804 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 19:24:32,804 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 19:24:32,805 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 19:24:32,805 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 19:24:32,839 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,840 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,840 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,840 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,841 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,841 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,841 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,841 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,841 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,841 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,842 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,842 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,842 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,842 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,843 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,843 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,843 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,843 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,843 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,844 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,844 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,844 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,844 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,844 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,844 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,845 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,845 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,845 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,845 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,846 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,846 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,846 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,846 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,847 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,847 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,847 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,847 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,847 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,848 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,848 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,848 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,848 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,848 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,849 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,849 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,849 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,849 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,850 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,850 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,850 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,850 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,850 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,850 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,850 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,851 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,851 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,851 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,851 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,852 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,852 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,852 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,852 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,853 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,853 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,853 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,853 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,854 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,854 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,854 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,854 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,854 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,855 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,855 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,855 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,855 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,855 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,856 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,856 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,856 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,856 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,856 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,856 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,857 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,857 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,860 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,860 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,860 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,860 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,860 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,860 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,861 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,861 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,862 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,862 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,862 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,862 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,863 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,863 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,863 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,863 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,863 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,863 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:32,867 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-03-15 19:24:32,904 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 19:24:32,911 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=MCR, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, 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=true, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 19:24:32,911 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-03-15 19:24:32,924 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 19:24:32,931 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 159 transitions, 342 flow [2022-03-15 19:24:32,934 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 156 places, 159 transitions, 342 flow [2022-03-15 19:24:32,936 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 156 places, 159 transitions, 342 flow [2022-03-15 19:24:32,993 INFO L129 PetriNetUnfolder]: 13/156 cut-off events. [2022-03-15 19:24:32,994 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-03-15 19:24:32,998 INFO L84 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 156 events. 13/156 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 96 event pairs, 0 based on Foata normal form. 0/142 useless extension candidates. Maximal degree in co-relation 113. Up to 2 conditions per place. [2022-03-15 19:24:33,001 INFO L116 LiptonReduction]: Number of co-enabled transitions 1320 [2022-03-15 19:24:38,375 INFO L131 LiptonReduction]: Checked pairs total: 1603 [2022-03-15 19:24:38,375 INFO L133 LiptonReduction]: Total number of compositions: 157 [2022-03-15 19:24:38,382 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 28 transitions, 80 flow [2022-03-15 19:24:38,406 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 107 states, 106 states have (on average 3.0849056603773586) internal successors, (327), 106 states have internal predecessors, (327), 0 states have call successors, (0), 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-03-15 19:24:38,408 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 106 states have (on average 3.0849056603773586) internal successors, (327), 106 states have internal predecessors, (327), 0 states have call successors, (0), 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-03-15 19:24:38,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 19:24:38,415 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:24:38,416 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:24:38,416 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:24:38,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:24:38,420 INFO L85 PathProgramCache]: Analyzing trace with hash -462507299, now seen corresponding path program 1 times [2022-03-15 19:24:38,436 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:24:38,437 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306809050] [2022-03-15 19:24:38,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:24:38,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:24:38,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:24:38,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:24:38,753 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:24:38,753 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306809050] [2022-03-15 19:24:38,754 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306809050] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:24:38,754 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:24:38,754 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 19:24:38,755 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1475169466] [2022-03-15 19:24:38,756 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:24:38,763 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:24:38,802 INFO L252 McrAutomatonBuilder]: Finished intersection with 107 states and 244 transitions. [2022-03-15 19:24:38,802 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:24:40,316 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:24:40,318 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 19:24:40,318 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:24:40,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 19:24:40,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 19:24:40,356 INFO L87 Difference]: Start difference. First operand has 107 states, 106 states have (on average 3.0849056603773586) internal successors, (327), 106 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 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-03-15 19:24:40,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:24:40,409 INFO L93 Difference]: Finished difference Result 204 states and 632 transitions. [2022-03-15 19:24:40,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 19:24:40,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 19:24:40,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:24:40,420 INFO L225 Difference]: With dead ends: 204 [2022-03-15 19:24:40,420 INFO L226 Difference]: Without dead ends: 197 [2022-03-15 19:24:40,421 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 19:24:40,424 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 1 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:24:40,425 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 6 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 19:24:40,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-03-15 19:24:40,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2022-03-15 19:24:40,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 196 states have (on average 3.13265306122449) internal successors, (614), 196 states have internal predecessors, (614), 0 states have call successors, (0), 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-03-15 19:24:40,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 614 transitions. [2022-03-15 19:24:40,487 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 614 transitions. Word has length 20 [2022-03-15 19:24:40,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:24:40,488 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 614 transitions. [2022-03-15 19:24:40,488 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 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-03-15 19:24:40,488 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 614 transitions. [2022-03-15 19:24:40,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:24:40,497 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:24:40,497 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:24:40,498 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 19:24:40,498 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:24:40,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:24:40,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1928502241, now seen corresponding path program 1 times [2022-03-15 19:24:40,503 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:24:40,507 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609961147] [2022-03-15 19:24:40,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:24:40,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:24:40,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:24:40,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:24:40,582 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:24:40,582 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609961147] [2022-03-15 19:24:40,582 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609961147] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:24:40,582 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:24:40,582 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 19:24:40,583 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [776902985] [2022-03-15 19:24:40,583 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:24:40,587 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:24:40,605 INFO L252 McrAutomatonBuilder]: Finished intersection with 89 states and 187 transitions. [2022-03-15 19:24:40,605 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:24:40,989 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [979#(< thread1Thread1of1ForFork2_~i~0 ~N~0)] [2022-03-15 19:24:40,990 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 19:24:40,990 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:24:40,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 19:24:40,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-03-15 19:24:40,991 INFO L87 Difference]: Start difference. First operand 197 states and 614 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 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-03-15 19:24:41,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:24:41,071 INFO L93 Difference]: Finished difference Result 198 states and 615 transitions. [2022-03-15 19:24:41,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 19:24:41,071 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 19:24:41,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:24:41,073 INFO L225 Difference]: With dead ends: 198 [2022-03-15 19:24:41,073 INFO L226 Difference]: Without dead ends: 198 [2022-03-15 19:24:41,073 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 64 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-03-15 19:24:41,074 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:24:41,075 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 13 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:24:41,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-03-15 19:24:41,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2022-03-15 19:24:41,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 197 states have (on average 3.1218274111675126) internal successors, (615), 197 states have internal predecessors, (615), 0 states have call successors, (0), 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-03-15 19:24:41,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 615 transitions. [2022-03-15 19:24:41,086 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 615 transitions. Word has length 21 [2022-03-15 19:24:41,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:24:41,087 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 615 transitions. [2022-03-15 19:24:41,087 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 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-03-15 19:24:41,087 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 615 transitions. [2022-03-15 19:24:41,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:24:41,088 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:24:41,089 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:24:41,089 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 19:24:41,089 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:24:41,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:24:41,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1868546935, now seen corresponding path program 1 times [2022-03-15 19:24:41,090 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:24:41,091 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248400823] [2022-03-15 19:24:41,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:24:41,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:24:41,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:24:41,164 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:24:41,164 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:24:41,164 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248400823] [2022-03-15 19:24:41,164 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248400823] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:24:41,165 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633219144] [2022-03-15 19:24:41,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:24:41,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:24:41,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:24:41,171 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-03-15 19:24:41,178 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-03-15 19:24:41,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:24:41,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 19:24:41,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:24:41,423 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:24:41,423 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:24:41,484 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:24:41,484 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633219144] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 19:24:41,484 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 19:24:41,484 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2022-03-15 19:24:41,485 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1641940689] [2022-03-15 19:24:41,485 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:24:41,488 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:24:41,507 INFO L252 McrAutomatonBuilder]: Finished intersection with 90 states and 188 transitions. [2022-03-15 19:24:41,508 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:24:42,318 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [1713#(< thread2Thread1of1ForFork0_~i~1 ~M~0), 1715#(or (<= (+ ~M~0 1) ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)), 1716#(< 0 ~M~0), 1718#(or (< 0 ~M~0) (< ~M~0 ~N~0)), 1714#(or (< thread3Thread1of1ForFork1_~i~2 ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)), 1717#(or (< 0 ~M~0) (< thread3Thread1of1ForFork1_~i~2 ~N~0))] [2022-03-15 19:24:42,318 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 19:24:42,319 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:24:42,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 19:24:42,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2022-03-15 19:24:42,320 INFO L87 Difference]: Start difference. First operand 198 states and 615 transitions. Second operand has 13 states, 13 states have (on average 6.0) internal successors, (78), 12 states have internal predecessors, (78), 0 states have call successors, (0), 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-03-15 19:24:42,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:24:42,547 INFO L93 Difference]: Finished difference Result 202 states and 625 transitions. [2022-03-15 19:24:42,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 19:24:42,547 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.0) internal successors, (78), 12 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 19:24:42,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:24:42,549 INFO L225 Difference]: With dead ends: 202 [2022-03-15 19:24:42,549 INFO L226 Difference]: Without dead ends: 202 [2022-03-15 19:24:42,549 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 92 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2022-03-15 19:24:42,552 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 64 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:24:42,552 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 23 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:24:42,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-03-15 19:24:42,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 134. [2022-03-15 19:24:42,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 3.1052631578947367) internal successors, (413), 133 states have internal predecessors, (413), 0 states have call successors, (0), 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-03-15 19:24:42,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 413 transitions. [2022-03-15 19:24:42,562 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 413 transitions. Word has length 22 [2022-03-15 19:24:42,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:24:42,562 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 413 transitions. [2022-03-15 19:24:42,563 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.0) internal successors, (78), 12 states have internal predecessors, (78), 0 states have call successors, (0), 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-03-15 19:24:42,563 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 413 transitions. [2022-03-15 19:24:42,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:24:42,563 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:24:42,564 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:24:42,592 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-03-15 19:24:42,764 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:24:42,765 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:24:42,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:24:42,765 INFO L85 PathProgramCache]: Analyzing trace with hash -117629227, now seen corresponding path program 1 times [2022-03-15 19:24:42,766 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:24:42,767 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311773092] [2022-03-15 19:24:42,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:24:42,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:24:42,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:24:42,838 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:24:42,838 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:24:42,838 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311773092] [2022-03-15 19:24:42,838 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311773092] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:24:42,839 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063774868] [2022-03-15 19:24:42,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:24:42,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:24:42,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:24:42,843 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-03-15 19:24:42,844 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-03-15 19:24:42,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:24:42,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 19:24:42,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:24:42,980 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:24:42,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:24:43,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:24:43,037 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063774868] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 19:24:43,037 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 19:24:43,038 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2022-03-15 19:24:43,038 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2009564940] [2022-03-15 19:24:43,038 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:24:43,042 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:24:43,067 INFO L252 McrAutomatonBuilder]: Finished intersection with 134 states and 316 transitions. [2022-03-15 19:24:43,068 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:24:43,760 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:24:43,760 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 19:24:43,761 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:24:43,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 19:24:43,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-03-15 19:24:43,762 INFO L87 Difference]: Start difference. First operand 134 states and 413 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 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-03-15 19:24:43,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:24:43,842 INFO L93 Difference]: Finished difference Result 166 states and 519 transitions. [2022-03-15 19:24:43,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 19:24:43,842 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 19:24:43,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:24:43,843 INFO L225 Difference]: With dead ends: 166 [2022-03-15 19:24:43,844 INFO L226 Difference]: Without dead ends: 166 [2022-03-15 19:24:43,844 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 142 SyntacticMatches, 8 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-03-15 19:24:43,845 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 23 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:24:43,845 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 7 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:24:43,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-03-15 19:24:43,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2022-03-15 19:24:43,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 3.1454545454545455) internal successors, (519), 165 states have internal predecessors, (519), 0 states have call successors, (0), 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-03-15 19:24:43,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 519 transitions. [2022-03-15 19:24:43,853 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 519 transitions. Word has length 22 [2022-03-15 19:24:43,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:24:43,853 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 519 transitions. [2022-03-15 19:24:43,853 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 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-03-15 19:24:43,853 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 519 transitions. [2022-03-15 19:24:43,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:24:43,854 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:24:43,854 INFO L514 BasicCegarLoop]: 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] [2022-03-15 19:24:43,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-15 19:24:44,067 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,SelfDestructingSolverStorable3 [2022-03-15 19:24:44,068 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:24:44,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:24:44,068 INFO L85 PathProgramCache]: Analyzing trace with hash -809436699, now seen corresponding path program 1 times [2022-03-15 19:24:44,069 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:24:44,069 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532464791] [2022-03-15 19:24:44,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:24:44,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:24:44,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:24:44,574 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:24:44,575 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:24:44,575 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532464791] [2022-03-15 19:24:44,575 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532464791] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:24:44,575 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607110302] [2022-03-15 19:24:44,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:24:44,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:24:44,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:24:44,580 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-03-15 19:24:44,590 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-03-15 19:24:44,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:24:44,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 38 conjunts are in the unsatisfiable core [2022-03-15 19:24:44,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:24:45,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:24:45,028 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-03-15 19:24:45,179 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:24:45,182 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:24:45,182 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 66 treesize of output 39 [2022-03-15 19:24:45,295 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:24:45,295 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:24:45,637 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_173 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_173) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))))) (or (not (< c_~max3~0 .cse0)) (and (or (= c_~max1~0 .cse0) (<= .cse0 c_~max2~0)) (or (< c_~max2~0 .cse0) (= c_~max1~0 c_~max2~0)))))) (or (forall ((v_ArrVal_173 (Array Int Int))) (< c_~max3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_173) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))))) (and (or (= c_~max1~0 c_~max2~0) (< c_~max2~0 c_~max3~0)) (or (= c_~max1~0 c_~max3~0) (<= c_~max3~0 c_~max2~0))))) is different from false [2022-03-15 19:24:45,714 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:24:45,715 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 219 treesize of output 171 [2022-03-15 19:24:45,720 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 108 [2022-03-15 19:24:45,724 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 102 [2022-03-15 19:24:46,375 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-03-15 19:24:46,375 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1607110302] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:24:46,376 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:24:46,376 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 27 [2022-03-15 19:24:46,376 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [888698431] [2022-03-15 19:24:46,376 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:24:46,380 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:24:46,401 INFO L252 McrAutomatonBuilder]: Finished intersection with 110 states and 240 transitions. [2022-03-15 19:24:46,401 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:24:56,100 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 30 new interpolants: [2995#(and (or (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 0)) (or (= ~max3~0 ~max1~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (<= ~max3~0 0)) (or (< 0 ~max3~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 ~max1~0))), 3006#(and (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 0) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (not (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)))) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< 0 ~M~0)) (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (= ~max3~0 ~max1~0) (< 0 ~M~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= ~max3~0 0)) (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (< 0 ~M~0) (= ~max2~0 0)) (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (< 0 ~M~0) (< 0 ~max3~0) (= ~max2~0 ~max1~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)))) (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (not (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)))) (< 0 ~M~0) (< 0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (= ~max2~0 ~max1~0))), 3009#(and (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (< 0 ~M~0) (= ~max2~0 0)) (or (< 0 ~M~0) (= ~max3~0 0)) (or (< 0 ~M~0) (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (< 0 ~M~0) (= ~max2~0 ~max1~0)) (or (< 0 ~M~0) (<= 1 ~N~0))), 3021#(and (or (<= 1 ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (= ~max3~0 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= thread1Thread1of1ForFork2_~i~0 0)) (or (= ~A~0.offset 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= ~M~0 0)) (or (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max1~0 0)) (or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 ~max1~0))), 3019#(and (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (< 0 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 ~max1~0)) (or (< 0 ~M~0) (<= (select (select |#memory_int| ~A~0.base) 0) 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (or (= ~A~0.offset 0) (< 0 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (< 0 ~M~0) (<= 1 ~N~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (< 0 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 0)) (or (< 0 ~M~0) (= ~max3~0 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0))), 2998#(and (or (= ~max3~0 ~max1~0) (< thread3Thread1of1ForFork1_~i~2 ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= ~max3~0 0)) (or (< thread3Thread1of1ForFork1_~i~2 ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 0)) (or (< 0 ~max3~0) (< thread3Thread1of1ForFork1_~i~2 ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 ~max1~0))), 3008#(and (or (not (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (< 0 ~M~0) (< 0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0) (<= (+ 2 ~M~0) ~N~0) (not (< ~M~0 ~N~0))) (or (not (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (< 0 ~M~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 0) (<= (+ 2 ~M~0) ~N~0) (not (< ~M~0 ~N~0)) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (< 0 ~M~0) (= ~max2~0 0) (<= (+ 2 ~M~0) ~N~0) (not (< ~M~0 ~N~0))) (or (< 0 ~M~0) (< 0 ~max3~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0) (<= (+ 2 ~M~0) ~N~0) (not (< ~M~0 ~N~0))) (or (= ~max3~0 ~max1~0) (< 0 ~M~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (<= (+ 2 ~M~0) ~N~0) (not (< ~M~0 ~N~0)) (<= ~max3~0 0))), 3004#(and (or (<= 1 ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 ~max1~0)) (or (= ~max3~0 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 0)) (or (= ~A~0.offset 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (<= (select (select |#memory_int| ~A~0.base) 0) 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= (+ ~A~0.offset (* ~M~0 4)) 0))), 3010#(and (or (= ~max3~0 ~max1~0) (< thread3Thread1of1ForFork1_~i~2 ~N~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (<= ~max3~0 0)) (or (< 0 ~max3~0) (< thread3Thread1of1ForFork1_~i~2 ~N~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 ~max1~0)) (or (< thread3Thread1of1ForFork1_~i~2 ~N~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 0))), 3003#(and (or (= ~max3~0 ~max1~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= (+ 2 ~M~0) ~N~0) (not (< ~M~0 ~N~0)) (<= ~max3~0 0)) (or (< 0 ~max3~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 ~max1~0) (<= (+ 2 ~M~0) ~N~0) (not (< ~M~0 ~N~0))) (or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 0) (<= (+ 2 ~M~0) ~N~0) (not (< ~M~0 ~N~0))) (or (not (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (< 0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 ~max1~0) (<= (+ 2 ~M~0) ~N~0) (not (< ~M~0 ~N~0))) (or (not (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= (+ 2 ~M~0) ~N~0) (not (< ~M~0 ~N~0)) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0))), 3018#(and (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< 0 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (< 0 ~M~0) (<= 1 ~N~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0)) (or (< 0 ~M~0) (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (= ~A~0.offset 0) (< 0 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (< 0 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (< 0 ~M~0) (= ~max3~0 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< 0 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 ~max1~0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0)))), 3012#(and (or (< thread1Thread1of1ForFork2_~i~0 ~N~0) (<= ~M~0 0)) (or (= ~max3~0 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 0)) (or (= ~A~0.offset 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (<= (select (select |#memory_int| ~A~0.base) 0) 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 ~max1~0)) (or (<= 1 ~N~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0))), 3000#(and (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 0)) (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (< 0 ~max3~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 ~max1~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)))) (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 0) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (not (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)))) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (not (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)))) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< 0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (= ~max2~0 ~max1~0)) (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (= ~max3~0 ~max1~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= ~max3~0 0))), 2994#(and (or (< 0 ~M~0) (= ~max2~0 0)) (or (= ~max3~0 ~max1~0) (< 0 ~M~0) (<= ~max3~0 0)) (or (< 0 ~M~0) (< 0 ~max3~0) (= ~max2~0 ~max1~0))), 3005#(and (or (= ~max3~0 ~max1~0) (< 0 ~M~0) (< thread3Thread1of1ForFork1_~i~2 ~N~0) (<= ~max3~0 0)) (or (< 0 ~M~0) (< thread3Thread1of1ForFork1_~i~2 ~N~0) (= ~max2~0 0)) (or (< 0 ~M~0) (< 0 ~max3~0) (< thread3Thread1of1ForFork1_~i~2 ~N~0) (= ~max2~0 ~max1~0))), 3011#(and (or (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (= ~max3~0 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (<= 1 ~N~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0)) (or (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 ~max1~0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (= ~A~0.offset 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0)))), 3022#(and (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (< 0 ~M~0) (= ~max2~0 ~max1~0)) (or (< 0 ~M~0) (= ~max3~0 0)) (or (< 0 ~M~0) (= thread1Thread1of1ForFork2_~i~0 0)) (or (< 0 ~M~0) (<= 1 ~N~0)) (or (< 0 ~M~0) (= ~max1~0 0)) (or (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< 0 ~M~0))), 2993#(and (or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 0)) (or (< 0 ~max3~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 ~max1~0)) (or (= ~max3~0 ~max1~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= ~max3~0 0))), 3017#(and (or (= ~max3~0 ~max1~0) (< 0 ~M~0) (< thread3Thread1of1ForFork1_~i~2 ~N~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (<= ~max3~0 0)) (or (< 0 ~M~0) (< thread3Thread1of1ForFork1_~i~2 ~N~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 0)) (or (< 0 ~M~0) (< 0 ~max3~0) (< thread3Thread1of1ForFork1_~i~2 ~N~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 ~max1~0))), 2996#(and (or (= ~max3~0 ~max1~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (<= ~max3~0 0)) (or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 0)) (or (< 0 ~max3~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 ~max1~0))), 3015#(and (or (= ~A~0.offset 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (<= (+ ~A~0.offset (* ~M~0 4)) 0)) (or (= ~max3~0 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 0)) (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 ~max1~0)) (or (<= 1 ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (<= (select (select |#memory_int| ~A~0.base) 0) 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0)))), 3020#(and (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (< 0 ~M~0) (= ~max2~0 0)) (or (< 0 ~M~0) (= ~max3~0 0)) (or (< 0 ~M~0) (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (< 0 ~M~0) (= ~max2~0 ~max1~0)) (or (< 0 ~M~0) (<= 1 ~N~0)) (or (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< 0 ~M~0))), 3016#(and (or (<= 1 ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 ~max1~0)) (or (= ~max3~0 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 0)) (or (= ~A~0.offset 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= ~M~0 0)) (or (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (<= (select (select |#memory_int| ~A~0.base) 0) 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0)))), 2999#(and (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (= ~max3~0 ~max1~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= ~max3~0 0)) (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (< 0 ~max3~0) (= ~max2~0 ~max1~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)))) (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (= ~max2~0 0)) (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (not (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)))) (< 0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (= ~max2~0 ~max1~0)) (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 0) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (not (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)))) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))))), 3007#(and (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< 0 ~M~0) (= ~max2~0 ~max1~0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< 0 ~M~0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (< 0 ~M~0) (= ~max3~0 0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (< 0 ~M~0) (= ~max2~0 0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (< 0 ~M~0) (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0)) (or (< 0 ~M~0) (<= 1 ~N~0) (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))), 3013#(and (or (< 0 ~max3~0) (< thread3Thread1of1ForFork1_~i~2 ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 ~max1~0)) (or (= ~max3~0 ~max1~0) (< thread3Thread1of1ForFork1_~i~2 ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (<= ~max3~0 0)) (or (< thread3Thread1of1ForFork1_~i~2 ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 0))), 3001#(and (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (<= 1 ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0)) (or (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (= ~A~0.offset 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (= ~max3~0 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 ~max1~0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0)))), 3002#(and (or (not (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 0) (<= (+ 2 ~M~0) ~N~0) (not (< ~M~0 ~N~0)) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (= ~max2~0 0) (<= (+ 2 ~M~0) ~N~0) (not (< ~M~0 ~N~0))) (or (< 0 ~max3~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0) (<= (+ 2 ~M~0) ~N~0) (not (< ~M~0 ~N~0))) (or (not (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (< 0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0) (<= (+ 2 ~M~0) ~N~0) (not (< ~M~0 ~N~0))) (or (= ~max3~0 ~max1~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (<= (+ 2 ~M~0) ~N~0) (not (< ~M~0 ~N~0)) (<= ~max3~0 0))), 3014#(and (or (= ~A~0.offset 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (<= 1 ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0)) (or (= ~max3~0 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 ~max1~0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0)))), 2997#(and (or (< 0 ~M~0) (< 0 ~max3~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 ~max1~0)) (or (= ~max3~0 ~max1~0) (< 0 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (<= ~max3~0 0)) (or (< 0 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 0)))] [2022-03-15 19:24:56,101 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-03-15 19:24:56,101 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:24:56,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-03-15 19:24:56,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=2903, Unknown=1, NotChecked=112, Total=3422 [2022-03-15 19:24:56,103 INFO L87 Difference]: Start difference. First operand 166 states and 519 transitions. Second operand has 43 states, 42 states have (on average 3.4761904761904763) internal successors, (146), 42 states have internal predecessors, (146), 0 states have call successors, (0), 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-03-15 19:25:01,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:25:01,126 INFO L93 Difference]: Finished difference Result 755 states and 2404 transitions. [2022-03-15 19:25:01,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-03-15 19:25:01,126 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 3.4761904761904763) internal successors, (146), 42 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 19:25:01,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:25:01,130 INFO L225 Difference]: With dead ends: 755 [2022-03-15 19:25:01,130 INFO L226 Difference]: Without dead ends: 748 [2022-03-15 19:25:01,132 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 76 SyntacticMatches, 6 SemanticMatches, 91 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2712 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1120, Invalid=7255, Unknown=1, NotChecked=180, Total=8556 [2022-03-15 19:25:01,132 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 420 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 2774 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 2891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 2774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:25:01,133 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [420 Valid, 138 Invalid, 2891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 2774 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-03-15 19:25:01,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2022-03-15 19:25:01,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 262. [2022-03-15 19:25:01,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 261 states have (on average 3.203065134099617) internal successors, (836), 261 states have internal predecessors, (836), 0 states have call successors, (0), 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-03-15 19:25:01,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 836 transitions. [2022-03-15 19:25:01,147 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 836 transitions. Word has length 23 [2022-03-15 19:25:01,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:25:01,147 INFO L470 AbstractCegarLoop]: Abstraction has 262 states and 836 transitions. [2022-03-15 19:25:01,147 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 3.4761904761904763) internal successors, (146), 42 states have internal predecessors, (146), 0 states have call successors, (0), 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-03-15 19:25:01,148 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 836 transitions. [2022-03-15 19:25:01,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:25:01,149 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:25:01,149 INFO L514 BasicCegarLoop]: 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] [2022-03-15 19:25:01,169 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-03-15 19:25:01,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:25:01,364 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:25:01,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:25:01,364 INFO L85 PathProgramCache]: Analyzing trace with hash -861527519, now seen corresponding path program 2 times [2022-03-15 19:25:01,365 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:25:01,365 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466589411] [2022-03-15 19:25:01,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:25:01,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:25:01,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:25:01,756 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:25:01,756 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:25:01,756 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466589411] [2022-03-15 19:25:01,756 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466589411] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:25:01,756 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716682588] [2022-03-15 19:25:01,757 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:25:01,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:25:01,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:25:01,761 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-03-15 19:25:01,767 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-03-15 19:25:01,842 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:25:01,843 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:25:01,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 33 conjunts are in the unsatisfiable core [2022-03-15 19:25:01,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:25:02,140 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:25:02,142 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:25:02,142 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 66 treesize of output 39 [2022-03-15 19:25:02,222 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:25:02,222 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:25:02,385 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:25:02,385 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 127 treesize of output 79 [2022-03-15 19:25:02,753 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:25:02,754 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716682588] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:25:02,754 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:25:02,754 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 21 [2022-03-15 19:25:02,754 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1319263280] [2022-03-15 19:25:02,754 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:25:02,758 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:25:02,788 INFO L252 McrAutomatonBuilder]: Finished intersection with 156 states and 382 transitions. [2022-03-15 19:25:02,788 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:25:13,629 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [4528#(and (or (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 0) (<= ~N~0 1) (<= (+ 2 ~M~0) ~N~0) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (<= 0 ~M~0) (= ~max2~0 ~max1~0) (<= 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (<= (+ 2 ~M~0) ~N~0)) (= ~A~0.offset 0) (or (= ~max2~0 ~max1~0) (<= 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (<= ~N~0 1) (<= (+ 2 ~M~0) ~N~0)) (or (not (= (+ ~A~0.offset (* ~M~0 4)) 0)) (= ~max2~0 ~max1~0) (<= 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (<= 0 ~M~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 0) (<= (+ 2 ~M~0) ~N~0) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (= ~max3~0 0) (= ~max2~0 0) (or (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 0) (not (= (+ ~A~0.offset (* ~M~0 4)) 0)) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0))), 4526#(and (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (not (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)))) (< (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0) (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (= ~max2~0 ~max1~0)) (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (< (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0) (= ~max3~0 ~max1~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)))) (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (< (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0) (= ~max2~0 0)) (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (not (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)))) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (< (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0) (<= 1 ~max3~0) (= ~max2~0 ~max1~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))))), 4533#(and (or (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= 0 thread3Thread1of1ForFork1_~i~2)) (= ~A~0.offset 0) (or (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= ~N~0 1)) (= ~max3~0 0) (= ~max2~0 0) (= ~max1~0 0)), 4527#(and (or (not (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (< (+ ~M~0 1) ~N~0) (not (< ~M~0 ~N~0)) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (<= 1 ~max3~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (< (+ ~M~0 1) ~N~0) (= ~max2~0 ~max1~0) (not (< ~M~0 ~N~0))) (or (= ~max3~0 ~max1~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (< (+ ~M~0 1) ~N~0) (not (< ~M~0 ~N~0))) (or (not (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (< (+ ~M~0 1) ~N~0) (= ~max2~0 ~max1~0) (<= 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (not (< ~M~0 ~N~0))) (or (< (+ ~M~0 1) ~N~0) (= ~max2~0 0) (not (< ~M~0 ~N~0)))), 4531#(and (or (<= 1 ~max3~0) (<= ~N~0 0) (not (< ~max1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (= ~max2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (or (<= ~N~0 0) (= ~max2~0 0)) (or (< ~max1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= 1 ~max3~0) (<= ~N~0 0) (= ~max2~0 ~max1~0)) (or (< ~max1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= ~max3~0 ~max1~0) (<= ~N~0 0)) (or (= ~max3~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= ~N~0 0) (not (< ~max1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))))), 4525#(and (or (< thread3Thread1of1ForFork1_~i~2 ~N~0) (= ~max2~0 0)) (or (= ~max3~0 ~max1~0) (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (or (<= 1 ~max3~0) (< thread3Thread1of1ForFork1_~i~2 ~N~0) (= ~max2~0 ~max1~0))), 4530#(and (or (<= 1 ~max3~0) (< thread3Thread1of1ForFork1_~i~2 ~N~0) (<= ~N~0 thread1Thread1of1ForFork2_~i~0) (= ~max2~0 ~max1~0) (< ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (= ~max2~0 0) (<= ~N~0 thread1Thread1of1ForFork2_~i~0)) (or (< thread3Thread1of1ForFork1_~i~2 ~N~0) (<= ~N~0 thread1Thread1of1ForFork2_~i~0) (not (< ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (= ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (= ~max2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))) (<= 1 ~max3~0) (< thread3Thread1of1ForFork1_~i~2 ~N~0) (<= ~N~0 thread1Thread1of1ForFork2_~i~0) (not (< ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))))) (or (= ~max3~0 ~max1~0) (< thread3Thread1of1ForFork1_~i~2 ~N~0) (<= ~N~0 thread1Thread1of1ForFork2_~i~0) (< ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))))), 4532#(and (or (<= ~N~0 0) (= ~max2~0 0)) (or (< ~max1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= ~max3~0 ~max1~0) (< thread3Thread1of1ForFork1_~i~2 ~N~0) (<= ~N~0 0)) (or (< thread3Thread1of1ForFork1_~i~2 ~N~0) (= ~max3~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= ~N~0 0) (not (< ~max1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)))) (or (<= 1 ~max3~0) (< thread3Thread1of1ForFork1_~i~2 ~N~0) (<= ~N~0 0) (not (< ~max1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (= ~max2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (or (< ~max1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= 1 ~max3~0) (< thread3Thread1of1ForFork1_~i~2 ~N~0) (<= ~N~0 0) (= ~max2~0 ~max1~0))), 4529#(and (or (<= ~N~0 thread1Thread1of1ForFork2_~i~0) (not (< ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (= ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (= ~max3~0 ~max1~0) (<= ~N~0 thread1Thread1of1ForFork2_~i~0) (< ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (= ~max2~0 0) (<= ~N~0 thread1Thread1of1ForFork2_~i~0)) (or (= ~max2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))) (<= 1 ~max3~0) (<= ~N~0 thread1Thread1of1ForFork2_~i~0) (not (< ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))))) (or (<= 1 ~max3~0) (<= ~N~0 thread1Thread1of1ForFork2_~i~0) (= ~max2~0 ~max1~0) (< ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))))] [2022-03-15 19:25:13,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 19:25:13,629 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:25:13,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 19:25:13,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=851, Unknown=0, NotChecked=0, Total=992 [2022-03-15 19:25:13,630 INFO L87 Difference]: Start difference. First operand 262 states and 836 transitions. Second operand has 19 states, 18 states have (on average 5.611111111111111) internal successors, (101), 18 states have internal predecessors, (101), 0 states have call successors, (0), 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-03-15 19:25:16,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:25:16,055 INFO L93 Difference]: Finished difference Result 710 states and 2155 transitions. [2022-03-15 19:25:16,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-15 19:25:16,055 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 5.611111111111111) internal successors, (101), 18 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 19:25:16,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:25:16,063 INFO L225 Difference]: With dead ends: 710 [2022-03-15 19:25:16,063 INFO L226 Difference]: Without dead ends: 696 [2022-03-15 19:25:16,064 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 137 SyntacticMatches, 17 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 909 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=319, Invalid=2231, Unknown=0, NotChecked=0, Total=2550 [2022-03-15 19:25:16,064 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 104 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 1837 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 1859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:25:16,064 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 252 Invalid, 1859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1837 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 19:25:16,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2022-03-15 19:25:16,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 328. [2022-03-15 19:25:16,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 327 states have (on average 3.214067278287462) internal successors, (1051), 327 states have internal predecessors, (1051), 0 states have call successors, (0), 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-03-15 19:25:16,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 1051 transitions. [2022-03-15 19:25:16,079 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 1051 transitions. Word has length 23 [2022-03-15 19:25:16,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:25:16,080 INFO L470 AbstractCegarLoop]: Abstraction has 328 states and 1051 transitions. [2022-03-15 19:25:16,080 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 5.611111111111111) internal successors, (101), 18 states have internal predecessors, (101), 0 states have call successors, (0), 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-03-15 19:25:16,080 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 1051 transitions. [2022-03-15 19:25:16,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:25:16,081 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:25:16,081 INFO L514 BasicCegarLoop]: 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] [2022-03-15 19:25:16,104 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-03-15 19:25:16,295 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:25:16,295 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:25:16,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:25:16,296 INFO L85 PathProgramCache]: Analyzing trace with hash -538401651, now seen corresponding path program 3 times [2022-03-15 19:25:16,297 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:25:16,297 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121124110] [2022-03-15 19:25:16,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:25:16,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:25:16,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:25:16,779 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:25:16,779 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:25:16,779 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121124110] [2022-03-15 19:25:16,779 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121124110] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:25:16,780 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548174348] [2022-03-15 19:25:16,780 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:25:16,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:25:16,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:25:16,784 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-03-15 19:25:16,788 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-03-15 19:25:16,880 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 19:25:16,881 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:25:16,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 42 conjunts are in the unsatisfiable core [2022-03-15 19:25:16,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:25:17,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:25:17,144 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-03-15 19:25:17,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:25:17,254 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-03-15 19:25:17,379 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:25:17,381 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:25:17,381 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 66 treesize of output 39 [2022-03-15 19:25:17,474 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:25:17,475 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:25:17,756 WARN L838 $PredicateComparison]: unable to prove that (and (or (and (or (= c_~max1~0 c_~max2~0) (< c_~max2~0 c_~max3~0)) (or (= c_~max1~0 c_~max3~0) (<= c_~max3~0 c_~max2~0))) (forall ((v_ArrVal_263 (Array Int Int))) (< c_~max3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_263) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0)))))) (forall ((v_ArrVal_263 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_263) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))))) (or (not (< c_~max3~0 .cse0)) (and (or (= c_~max1~0 .cse0) (<= .cse0 c_~max2~0)) (or (= c_~max1~0 c_~max2~0) (< c_~max2~0 .cse0))))))) is different from false [2022-03-15 19:25:17,894 WARN L838 $PredicateComparison]: unable to prove that (and (or (and (or (= c_~max1~0 c_~max2~0) (< c_~max2~0 c_~max3~0)) (or (= c_~max1~0 c_~max3~0) (<= c_~max3~0 c_~max2~0))) (forall ((v_ArrVal_263 (Array Int Int)) (v_ArrVal_262 (Array Int Int))) (< c_~max3~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_262) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_263) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0)))))) (forall ((v_ArrVal_263 (Array Int Int)) (v_ArrVal_262 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_262) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_263) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))))) (or (and (or (< c_~max2~0 .cse0) (= c_~max1~0 c_~max2~0)) (or (<= .cse0 c_~max2~0) (= .cse0 c_~max1~0))) (not (< c_~max3~0 .cse0)))))) is different from false [2022-03-15 19:25:17,971 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:25:17,971 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 727 treesize of output 647 [2022-03-15 19:25:17,987 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 608 treesize of output 596 [2022-03-15 19:25:17,995 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 596 treesize of output 590 [2022-03-15 19:25:18,002 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 590 treesize of output 542 [2022-03-15 19:25:18,008 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 542 treesize of output 446 [2022-03-15 19:25:19,049 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-03-15 19:25:19,049 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548174348] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:25:19,049 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:25:19,049 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 29 [2022-03-15 19:25:19,049 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2006550436] [2022-03-15 19:25:19,049 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:25:19,052 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:25:19,074 INFO L252 McrAutomatonBuilder]: Finished intersection with 104 states and 228 transitions. [2022-03-15 19:25:19,074 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:25:30,161 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 28 new interpolants: [6113#(and (or (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 0) (= ~max2~0 ~max1~0)) (or (<= 1 ~max3~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 ~max1~0)) (or (= ~max3~0 ~max1~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0))), 6120#(and (or (= ~A~0.offset 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (<= ~M~0 0)) (or (= ~max3~0 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 0)) (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 ~max1~0)) (or (<= 1 ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (<= (select (select |#memory_int| ~A~0.base) 0) 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0)))), 6105#(and (or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 0) (= ~max2~0 ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (or (= ~max3~0 ~max1~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (or (<= 1 ~max3~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0))), 6108#(and (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= 1 ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (<= 1 ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 0)) (or (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0) (= ~max3~0 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (= ~A~0.offset 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (<= 1 ~N~0) (= ~max3~0 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (= ~max3~0 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (= ~max3~0 ~max1~0) (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= 1 ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 ~max1~0)) (or (= ~max3~0 ~max1~0) (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 0))), 6106#(and (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (not (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)))) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (= ~max3~0 ~max1~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)))) (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= 1 ~max3~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 ~max1~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)))) (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 0) (= ~max2~0 ~max1~0)) (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (not (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)))) (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 ~max1~0))), 6112#(and (or (< 0 ~M~0) (<= 1 ~max3~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0) (<= (+ 2 ~M~0) ~N~0) (not (< ~M~0 ~N~0))) (or (not (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (< 0 ~M~0) (<= (+ 2 ~M~0) ~N~0) (not (< ~M~0 ~N~0)) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (< 0 ~M~0) (= ~max2~0 0) (= ~max2~0 ~max1~0) (<= (+ 2 ~M~0) ~N~0) (not (< ~M~0 ~N~0))) (or (= ~max3~0 ~max1~0) (< 0 ~M~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (<= (+ 2 ~M~0) ~N~0) (not (< ~M~0 ~N~0))) (or (not (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (< 0 ~M~0) (= ~max2~0 ~max1~0) (<= 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (<= (+ 2 ~M~0) ~N~0) (not (< ~M~0 ~N~0)))), 6104#(and (or (not (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (<= (+ 2 ~M~0) ~N~0) (not (< ~M~0 ~N~0)) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (<= 1 ~max3~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0) (<= (+ 2 ~M~0) ~N~0) (not (< ~M~0 ~N~0))) (or (= ~max3~0 ~max1~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (<= (+ 2 ~M~0) ~N~0) (not (< ~M~0 ~N~0))) (or (not (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (= ~max2~0 ~max1~0) (<= 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (<= (+ 2 ~M~0) ~N~0) (not (< ~M~0 ~N~0))) (or (= ~max2~0 0) (= ~max2~0 ~max1~0) (<= (+ 2 ~M~0) ~N~0) (not (< ~M~0 ~N~0)))), 6117#(and (or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 0) (= ~max2~0 ~max1~0)) (or (<= 1 ~max3~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 ~max1~0)) (or (= ~max3~0 ~max1~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0))), 6118#(and (or (= ~max3~0 ~max1~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 0) (= ~max2~0 ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (or (<= 1 ~max3~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0))), 6101#(and (or (= ~max3~0 ~max1~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (<= 1 ~max3~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 ~max1~0)) (or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 0) (= ~max2~0 ~max1~0))), 6126#(and (or (< 0 ~M~0) (<= (select (select |#memory_int| ~A~0.base) 0) 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (or (= ~A~0.offset 0) (< 0 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max3~0 ~max1~0) (< 0 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (< 0 ~M~0) (<= 1 ~N~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (< 0 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 0)) (or (< 0 ~M~0) (= ~max3~0 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0))), 6119#(and (or (= ~A~0.offset 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 ~max1~0)) (or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (<= 1 ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 0)) (or (= ~max3~0 ~max1~0) (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= 1 ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (= ~max3~0 ~max1~0) (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (= ~max3~0 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 0)) (or (<= 1 ~N~0) (= ~max3~0 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= 1 ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0) (= ~max3~0 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0))), 6121#(and (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (< 0 ~M~0) (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0) (= ~max3~0 0)) (or (= ~max3~0 ~max1~0) (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< 0 ~M~0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< 0 ~M~0) (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0) (= ~max2~0 ~max1~0)) (or (= ~max3~0 ~max1~0) (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< 0 ~M~0) (<= 1 ~N~0)) (or (< 0 ~M~0) (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0) (= ~max2~0 0)) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< 0 ~M~0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (< 0 ~M~0) (= ~max3~0 0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (< 0 ~M~0) (<= 1 ~N~0) (= ~max3~0 0)) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< 0 ~M~0) (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0)) (or (< 0 ~M~0) (= ~max2~0 0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (< 0 ~M~0) (<= 1 ~N~0) (= ~max2~0 0)) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< 0 ~M~0) (<= 1 ~N~0))), 6127#(and (or (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= thread2Thread1of1ForFork0_~i~1 0)) (or (= ~max3~0 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 0)) (or (= ~A~0.offset 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (< thread1Thread1of1ForFork2_~i~0 ~N~0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (or (<= (select (select |#memory_int| ~A~0.base) 0) 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 ~max1~0)) (or (<= 1 ~N~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0))), 6116#(and (or (< thread1Thread1of1ForFork2_~i~0 ~N~0) (<= ~M~0 0)) (or (= ~max3~0 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 0)) (or (= ~A~0.offset 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (<= (select (select |#memory_int| ~A~0.base) 0) 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 ~max1~0)) (or (<= 1 ~N~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0))), 6128#(and (or (= ~max3~0 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 0)) (or (= ~A~0.offset 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (< thread1Thread1of1ForFork2_~i~0 ~N~0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (or (<= (select (select |#memory_int| ~A~0.base) 0) 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 ~max1~0)) (or (<= 1 ~N~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0))), 6103#(and (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (not (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)))) (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (= ~max2~0 ~max1~0)) (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= 1 ~max3~0) (= ~max2~0 ~max1~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)))) (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (= ~max3~0 ~max1~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)))) (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (not (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)))) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)))) (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (= ~max2~0 0) (= ~max2~0 ~max1~0))), 6115#(and (or (= ~max3~0 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (<= 1 ~N~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 0)) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= 1 ~N~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 ~max1~0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (= ~max3~0 ~max1~0) (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= 1 ~N~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (= ~A~0.offset 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (<= 1 ~N~0) (= ~max3~0 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 0)) (or (= ~max3~0 ~max1~0) (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0) (= ~max3~0 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0))), 6110#(and (or (= ~max3~0 ~max1~0) (< 0 ~M~0) (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (or (< 0 ~M~0) (< thread3Thread1of1ForFork1_~i~2 ~N~0) (= ~max2~0 0) (= ~max2~0 ~max1~0)) (or (< 0 ~M~0) (<= 1 ~max3~0) (= ~max2~0 ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0))), 6123#(and (or (< 0 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 0) (= ~max2~0 ~max1~0)) (or (= ~max3~0 ~max1~0) (< 0 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (< 0 ~M~0) (<= 1 ~max3~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 ~max1~0))), 6125#(and (or (< 0 ~M~0) (<= 1 ~N~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 0)) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< 0 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< 0 ~M~0) (<= 1 ~N~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (= ~max3~0 ~max1~0) (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< 0 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (< 0 ~M~0) (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0) (= ~max3~0 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (< 0 ~M~0) (<= 1 ~N~0) (= ~max3~0 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (< 0 ~M~0) (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 0)) (or (= ~A~0.offset 0) (< 0 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< 0 ~M~0) (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< 0 ~M~0) (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 ~max1~0)) (or (= ~max3~0 ~max1~0) (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< 0 ~M~0) (<= 1 ~N~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (< 0 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (< 0 ~M~0) (= ~max3~0 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0)))), 6122#(and (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (< 0 ~M~0) (= ~max2~0 0)) (or (< 0 ~M~0) (= ~max3~0 0)) (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max3~0 ~max1~0) (< 0 ~M~0)) (or (< 0 ~M~0) (<= (select (select |#memory_int| ~A~0.base) 0) 0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (or (< 0 ~M~0) (<= 1 ~N~0))), 6107#(and (or (not (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 ~max1~0) (<= 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (<= (+ 2 ~M~0) ~N~0) (not (< ~M~0 ~N~0))) (or (not (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= (+ 2 ~M~0) ~N~0) (not (< ~M~0 ~N~0)) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 0) (= ~max2~0 ~max1~0) (<= (+ 2 ~M~0) ~N~0) (not (< ~M~0 ~N~0))) (or (= ~max3~0 ~max1~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= (+ 2 ~M~0) ~N~0) (not (< ~M~0 ~N~0))) (or (<= 1 ~max3~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 ~max1~0) (<= (+ 2 ~M~0) ~N~0) (not (< ~M~0 ~N~0)))), 6109#(and (or (<= 1 ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (= ~max3~0 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 0)) (or (= ~A~0.offset 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= ~M~0 0)) (or (<= (select (select |#memory_int| ~A~0.base) 0) 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0))) (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (= ~max3~0 ~max1~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0))), 6124#(and (or (< 0 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 0) (= ~max2~0 ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (or (< 0 ~M~0) (<= 1 ~max3~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 ~max1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)) (or (= ~max3~0 ~max1~0) (< 0 ~M~0) (< thread3Thread1of1ForFork1_~i~2 ~N~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0))), 6114#(and (or (= ~max3~0 ~max1~0) (< thread3Thread1of1ForFork1_~i~2 ~N~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (<= 1 ~max3~0) (< thread3Thread1of1ForFork1_~i~2 ~N~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 ~max1~0)) (or (< thread3Thread1of1ForFork1_~i~2 ~N~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 0) (= ~max2~0 ~max1~0))), 6102#(and (or (< 0 ~M~0) (<= 1 ~max3~0) (= ~max2~0 ~max1~0)) (or (< 0 ~M~0) (= ~max2~0 0) (= ~max2~0 ~max1~0)) (or (= ~max3~0 ~max1~0) (< 0 ~M~0))), 6111#(and (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (< 0 ~M~0) (<= 1 ~max3~0) (= ~max2~0 ~max1~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)))) (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (= ~max3~0 ~max1~0) (< 0 ~M~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)))) (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (< 0 ~M~0) (= ~max2~0 0) (= ~max2~0 ~max1~0)) (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (not (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)))) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< 0 ~M~0)) (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (not (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)))) (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< 0 ~M~0) (= ~max2~0 ~max1~0)))] [2022-03-15 19:25:30,161 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-15 19:25:30,161 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:25:30,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-15 19:25:30,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=2819, Unknown=2, NotChecked=222, Total=3422 [2022-03-15 19:25:30,163 INFO L87 Difference]: Start difference. First operand 328 states and 1051 transitions. Second operand has 41 states, 40 states have (on average 3.525) internal successors, (141), 40 states have internal predecessors, (141), 0 states have call successors, (0), 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-03-15 19:25:33,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:25:33,142 INFO L93 Difference]: Finished difference Result 803 states and 2522 transitions. [2022-03-15 19:25:33,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 19:25:33,142 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 3.525) internal successors, (141), 40 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 19:25:33,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:25:33,147 INFO L225 Difference]: With dead ends: 803 [2022-03-15 19:25:33,147 INFO L226 Difference]: Without dead ends: 796 [2022-03-15 19:25:33,149 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 71 SyntacticMatches, 7 SemanticMatches, 74 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1839 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=683, Invalid=4725, Unknown=2, NotChecked=290, Total=5700 [2022-03-15 19:25:33,149 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 356 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 2277 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 2356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 2277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:25:33,149 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [356 Valid, 92 Invalid, 2356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 2277 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 19:25:33,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2022-03-15 19:25:33,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 330. [2022-03-15 19:25:33,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 329 states have (on average 3.2066869300911853) internal successors, (1055), 329 states have internal predecessors, (1055), 0 states have call successors, (0), 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-03-15 19:25:33,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 1055 transitions. [2022-03-15 19:25:33,163 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 1055 transitions. Word has length 23 [2022-03-15 19:25:33,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:25:33,163 INFO L470 AbstractCegarLoop]: Abstraction has 330 states and 1055 transitions. [2022-03-15 19:25:33,163 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 3.525) internal successors, (141), 40 states have internal predecessors, (141), 0 states have call successors, (0), 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-03-15 19:25:33,164 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 1055 transitions. [2022-03-15 19:25:33,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:25:33,165 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:25:33,165 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:25:33,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-15 19:25:33,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:25:33,388 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:25:33,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:25:33,388 INFO L85 PathProgramCache]: Analyzing trace with hash -780631851, now seen corresponding path program 4 times [2022-03-15 19:25:33,389 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:25:33,389 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788852038] [2022-03-15 19:25:33,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:25:33,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:25:33,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:25:33,440 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:25:33,441 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:25:33,441 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788852038] [2022-03-15 19:25:33,441 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788852038] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:25:33,441 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537560072] [2022-03-15 19:25:33,441 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:25:33,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:25:33,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:25:33,442 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-03-15 19:25:33,467 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-03-15 19:25:33,521 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:25:33,521 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:25:33,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 19:25:33,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:25:33,639 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:25:33,640 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:25:33,724 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:25:33,724 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537560072] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:25:33,724 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:25:33,725 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 19 [2022-03-15 19:25:33,725 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [520687851] [2022-03-15 19:25:33,725 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:25:33,727 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:25:33,747 INFO L252 McrAutomatonBuilder]: Finished intersection with 114 states and 247 transitions. [2022-03-15 19:25:33,747 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:25:34,283 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [7783#(< thread1Thread1of1ForFork2_~i~0 ~N~0)] [2022-03-15 19:25:34,284 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 19:25:34,284 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:25:34,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 19:25:34,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2022-03-15 19:25:34,284 INFO L87 Difference]: Start difference. First operand 330 states and 1055 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 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-03-15 19:25:34,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:25:34,414 INFO L93 Difference]: Finished difference Result 540 states and 1677 transitions. [2022-03-15 19:25:34,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 19:25:34,419 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:25:34,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:25:34,422 INFO L225 Difference]: With dead ends: 540 [2022-03-15 19:25:34,422 INFO L226 Difference]: Without dead ends: 534 [2022-03-15 19:25:34,423 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2022-03-15 19:25:34,423 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 72 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:25:34,424 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 38 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:25:34,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2022-03-15 19:25:34,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 422. [2022-03-15 19:25:34,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 421 states have (on average 3.2565320665083135) internal successors, (1371), 421 states have internal predecessors, (1371), 0 states have call successors, (0), 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-03-15 19:25:34,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 1371 transitions. [2022-03-15 19:25:34,437 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 1371 transitions. Word has length 24 [2022-03-15 19:25:34,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:25:34,437 INFO L470 AbstractCegarLoop]: Abstraction has 422 states and 1371 transitions. [2022-03-15 19:25:34,437 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 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-03-15 19:25:34,437 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 1371 transitions. [2022-03-15 19:25:34,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:25:34,439 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:25:34,439 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:25:34,464 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-03-15 19:25:34,655 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:25:34,655 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:25:34,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:25:34,656 INFO L85 PathProgramCache]: Analyzing trace with hash 2072416567, now seen corresponding path program 5 times [2022-03-15 19:25:34,657 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:25:34,657 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027162606] [2022-03-15 19:25:34,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:25:34,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:25:34,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:25:34,749 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:25:34,750 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:25:34,750 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027162606] [2022-03-15 19:25:34,750 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027162606] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:25:34,750 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148456926] [2022-03-15 19:25:34,750 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:25:34,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:25:34,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:25:34,751 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-03-15 19:25:34,752 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-03-15 19:25:34,823 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:25:34,823 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:25:34,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 19:25:34,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:25:34,943 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:25:34,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:25:35,006 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:25:35,006 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148456926] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:25:35,006 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:25:35,006 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2022-03-15 19:25:35,006 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [9192190] [2022-03-15 19:25:35,006 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:25:35,010 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:25:35,029 INFO L252 McrAutomatonBuilder]: Finished intersection with 130 states and 292 transitions. [2022-03-15 19:25:35,029 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:25:35,911 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [9328#(or (< (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0) (<= ~N~0 thread3Thread1of1ForFork1_~i~2)), 9330#(or (<= ~N~0 (+ ~M~0 1)) (< (+ 2 ~M~0) ~N~0)), 9329#(or (< (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), 9327#(< thread3Thread1of1ForFork1_~i~2 ~N~0)] [2022-03-15 19:25:35,911 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 19:25:35,911 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:25:35,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 19:25:35,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2022-03-15 19:25:35,912 INFO L87 Difference]: Start difference. First operand 422 states and 1371 transitions. Second operand has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 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-03-15 19:25:36,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:25:36,100 INFO L93 Difference]: Finished difference Result 520 states and 1551 transitions. [2022-03-15 19:25:36,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 19:25:36,103 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:25:36,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:25:36,107 INFO L225 Difference]: With dead ends: 520 [2022-03-15 19:25:36,107 INFO L226 Difference]: Without dead ends: 476 [2022-03-15 19:25:36,107 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 119 SyntacticMatches, 21 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2022-03-15 19:25:36,108 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 111 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:25:36,108 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 30 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:25:36,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2022-03-15 19:25:36,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 456. [2022-03-15 19:25:36,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 455 states have (on average 3.0791208791208793) internal successors, (1401), 455 states have internal predecessors, (1401), 0 states have call successors, (0), 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-03-15 19:25:36,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 1401 transitions. [2022-03-15 19:25:36,122 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 1401 transitions. Word has length 24 [2022-03-15 19:25:36,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:25:36,122 INFO L470 AbstractCegarLoop]: Abstraction has 456 states and 1401 transitions. [2022-03-15 19:25:36,122 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 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-03-15 19:25:36,122 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 1401 transitions. [2022-03-15 19:25:36,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:25:36,123 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:25:36,124 INFO L514 BasicCegarLoop]: 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] [2022-03-15 19:25:36,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-15 19:25:36,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:25:36,340 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:25:36,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:25:36,340 INFO L85 PathProgramCache]: Analyzing trace with hash 433773, now seen corresponding path program 1 times [2022-03-15 19:25:36,341 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:25:36,341 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070829075] [2022-03-15 19:25:36,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:25:36,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:25:36,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:25:36,422 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:25:36,423 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:25:36,423 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070829075] [2022-03-15 19:25:36,423 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070829075] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:25:36,423 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [337404461] [2022-03-15 19:25:36,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:25:36,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:25:36,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:25:36,425 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-03-15 19:25:36,427 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-03-15 19:25:36,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:25:36,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 19:25:36,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:25:36,608 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:25:36,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:25:36,671 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:25:36,671 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [337404461] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:25:36,671 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:25:36,671 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2022-03-15 19:25:36,672 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1298521320] [2022-03-15 19:25:36,672 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:25:36,674 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:25:36,687 INFO L252 McrAutomatonBuilder]: Finished intersection with 88 states and 174 transitions. [2022-03-15 19:25:36,687 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:25:37,193 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [10924#(< thread3Thread1of1ForFork1_~i~2 ~N~0), 10930#(or (< (+ ~M~0 1) ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= ~N~0 ~M~0)), 10927#(or (< (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= ~N~0 thread3Thread1of1ForFork1_~i~2)), 10925#(or (< thread3Thread1of1ForFork1_~i~2 ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)), 10928#(or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= ~N~0 thread3Thread1of1ForFork1_~i~2)), 10923#(< thread2Thread1of1ForFork0_~i~1 ~M~0), 10929#(or (< (+ ~M~0 1) ~N~0) (<= ~N~0 ~M~0)), 10926#(or (< (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0) (<= ~N~0 thread3Thread1of1ForFork1_~i~2)), 10931#(or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= ~N~0 ~M~0))] [2022-03-15 19:25:37,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 19:25:37,193 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:25:37,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 19:25:37,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2022-03-15 19:25:37,194 INFO L87 Difference]: Start difference. First operand 456 states and 1401 transitions. Second operand has 17 states, 17 states have (on average 4.529411764705882) internal successors, (77), 16 states have internal predecessors, (77), 0 states have call successors, (0), 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-03-15 19:25:37,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:25:37,459 INFO L93 Difference]: Finished difference Result 498 states and 1479 transitions. [2022-03-15 19:25:37,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 19:25:37,460 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.529411764705882) internal successors, (77), 16 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:25:37,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:25:37,462 INFO L225 Difference]: With dead ends: 498 [2022-03-15 19:25:37,462 INFO L226 Difference]: Without dead ends: 438 [2022-03-15 19:25:37,463 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=177, Invalid=753, Unknown=0, NotChecked=0, Total=930 [2022-03-15 19:25:37,464 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 111 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:25:37,464 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 61 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:25:37,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2022-03-15 19:25:37,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 418. [2022-03-15 19:25:37,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 417 states have (on average 3.047961630695444) internal successors, (1271), 417 states have internal predecessors, (1271), 0 states have call successors, (0), 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-03-15 19:25:37,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 1271 transitions. [2022-03-15 19:25:37,474 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 1271 transitions. Word has length 24 [2022-03-15 19:25:37,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:25:37,475 INFO L470 AbstractCegarLoop]: Abstraction has 418 states and 1271 transitions. [2022-03-15 19:25:37,475 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.529411764705882) internal successors, (77), 16 states have internal predecessors, (77), 0 states have call successors, (0), 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-03-15 19:25:37,475 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 1271 transitions. [2022-03-15 19:25:37,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:25:37,476 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:25:37,476 INFO L514 BasicCegarLoop]: 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] [2022-03-15 19:25:37,504 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-03-15 19:25:37,703 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,SelfDestructingSolverStorable9 [2022-03-15 19:25:37,703 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:25:37,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:25:37,704 INFO L85 PathProgramCache]: Analyzing trace with hash -907064467, now seen corresponding path program 2 times [2022-03-15 19:25:37,705 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:25:37,705 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497198765] [2022-03-15 19:25:37,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:25:37,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:25:37,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:25:37,789 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:25:37,789 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:25:37,789 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497198765] [2022-03-15 19:25:37,789 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497198765] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:25:37,789 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644236050] [2022-03-15 19:25:37,789 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:25:37,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:25:37,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:25:37,792 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-03-15 19:25:37,818 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-03-15 19:25:37,883 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:25:37,884 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:25:37,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 19:25:37,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:25:37,995 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:25:37,996 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:25:38,065 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:25:38,065 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [644236050] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:25:38,065 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:25:38,066 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 15 [2022-03-15 19:25:38,066 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1269886107] [2022-03-15 19:25:38,066 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:25:38,068 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:25:38,100 INFO L252 McrAutomatonBuilder]: Finished intersection with 132 states and 302 transitions. [2022-03-15 19:25:38,101 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:25:39,324 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [12442#(or (< (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0) (<= ~M~0 0) (< 1 ~M~0) (<= ~N~0 thread3Thread1of1ForFork1_~i~2)), 12439#(or (< thread3Thread1of1ForFork1_~i~2 ~N~0) (<= ~M~0 0) (< 1 ~M~0)), 12435#(or (< (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0) (<= ~N~0 thread3Thread1of1ForFork1_~i~2)), 12440#(or (< (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= ~N~0 thread3Thread1of1ForFork1_~i~2)), 12433#(or (< (+ thread2Thread1of1ForFork0_~i~1 1) ~M~0) (<= ~M~0 thread2Thread1of1ForFork0_~i~1)), 12441#(or (< (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0) (< (+ thread2Thread1of1ForFork0_~i~1 1) ~M~0) (<= ~N~0 thread3Thread1of1ForFork1_~i~2) (<= ~M~0 thread2Thread1of1ForFork0_~i~1)), 12443#(<= (+ ~N~0 ~M~0) (+ thread3Thread1of1ForFork1_~i~2 1)), 12437#(or (< thread3Thread1of1ForFork1_~i~2 ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)), 12434#(< thread3Thread1of1ForFork1_~i~2 ~N~0), 12414#(<= ~M~0 0), 12447#(or (< (+ ~M~0 1) ~N~0) (<= ~N~0 ~M~0) (<= ~M~0 0) (< 1 ~M~0)), 12438#(or (< thread3Thread1of1ForFork1_~i~2 ~N~0) (< (+ thread2Thread1of1ForFork0_~i~1 1) ~M~0) (<= ~M~0 thread2Thread1of1ForFork0_~i~1)), 12432#(< thread2Thread1of1ForFork0_~i~1 ~M~0), 12444#(or (< (+ ~M~0 1) ~N~0) (<= ~N~0 ~M~0)), 12436#(or (<= ~M~0 0) (< 1 ~M~0)), 12446#(or (< (+ ~M~0 1) ~N~0) (<= ~N~0 ~M~0) (< (+ thread2Thread1of1ForFork0_~i~1 1) ~M~0) (<= ~M~0 thread2Thread1of1ForFork0_~i~1)), 12445#(or (< (+ ~M~0 1) ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= ~N~0 ~M~0))] [2022-03-15 19:25:39,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 19:25:39,324 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:25:39,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 19:25:39,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=855, Unknown=0, NotChecked=0, Total=992 [2022-03-15 19:25:39,325 INFO L87 Difference]: Start difference. First operand 418 states and 1271 transitions. Second operand has 25 states, 25 states have (on average 4.72) internal successors, (118), 24 states have internal predecessors, (118), 0 states have call successors, (0), 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-03-15 19:25:39,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:25:39,731 INFO L93 Difference]: Finished difference Result 370 states and 1089 transitions. [2022-03-15 19:25:39,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 19:25:39,732 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.72) internal successors, (118), 24 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:25:39,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:25:39,733 INFO L225 Difference]: With dead ends: 370 [2022-03-15 19:25:39,733 INFO L226 Difference]: Without dead ends: 265 [2022-03-15 19:25:39,734 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 127 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=263, Invalid=1219, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 19:25:39,734 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 171 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:25:39,734 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 99 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:25:39,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2022-03-15 19:25:39,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2022-03-15 19:25:39,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 264 states have (on average 3.1856060606060606) internal successors, (841), 264 states have internal predecessors, (841), 0 states have call successors, (0), 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-03-15 19:25:39,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 841 transitions. [2022-03-15 19:25:39,741 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 841 transitions. Word has length 24 [2022-03-15 19:25:39,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:25:39,741 INFO L470 AbstractCegarLoop]: Abstraction has 265 states and 841 transitions. [2022-03-15 19:25:39,741 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.72) internal successors, (118), 24 states have internal predecessors, (118), 0 states have call successors, (0), 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-03-15 19:25:39,741 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 841 transitions. [2022-03-15 19:25:39,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:25:39,742 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:25:39,742 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:25:39,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-03-15 19:25:39,947 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:25:39,947 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:25:39,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:25:39,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1650965559, now seen corresponding path program 6 times [2022-03-15 19:25:39,948 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:25:39,949 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915248866] [2022-03-15 19:25:39,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:25:39,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:25:39,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:25:40,040 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:25:40,040 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:25:40,040 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915248866] [2022-03-15 19:25:40,040 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915248866] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:25:40,040 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013662696] [2022-03-15 19:25:40,040 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:25:40,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:25:40,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:25:40,042 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-03-15 19:25:40,043 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-03-15 19:25:40,128 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 19:25:40,128 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:25:40,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 19:25:40,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:25:40,260 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:25:40,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:25:40,329 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:25:40,330 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013662696] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:25:40,330 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:25:40,330 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-03-15 19:25:40,330 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1013937464] [2022-03-15 19:25:40,330 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:25:40,332 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:25:40,356 INFO L252 McrAutomatonBuilder]: Finished intersection with 157 states and 383 transitions. [2022-03-15 19:25:40,356 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:25:41,773 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [13522#(or (< thread3Thread1of1ForFork1_~i~2 ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)), 13531#(or (< 0 ~M~0) (< (+ ~M~0 1) ~N~0) (<= ~N~0 ~M~0)), 13520#(or (<= ~N~0 ~M~0) (<= (+ 2 ~M~0) ~N~0)), 13527#(< 0 ~M~0), 13525#(or (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)), 13523#(or (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= ~N~0 thread3Thread1of1ForFork1_~i~2)), 13530#(or (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (< 0 ~M~0)), 13521#(< thread2Thread1of1ForFork0_~i~1 ~M~0), 13524#(or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= ~N~0 ~M~0) (<= (+ 2 ~M~0) ~N~0)), 13526#(or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= (+ 2 ~M~0) ~N~0)), 13519#(or (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= ~N~0 thread3Thread1of1ForFork1_~i~2)), 13529#(or (< (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0) (< 0 ~M~0) (<= ~N~0 thread3Thread1of1ForFork1_~i~2)), 13532#(or (< 0 ~M~0) (<= (+ 2 ~M~0) ~N~0)), 13528#(or (< 0 ~M~0) (< thread3Thread1of1ForFork1_~i~2 ~N~0))] [2022-03-15 19:25:41,773 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 19:25:41,773 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:25:41,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 19:25:41,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=887, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 19:25:41,774 INFO L87 Difference]: Start difference. First operand 265 states and 841 transitions. Second operand has 24 states, 24 states have (on average 5.791666666666667) internal successors, (139), 23 states have internal predecessors, (139), 0 states have call successors, (0), 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-03-15 19:25:42,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:25:42,388 INFO L93 Difference]: Finished difference Result 413 states and 1308 transitions. [2022-03-15 19:25:42,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 19:25:42,388 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.791666666666667) internal successors, (139), 23 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:25:42,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:25:42,390 INFO L225 Difference]: With dead ends: 413 [2022-03-15 19:25:42,390 INFO L226 Difference]: Without dead ends: 413 [2022-03-15 19:25:42,391 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 150 SyntacticMatches, 6 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=496, Invalid=1760, Unknown=0, NotChecked=0, Total=2256 [2022-03-15 19:25:42,391 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 192 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:25:42,391 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [192 Valid, 110 Invalid, 925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:25:42,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2022-03-15 19:25:42,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 267. [2022-03-15 19:25:42,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 266 states have (on average 3.225563909774436) internal successors, (858), 266 states have internal predecessors, (858), 0 states have call successors, (0), 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-03-15 19:25:42,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 858 transitions. [2022-03-15 19:25:42,399 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 858 transitions. Word has length 24 [2022-03-15 19:25:42,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:25:42,399 INFO L470 AbstractCegarLoop]: Abstraction has 267 states and 858 transitions. [2022-03-15 19:25:42,399 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.791666666666667) internal successors, (139), 23 states have internal predecessors, (139), 0 states have call successors, (0), 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-03-15 19:25:42,399 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 858 transitions. [2022-03-15 19:25:42,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 19:25:42,400 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:25:42,401 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:25:42,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-03-15 19:25:42,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-03-15 19:25:42,615 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:25:42,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:25:42,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1644676639, now seen corresponding path program 7 times [2022-03-15 19:25:42,616 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:25:42,617 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220278173] [2022-03-15 19:25:42,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:25:42,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:25:42,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:25:42,689 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:25:42,690 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:25:42,690 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220278173] [2022-03-15 19:25:42,690 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220278173] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:25:42,691 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331077560] [2022-03-15 19:25:42,691 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:25:42,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:25:42,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:25:42,696 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:25:42,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-15 19:25:42,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:25:42,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 19:25:42,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:25:42,844 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:25:42,845 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:25:42,903 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:25:42,903 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331077560] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:25:42,903 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:25:42,904 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-03-15 19:25:42,904 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [976798084] [2022-03-15 19:25:42,904 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:25:42,906 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:25:42,928 INFO L252 McrAutomatonBuilder]: Finished intersection with 131 states and 293 transitions. [2022-03-15 19:25:42,929 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:25:43,605 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:25:43,605 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 19:25:43,605 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:25:43,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 19:25:43,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2022-03-15 19:25:43,606 INFO L87 Difference]: Start difference. First operand 267 states and 858 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 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-03-15 19:25:43,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:25:43,692 INFO L93 Difference]: Finished difference Result 319 states and 1034 transitions. [2022-03-15 19:25:43,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 19:25:43,693 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-03-15 19:25:43,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:25:43,694 INFO L225 Difference]: With dead ends: 319 [2022-03-15 19:25:43,694 INFO L226 Difference]: Without dead ends: 319 [2022-03-15 19:25:43,695 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 137 SyntacticMatches, 10 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2022-03-15 19:25:43,695 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 48 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:25:43,695 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 16 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:25:43,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-03-15 19:25:43,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2022-03-15 19:25:43,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 318 states have (on average 3.251572327044025) internal successors, (1034), 318 states have internal predecessors, (1034), 0 states have call successors, (0), 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-03-15 19:25:43,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 1034 transitions. [2022-03-15 19:25:43,707 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 1034 transitions. Word has length 25 [2022-03-15 19:25:43,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:25:43,707 INFO L470 AbstractCegarLoop]: Abstraction has 319 states and 1034 transitions. [2022-03-15 19:25:43,708 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 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-03-15 19:25:43,708 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 1034 transitions. [2022-03-15 19:25:43,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:25:43,709 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:25:43,709 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:25:43,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-15 19:25:43,933 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-03-15 19:25:43,933 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:25:43,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:25:43,933 INFO L85 PathProgramCache]: Analyzing trace with hash -595372835, now seen corresponding path program 8 times [2022-03-15 19:25:43,934 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:25:43,934 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482686221] [2022-03-15 19:25:43,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:25:43,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:25:43,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:25:44,785 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:25:44,785 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:25:44,785 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482686221] [2022-03-15 19:25:44,785 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482686221] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:25:44,786 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032626923] [2022-03-15 19:25:44,786 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:25:44,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:25:44,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:25:44,812 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:25:44,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-15 19:25:44,902 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:25:44,903 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:25:44,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 46 conjunts are in the unsatisfiable core [2022-03-15 19:25:44,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:25:45,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:25:45,432 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 87 [2022-03-15 19:25:45,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:25:45,803 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:25:45,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:25:45,805 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:25:45,809 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:25:45,810 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 164 treesize of output 84 [2022-03-15 19:25:45,936 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:25:45,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:25:46,583 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_584 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_584) c_~A~0.base)) (.cse5 (* 4 c_~M~0))) (let ((.cse1 (select .cse4 (+ c_~A~0.offset .cse5)))) (or (let ((.cse3 (select .cse4 (+ c_~A~0.offset .cse5 4)))) (let ((.cse0 (< .cse1 .cse3)) (.cse2 (= c_~max1~0 c_~max2~0))) (and (or .cse0 (and (or (<= .cse1 c_~max2~0) (= c_~max1~0 .cse1)) (or .cse2 (< c_~max2~0 .cse1)))) (or (not .cse0) (and (or .cse2 (< c_~max2~0 .cse3)) (or (= .cse3 c_~max1~0) (<= .cse3 c_~max2~0))))))) (not (< c_~max3~0 .cse1)))))) (forall ((v_ArrVal_584 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_584) c_~A~0.base)) (.cse7 (* 4 c_~M~0))) (or (< c_~max3~0 (select .cse6 (+ c_~A~0.offset .cse7))) (let ((.cse10 (select .cse6 (+ c_~A~0.offset .cse7 4)))) (let ((.cse8 (= c_~max1~0 c_~max2~0)) (.cse9 (< c_~max3~0 .cse10))) (and (or (and (or .cse8 (< c_~max2~0 c_~max3~0)) (or (= c_~max1~0 c_~max3~0) (<= c_~max3~0 c_~max2~0))) .cse9) (or (and (or .cse8 (< c_~max2~0 .cse10)) (or (= .cse10 c_~max1~0) (<= .cse10 c_~max2~0))) (not .cse9))))))))) is different from false [2022-03-15 19:25:47,055 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (< c_~max1~0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4)))))) (and (or .cse0 (and (forall ((v_ArrVal_584 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_584) c_~A~0.base)) (.cse6 (* 4 c_~M~0))) (let ((.cse2 (select .cse5 (+ c_~A~0.offset .cse6)))) (or (let ((.cse4 (select .cse5 (+ c_~A~0.offset .cse6 4)))) (let ((.cse1 (< .cse2 .cse4)) (.cse3 (= c_~max1~0 c_~max2~0))) (and (or .cse1 (and (or (<= .cse2 c_~max2~0) (= c_~max1~0 .cse2)) (or .cse3 (< c_~max2~0 .cse2)))) (or (not .cse1) (and (or .cse3 (< c_~max2~0 .cse4)) (or (= .cse4 c_~max1~0) (<= .cse4 c_~max2~0))))))) (not (< c_~max3~0 .cse2)))))) (forall ((v_ArrVal_584 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_584) c_~A~0.base)) (.cse8 (* 4 c_~M~0))) (or (< c_~max3~0 (select .cse7 (+ c_~A~0.offset .cse8))) (let ((.cse11 (select .cse7 (+ c_~A~0.offset .cse8 4)))) (let ((.cse9 (= c_~max1~0 c_~max2~0)) (.cse10 (< c_~max3~0 .cse11))) (and (or (and (or .cse9 (< c_~max2~0 c_~max3~0)) (or (= c_~max1~0 c_~max3~0) (<= c_~max3~0 c_~max2~0))) .cse10) (or (and (or .cse9 (< c_~max2~0 .cse11)) (or (= .cse11 c_~max1~0) (<= .cse11 c_~max2~0))) (not .cse10)))))))))) (or (not .cse0) (and (forall ((v_ArrVal_584 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_584) c_~A~0.base)) (.cse18 (* 4 c_~M~0))) (let ((.cse16 (select .cse17 (+ c_~A~0.offset .cse18)))) (or (let ((.cse14 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4)))) (.cse13 (select .cse17 (+ c_~A~0.offset .cse18 4)))) (let ((.cse15 (< .cse16 .cse13)) (.cse12 (= .cse14 c_~max2~0))) (and (or (and (or .cse12 (< c_~max2~0 .cse13)) (or (= .cse13 .cse14) (<= .cse13 c_~max2~0))) (not .cse15)) (or .cse15 (and (or .cse12 (< c_~max2~0 .cse16)) (or (<= .cse16 c_~max2~0) (= .cse14 .cse16))))))) (not (< c_~max3~0 .cse16)))))) (forall ((v_ArrVal_584 (Array Int Int))) (let ((.cse19 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_584) c_~A~0.base)) (.cse20 (* 4 c_~M~0))) (or (< c_~max3~0 (select .cse19 (+ c_~A~0.offset .cse20))) (let ((.cse23 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4)))) (.cse22 (select .cse19 (+ c_~A~0.offset .cse20 4)))) (let ((.cse24 (< c_~max3~0 .cse22)) (.cse21 (= .cse23 c_~max2~0))) (and (or (and (or .cse21 (< c_~max2~0 .cse22)) (or (= .cse22 .cse23) (<= .cse22 c_~max2~0))) (not .cse24)) (or .cse24 (and (or (<= c_~max3~0 c_~max2~0) (= .cse23 c_~max3~0)) (or (< c_~max2~0 c_~max3~0) .cse21))))))))))))) is different from false [2022-03-15 19:25:47,165 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:25:47,165 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1242 treesize of output 861 [2022-03-15 19:25:47,189 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:25:47,189 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 786 treesize of output 745 [2022-03-15 19:25:47,205 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:25:47,206 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 745 treesize of output 674 [2022-03-15 19:25:47,221 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:25:47,222 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 674 treesize of output 633 [2022-03-15 19:25:47,237 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:25:47,238 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 633 treesize of output 562 [2022-03-15 19:25:52,979 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 3 not checked. [2022-03-15 19:25:52,980 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032626923] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:25:52,980 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:25:52,980 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 11] total 36 [2022-03-15 19:25:52,980 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [201606862] [2022-03-15 19:25:52,980 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:25:52,983 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:25:53,008 INFO L252 McrAutomatonBuilder]: Finished intersection with 135 states and 300 transitions. [2022-03-15 19:25:53,008 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:26:12,276 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 40 new interpolants: [15836#(and (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (< 0 ~M~0) (<= 1 ~max3~0) (= ~max2~0 ~max1~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)))) (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (= ~max3~0 ~max1~0) (< 0 ~M~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)))) (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (< 0 ~M~0) (= ~max2~0 0)) (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (not (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)))) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< 0 ~M~0)) (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (not (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)))) (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< 0 ~M~0) (= ~max2~0 ~max1~0))), 15825#(and (or (= ~max3~0 ~max1~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= (+ 3 thread3Thread1of1ForFork1_~i~2) ~N~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4))) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))) (or (<= 1 ~max3~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 ~max1~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= (+ 3 thread3Thread1of1ForFork1_~i~2) ~N~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4))) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) ~max3~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 ~max1~0) (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4))) (<= (+ 3 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))) (or (< (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4))) (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) ~max3~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 ~max1~0) (<= (+ 3 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))) (or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 0) (<= (+ 3 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))) (or (< (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4))) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) ~max3~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= (+ 3 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) ~max3~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= (+ 3 thread3Thread1of1ForFork1_~i~2) ~N~0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4))) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4)) ~max3~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= (+ 3 thread3Thread1of1ForFork1_~i~2) ~N~0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4))) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4)) ~max3~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 ~max1~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4))) (<= (+ 3 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1)))), 15848#(and (or (< (+ (* thread3Thread1of1ForFork1_~i~2 4) 8) (* ~N~0 4)) (< 0 ~M~0) (= ~max2~0 0)) (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< (+ (* thread3Thread1of1ForFork1_~i~2 4) 8) (* ~N~0 4)) (< 0 ~M~0) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))) ~max3~0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))))) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 0) (< (+ (* thread3Thread1of1ForFork1_~i~2 4) 8) (* ~N~0 4)) (< 0 ~M~0) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))) (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))))) (or (< (+ (* thread3Thread1of1ForFork1_~i~2 4) 8) (* ~N~0 4)) (< 0 ~M~0) (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0)) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< (+ (* thread3Thread1of1ForFork1_~i~2 4) 8) (* ~N~0 4)) (< 0 ~M~0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))))) (or (< (+ (* thread3Thread1of1ForFork1_~i~2 4) 8) (* ~N~0 4)) (< 0 ~M~0) (<= 2 ~N~0)) (or (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< (+ (* thread3Thread1of1ForFork1_~i~2 4) 8) (* ~N~0 4)) (< 0 ~M~0) (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4)))) (= ~max2~0 ~max1~0)) (or (< (+ (* thread3Thread1of1ForFork1_~i~2 4) 8) (* ~N~0 4)) (< 0 ~M~0) (= ~max3~0 0))), 15855#(and (or (< 0 ~M~0) (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4)))) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 ~max1~0) (<= 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (< 0 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (<= 2 ~N~0) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (= ~A~0.offset 0) (< 0 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (< 0 ~M~0) (<= (select (select |#memory_int| ~A~0.base) 0) 0) (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4)))) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0)) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (< 0 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 0) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (< 0 ~M~0) (= ~max3~0 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (< 0 ~M~0) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))) ~max3~0) (< (+ (* ~M~0 4) 8) (* ~N~0 4)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4)))))), 15832#(and (or (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) 5 ~A~0.offset) (* ~N~0 4)) (= ~max3~0 ~max1~0) (<= (+ ~max3~0 1) (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) 5 ~A~0.offset) (* ~N~0 4)) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 0)) (or (= ~A~0.offset 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) 5 ~A~0.offset) (* ~N~0 4)) (<= 1 ~max3~0) (= ~max3~0 ~max2~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) 5 ~A~0.offset) (* ~N~0 4)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) ~max3~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0))), 15843#(and (or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (<= ~M~0 0) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (= ~A~0.offset 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (<= 2 ~N~0) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4)))) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 ~max1~0) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 0) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))) ~max3~0) (< (+ (* ~M~0 4) 8) (* ~N~0 4)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))))) (or (= ~max3~0 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1) (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4)))) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (< (+ (* ~M~0 4) 8) (* ~N~0 4)) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0))), 15841#(and (or (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) 5 ~A~0.offset) (* ~N~0 4)) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 0)) (or (= ~A~0.offset 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) 5 ~A~0.offset) (* ~N~0 4)) (= ~max3~0 ~max1~0) (<= (+ ~max3~0 1) (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) 5 ~A~0.offset) (* ~N~0 4)) (<= 1 ~max3~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max3~0 ~max2~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) 5 ~A~0.offset) (* ~N~0 4)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) ~max3~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0))), 15830#(and (or (<= 1 ~max3~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 ~max1~0)) (or (= ~max3~0 ~max1~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 0))), 15824#(and (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 0)) (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (not (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)))) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (= ~max3~0 ~max1~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)))) (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= 1 ~max3~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 ~max1~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)))) (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (not (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)))) (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 ~max1~0))), 15821#(and (or (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4)) ~max3~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (<= 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4))) (<= (+ 3 ~M~0) ~N~0) (= ~max2~0 ~max1~0) (<= ~N~0 (+ ~M~0 1))) (or (<= (+ 3 ~M~0) ~N~0) (= ~max2~0 ~max1~0) (<= 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max3~0) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4))) (<= ~N~0 (+ ~M~0 1))) (or (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4))) (<= (+ 3 ~M~0) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max3~0) (<= ~N~0 (+ ~M~0 1)) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4)) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (<= 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4))) (<= (+ 3 ~M~0) ~N~0) (= ~max2~0 ~max1~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max3~0) (<= ~N~0 (+ ~M~0 1)) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4)) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (= ~max3~0 ~max1~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (<= (+ 3 ~M~0) ~N~0) (<= ~N~0 (+ ~M~0 1)) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4)))) (or (<= (+ 3 ~M~0) ~N~0) (= ~max2~0 0) (<= ~N~0 (+ ~M~0 1))) (or (<= 1 ~max3~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (<= (+ 3 ~M~0) ~N~0) (= ~max2~0 ~max1~0) (<= ~N~0 (+ ~M~0 1)) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4)))) (or (<= (+ 3 ~M~0) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max3~0) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4))) (<= ~N~0 (+ ~M~0 1)) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4)) ~max3~0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4))) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (<= (+ 3 ~M~0) ~N~0) (<= ~N~0 (+ ~M~0 1)))), 15849#(and (or (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4))) (< 0 ~M~0) (<= (+ 3 ~M~0) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max3~0) (<= ~N~0 (+ ~M~0 1)) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4)) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4)) ~max3~0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4))) (< 0 ~M~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (<= (+ 3 ~M~0) ~N~0) (<= ~N~0 (+ ~M~0 1))) (or (< 0 ~M~0) (<= 1 ~max3~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (<= (+ 3 ~M~0) ~N~0) (= ~max2~0 ~max1~0) (<= ~N~0 (+ ~M~0 1)) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4)))) (or (< 0 ~M~0) (<= (+ 3 ~M~0) ~N~0) (= ~max2~0 0) (<= ~N~0 (+ ~M~0 1))) (or (< 0 ~M~0) (<= (+ 3 ~M~0) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max3~0) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4))) (<= ~N~0 (+ ~M~0 1)) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4)) ~max3~0) (< 0 ~M~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (<= 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4))) (<= (+ 3 ~M~0) ~N~0) (= ~max2~0 ~max1~0) (<= ~N~0 (+ ~M~0 1))) (or (= ~max3~0 ~max1~0) (< 0 ~M~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (<= (+ 3 ~M~0) ~N~0) (<= ~N~0 (+ ~M~0 1)) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4)))) (or (< 0 ~M~0) (<= (+ 3 ~M~0) ~N~0) (= ~max2~0 ~max1~0) (<= 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max3~0) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4))) (<= ~N~0 (+ ~M~0 1))) (or (< 0 ~M~0) (<= 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4))) (<= (+ 3 ~M~0) ~N~0) (= ~max2~0 ~max1~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max3~0) (<= ~N~0 (+ ~M~0 1)) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4)) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))))), 15854#(and (or (< (+ (* thread3Thread1of1ForFork1_~i~2 4) 8) (* ~N~0 4)) (< 0 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (<= 2 ~N~0)) (or (< (+ (* thread3Thread1of1ForFork1_~i~2 4) 8) (* ~N~0 4)) (< 0 ~M~0) (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 0) (< (+ (* thread3Thread1of1ForFork1_~i~2 4) 8) (* ~N~0 4)) (< 0 ~M~0) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))) (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))))) (or (< (+ (* thread3Thread1of1ForFork1_~i~2 4) 8) (* ~N~0 4)) (< 0 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 0)) (or (= ~A~0.offset 0) (< 0 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< (+ (* thread3Thread1of1ForFork1_~i~2 4) 8) (* ~N~0 4)) (< 0 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))) ~max3~0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))))) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< (+ (* thread3Thread1of1ForFork1_~i~2 4) 8) (* ~N~0 4)) (< 0 ~M~0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4)))) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< (+ (* thread3Thread1of1ForFork1_~i~2 4) 8) (* ~N~0 4)) (< 0 ~M~0) (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4)))) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 ~max1~0)) (or (< (+ (* thread3Thread1of1ForFork1_~i~2 4) 8) (* ~N~0 4)) (< 0 ~M~0) (= ~max3~0 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0))), 15833#(and (or (< (+ (* thread3Thread1of1ForFork1_~i~2 4) 8) (* ~N~0 4)) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))) (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))) ~max3~0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))))) (or (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< (+ (* thread3Thread1of1ForFork1_~i~2 4) 8) (* ~N~0 4)) (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4)))) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 ~max1~0)) (or (= ~A~0.offset 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (< (+ (* thread3Thread1of1ForFork1_~i~2 4) 8) (* ~N~0 4)) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (<= 2 ~N~0)) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< (+ (* thread3Thread1of1ForFork1_~i~2 4) 8) (* ~N~0 4)) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4)))) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (< (+ (* thread3Thread1of1ForFork1_~i~2 4) 8) (* ~N~0 4)) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 0)) (or (< (+ (* thread3Thread1of1ForFork1_~i~2 4) 8) (* ~N~0 4)) (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (< (+ (* thread3Thread1of1ForFork1_~i~2 4) 8) (* ~N~0 4)) (= ~max3~0 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0))), 15850#(and (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (< 0 ~M~0) (<= 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))) ~max3~0) (< (+ (* ~M~0 4) 8) (* ~N~0 4)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))))) (or (< 0 ~M~0) (<= (select (select |#memory_int| ~A~0.base) 0) 0) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))) (select (select |#memory_int| ~A~0.base) 0)) (< (+ (* ~M~0 4) 8) (* ~N~0 4)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))))) (or (< 0 ~M~0) (<= (select (select |#memory_int| ~A~0.base) 0) 0) (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4)))) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0)) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (< 0 ~M~0) (= ~max3~0 0) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (< 0 ~M~0) (<= 2 ~N~0) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (< 0 ~M~0) (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4)))) (= ~max2~0 ~max1~0) (<= 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (< 0 ~M~0) (= ~max2~0 0) (< (+ (* ~M~0 4) 8) (* ~N~0 4)))), 15834#(and (or (< 0 ~M~0) (= ~max2~0 0)) (or (< 0 ~M~0) (<= 1 ~max3~0) (= ~max2~0 ~max1~0)) (or (= ~max3~0 ~max1~0) (< 0 ~M~0))), 15837#(and (or (= ~max3~0 ~max1~0) (< 0 ~M~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= (+ 3 thread3Thread1of1ForFork1_~i~2) ~N~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4))) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))) (or (< (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4))) (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< 0 ~M~0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) ~max3~0) (= ~max2~0 ~max1~0) (<= (+ 3 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4)) ~max3~0) (< 0 ~M~0) (= ~max2~0 ~max1~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4))) (<= (+ 3 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))) (or (< 0 ~M~0) (= ~max2~0 0) (<= (+ 3 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))) (or (< (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4))) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< 0 ~M~0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) ~max3~0) (<= (+ 3 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))) (or (< 0 ~M~0) (<= 1 ~max3~0) (= ~max2~0 ~max1~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= (+ 3 thread3Thread1of1ForFork1_~i~2) ~N~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4))) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))) (or (< 0 ~M~0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) ~max3~0) (= ~max2~0 ~max1~0) (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4))) (<= (+ 3 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4)) ~max3~0) (< 0 ~M~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= (+ 3 thread3Thread1of1ForFork1_~i~2) ~N~0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4))) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))) (or (< 0 ~M~0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) ~max3~0) (<= (+ 3 thread3Thread1of1ForFork1_~i~2) ~N~0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4))) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1)))), 15835#(and (or (< 0 ~M~0) (< thread3Thread1of1ForFork1_~i~2 ~N~0) (= ~max2~0 0)) (or (= ~max3~0 ~max1~0) (< 0 ~M~0) (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (or (< 0 ~M~0) (<= 1 ~max3~0) (< thread3Thread1of1ForFork1_~i~2 ~N~0) (= ~max2~0 ~max1~0))), 15851#(and (or (= ~max3~0 ~max1~0) (< 0 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (< 0 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 0)) (or (< 0 ~M~0) (<= 1 ~max3~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 ~max1~0))), 15847#(and (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) 5 ~A~0.offset) (* ~N~0 4)) (< 0 ~M~0) (= ~max2~0 0)) (or (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) 5 ~A~0.offset) (* ~N~0 4)) (= ~max3~0 ~max1~0) (< 0 ~M~0) (<= (+ ~max3~0 1) (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)))) (or (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) 5 ~A~0.offset) (* ~N~0 4)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< 0 ~M~0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) ~max3~0)) (or (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) 5 ~A~0.offset) (* ~N~0 4)) (< 0 ~M~0) (<= 1 ~max3~0) (= ~max3~0 ~max2~0))), 15838#(and (or (<= (select (select |#memory_int| ~A~0.base) 0) 0) (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4)))) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0)) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (< thread1Thread1of1ForFork2_~i~0 ~N~0) (<= 2 ~N~0) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (= ~max3~0 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (= ~A~0.offset 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4)))) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 ~max1~0) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (< thread1Thread1of1ForFork2_~i~0 ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))) (select (select |#memory_int| ~A~0.base) 0)) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))) ~max3~0) (< (+ (* ~M~0 4) 8) (* ~N~0 4)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))))) (or (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 0) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (< thread1Thread1of1ForFork2_~i~0 ~N~0) (<= ~M~0 0) (< (+ (* ~M~0 4) 8) (* ~N~0 4)))), 15827#(and (or (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) 5 ~A~0.offset) (* ~N~0 4)) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 0)) (or (= ~A~0.offset 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) 5 ~A~0.offset) (* ~N~0 4)) (<= 1 ~max3~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max3~0 ~max2~0)) (or (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) 5 ~A~0.offset) (* ~N~0 4)) (= ~max3~0 ~max1~0) (<= (+ ~max3~0 1) (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) 5 ~A~0.offset) (* ~N~0 4)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) ~max3~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0))), 15856#(and (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (< 0 ~M~0) (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4)))) (= ~max2~0 ~max1~0) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< 0 ~M~0) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (< 0 ~M~0) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))) (select (select |#memory_int| ~A~0.base) 0)) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))) ~max3~0) (< (+ (* ~M~0 4) 8) (* ~N~0 4)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))))) (or (< 0 ~M~0) (<= (select (select |#memory_int| ~A~0.base) 0) 0) (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4)))) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0)) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (< 0 ~M~0) (= ~max3~0 0) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (< 0 ~M~0) (<= 2 ~N~0) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (< 0 ~M~0) (= ~max2~0 0) (< (+ (* ~M~0 4) 8) (* ~N~0 4)))), 15819#(and (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (not (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)))) (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (= ~max2~0 ~max1~0)) (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= 1 ~max3~0) (= ~max2~0 ~max1~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)))) (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (= ~max3~0 ~max1~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)))) (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (= ~max2~0 0)) (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (not (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)))) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))))), 15839#(and (or (<= 1 ~max3~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 ~max1~0)) (or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 0)) (or (= ~max3~0 ~max1~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0))), 15853#(and (or (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) 5 ~A~0.offset) (* ~N~0 4)) (= ~max3~0 ~max1~0) (< 0 ~M~0) (<= (+ ~max3~0 1) (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) 5 ~A~0.offset) (* ~N~0 4)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< 0 ~M~0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) ~max3~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) 5 ~A~0.offset) (* ~N~0 4)) (< 0 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 0)) (or (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) 5 ~A~0.offset) (* ~N~0 4)) (< 0 ~M~0) (<= 1 ~max3~0) (= ~max3~0 ~max2~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (= ~A~0.offset 0) (< 0 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0))), 15826#(and (or (<= (+ 3 ~M~0) ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max3~0) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4))) (<= ~N~0 (+ ~M~0 1)) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4)) ~max3~0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4))) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (<= (+ 3 ~M~0) ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= ~N~0 (+ ~M~0 1))) (or (<= (+ 3 ~M~0) ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 ~max1~0) (<= 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max3~0) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4))) (<= ~N~0 (+ ~M~0 1))) (or (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4)) ~max3~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (<= 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4))) (<= (+ 3 ~M~0) ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 ~max1~0) (<= ~N~0 (+ ~M~0 1))) (or (= ~max3~0 ~max1~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (<= (+ 3 ~M~0) ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= ~N~0 (+ ~M~0 1)) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4)))) (or (<= 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4))) (<= (+ 3 ~M~0) ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 ~max1~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max3~0) (<= ~N~0 (+ ~M~0 1)) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4)) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (<= 1 ~max3~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (<= (+ 3 ~M~0) ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 ~max1~0) (<= ~N~0 (+ ~M~0 1)) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4)))) (or (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4))) (<= (+ 3 ~M~0) ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max3~0) (<= ~N~0 (+ ~M~0 1)) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4)) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (<= (+ 3 ~M~0) ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 0) (<= ~N~0 (+ ~M~0 1)))), 15820#(and (or (<= 1 ~max3~0) (= ~max2~0 ~max1~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= (+ 3 thread3Thread1of1ForFork1_~i~2) ~N~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4))) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))) (or (< (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4))) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) ~max3~0) (<= (+ 3 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) ~max3~0) (<= (+ 3 thread3Thread1of1ForFork1_~i~2) ~N~0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4))) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))) (or (= ~max3~0 ~max1~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= (+ 3 thread3Thread1of1ForFork1_~i~2) ~N~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4))) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))) (or (= ~max2~0 0) (<= (+ 3 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) ~max3~0) (= ~max2~0 ~max1~0) (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4))) (<= (+ 3 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4)) ~max3~0) (= ~max2~0 ~max1~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4))) (<= (+ 3 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4)) ~max3~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= (+ 3 thread3Thread1of1ForFork1_~i~2) ~N~0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4))) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))) (or (< (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4))) (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) ~max3~0) (= ~max2~0 ~max1~0) (<= (+ 3 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1)))), 15857#(and (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (<= (* ~N~0 4) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~A~0.offset)) (< 0 ~M~0) (<= 2 ~N~0) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (<= (* ~N~0 4) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~A~0.offset)) (< 0 ~M~0) (= ~max2~0 ~max1~0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0)) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (<= (* ~N~0 4) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~A~0.offset)) (< 0 ~M~0) (<= (select (select |#memory_int| ~A~0.base) 0) 0) (<= 1 ~max1~0) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (= (* ~N~0 4) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4)) (<= (* ~N~0 4) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~A~0.offset)) (< 0 ~M~0) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (* ~N~0 4) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~A~0.offset)) (< 0 ~M~0) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (<= (+ (* ~M~0 4) 8) (* ~N~0 4)) (< 0 ~M~0)) (or (<= (* ~N~0 4) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~A~0.offset)) (< 0 ~M~0) (= ~max2~0 0) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (<= (* ~N~0 4) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~A~0.offset)) (< 0 ~M~0) (= ~max3~0 0) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (<= (* ~N~0 4) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~A~0.offset)) (< 0 ~M~0) (= ~max2~0 ~max1~0) (<= 1 ~max1~0) (< (+ (* ~M~0 4) 8) (* ~N~0 4)))), 15844#(and (or (<= (select (select |#memory_int| ~A~0.base) 0) 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4)))) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0)) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= 2 ~N~0) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 0) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (= ~A~0.offset 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (= ~max3~0 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))) (select (select |#memory_int| ~A~0.base) 0)) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))) ~max3~0) (< (+ (* ~M~0 4) 8) (* ~N~0 4)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))))) (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4)))) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 ~max1~0) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= ~M~0 0) (< (+ (* ~M~0 4) 8) (* ~N~0 4)))), 15840#(and (or (<= 1 ~max3~0) (< thread3Thread1of1ForFork1_~i~2 ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 ~max1~0)) (or (= ~max3~0 ~max1~0) (< thread3Thread1of1ForFork1_~i~2 ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (< thread3Thread1of1ForFork1_~i~2 ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 0))), 15823#(and (or (= ~max3~0 ~max1~0) (< thread3Thread1of1ForFork1_~i~2 ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (< thread3Thread1of1ForFork1_~i~2 ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 0)) (or (<= 1 ~max3~0) (< thread3Thread1of1ForFork1_~i~2 ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 ~max1~0))), 15829#(and (or (<= (select (select |#memory_int| ~A~0.base) 0) 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4)))) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0)) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= 2 ~N~0) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 0) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (= ~A~0.offset 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (= ~max3~0 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (<= (select (select |#memory_int| ~A~0.base) 0) 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))) (select (select |#memory_int| ~A~0.base) 0)) (< (+ (* ~M~0 4) 8) (* ~N~0 4)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))))) (or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))) ~max3~0) (< (+ (* ~M~0 4) 8) (* ~N~0 4)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))))) (or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= (+ ~A~0.offset (* ~M~0 4)) 0) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4)))) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 ~max1~0) (<= 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (< (+ (* ~M~0 4) 8) (* ~N~0 4)))), 15858#(and (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (< (* ~N~0 4) 8) (< 0 ~M~0) (= ~max3~0 ~max2~0) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (< (* ~N~0 4) 8) (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< 0 ~M~0) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (< (* ~N~0 4) 8) (< 0 ~M~0) (= ~max1~0 0) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (< 0 ~M~0) (= thread1Thread1of1ForFork2_~i~0 0) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (<= (+ (* ~M~0 4) 8) (* ~N~0 4)) (< 0 ~M~0)) (or (< (* ~N~0 4) 8) (< 0 ~M~0) (= ~max2~0 ~max1~0) (< (+ (* ~M~0 4) 8) (* ~N~0 4)))), 15842#(and (or (< (+ (* thread3Thread1of1ForFork1_~i~2 4) 8) (* ~N~0 4)) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))) (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))) ~max3~0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))))) (or (< (+ (* thread3Thread1of1ForFork1_~i~2 4) 8) (* ~N~0 4)) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 0)) (or (< (+ (* thread3Thread1of1ForFork1_~i~2 4) 8) (* ~N~0 4)) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (<= 2 ~N~0)) (or (= ~A~0.offset 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< (+ (* thread3Thread1of1ForFork1_~i~2 4) 8) (* ~N~0 4)) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4)))) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< (+ (* thread3Thread1of1ForFork1_~i~2 4) 8) (* ~N~0 4)) (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4)))) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 ~max1~0)) (or (< (+ (* thread3Thread1of1ForFork1_~i~2 4) 8) (* ~N~0 4)) (= ~max3~0 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (< (+ (* thread3Thread1of1ForFork1_~i~2 4) 8) (* ~N~0 4)) (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0))), 15828#(and (or (< (+ (* thread3Thread1of1ForFork1_~i~2 4) 8) (* ~N~0 4)) (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< (+ (* thread3Thread1of1ForFork1_~i~2 4) 8) (* ~N~0 4)) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4)))) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (< (+ (* thread3Thread1of1ForFork1_~i~2 4) 8) (* ~N~0 4)) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= 2 ~N~0)) (or (< (+ (* thread3Thread1of1ForFork1_~i~2 4) 8) (* ~N~0 4)) (= ~max3~0 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (= ~A~0.offset 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< (+ (* thread3Thread1of1ForFork1_~i~2 4) 8) (* ~N~0 4)) (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4)))) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 ~max1~0)) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 0) (< (+ (* thread3Thread1of1ForFork1_~i~2 4) 8) (* ~N~0 4)) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))) (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))))) (or (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< (+ (* thread3Thread1of1ForFork1_~i~2 4) 8) (* ~N~0 4)) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))) ~max3~0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))))) (or (< (+ (* thread3Thread1of1ForFork1_~i~2 4) 8) (* ~N~0 4)) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 0))), 15852#(and (or (= ~max3~0 ~max1~0) (< 0 ~M~0) (< thread3Thread1of1ForFork1_~i~2 ~N~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (< 0 ~M~0) (< thread3Thread1of1ForFork1_~i~2 ~N~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 0)) (or (< 0 ~M~0) (<= 1 ~max3~0) (< thread3Thread1of1ForFork1_~i~2 ~N~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 ~max1~0))), 15831#(and (or (= ~max3~0 ~max1~0) (< thread3Thread1of1ForFork1_~i~2 ~N~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (<= 1 ~max3~0) (< thread3Thread1of1ForFork1_~i~2 ~N~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 ~max1~0)) (or (< thread3Thread1of1ForFork1_~i~2 ~N~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~max2~0 0))), 15845#(and (or (<= (+ (* ~M~0 4) 8) (* ~N~0 4)) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (<= (* ~N~0 4) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~A~0.offset)) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 ~max1~0) (<= 1 ~max1~0) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (<= (* ~N~0 4) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~A~0.offset)) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 ~max1~0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0)) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (= (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset) (+ (* ~N~0 4) (- 4))) (<= (* ~N~0 4) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~A~0.offset)) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (<= (* ~N~0 4) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~A~0.offset)) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= 2 ~N~0) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (<= (* ~N~0 4) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~A~0.offset)) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 0) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (= ~A~0.offset 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (* ~N~0 4) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~A~0.offset)) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (<= (* ~N~0 4) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~A~0.offset)) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= ~M~0 0) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (<= (* ~N~0 4) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) 0) 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= 1 ~max1~0) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (<= (* ~N~0 4) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~A~0.offset)) (= ~max3~0 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< (+ (* ~M~0 4) 8) (* ~N~0 4)))), 15846#(and (or (<= (+ (* ~M~0 4) 8) (* ~N~0 4)) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (< (* ~N~0 4) 8) (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (= ~A~0.offset 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (< (* ~N~0 4) 8) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 ~max1~0) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (< (* ~N~0 4) 8) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max3~0 ~max2~0) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= thread1Thread1of1ForFork2_~i~0 0) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (< (* ~N~0 4) 8) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max1~0 0) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= ~M~0 0) (< (+ (* ~M~0 4) 8) (* ~N~0 4)))), 15822#(and (or (= ~max3~0 ~max1~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (<= 1 ~max3~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 ~max1~0)) (or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 0)))] [2022-03-15 19:26:12,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-03-15 19:26:12,277 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:26:12,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-03-15 19:26:12,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=430, Invalid=5276, Unknown=2, NotChecked=298, Total=6006 [2022-03-15 19:26:12,280 INFO L87 Difference]: Start difference. First operand 319 states and 1034 transitions. Second operand has 56 states, 55 states have (on average 3.3636363636363638) internal successors, (185), 55 states have internal predecessors, (185), 0 states have call successors, (0), 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-03-15 19:26:40,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:26:40,150 INFO L93 Difference]: Finished difference Result 1233 states and 4014 transitions. [2022-03-15 19:26:40,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2022-03-15 19:26:40,150 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 3.3636363636363638) internal successors, (185), 55 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 19:26:40,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:26:40,157 INFO L225 Difference]: With dead ends: 1233 [2022-03-15 19:26:40,157 INFO L226 Difference]: Without dead ends: 1226 [2022-03-15 19:26:40,163 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 86 SyntacticMatches, 8 SemanticMatches, 171 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 8524 ImplicationChecksByTransitivity, 27.8s TimeCoverageRelationStatistics Valid=3116, Invalid=25960, Unknown=2, NotChecked=678, Total=29756 [2022-03-15 19:26:40,165 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 764 mSDsluCounter, 1380 mSDsCounter, 0 mSdLazyCounter, 6565 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 764 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 6833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 6565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:26:40,165 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [764 Valid, 394 Invalid, 6833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 6565 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-03-15 19:26:40,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2022-03-15 19:26:40,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 416. [2022-03-15 19:26:40,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 415 states have (on average 3.3349397590361445) internal successors, (1384), 415 states have internal predecessors, (1384), 0 states have call successors, (0), 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-03-15 19:26:40,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 1384 transitions. [2022-03-15 19:26:40,185 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 1384 transitions. Word has length 26 [2022-03-15 19:26:40,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:26:40,186 INFO L470 AbstractCegarLoop]: Abstraction has 416 states and 1384 transitions. [2022-03-15 19:26:40,187 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 3.3636363636363638) internal successors, (185), 55 states have internal predecessors, (185), 0 states have call successors, (0), 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-03-15 19:26:40,187 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 1384 transitions. [2022-03-15 19:26:40,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:26:40,188 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:26:40,188 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:26:40,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-15 19:26:40,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-15 19:26:40,407 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:26:40,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:26:40,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1240404193, now seen corresponding path program 9 times [2022-03-15 19:26:40,408 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:26:40,408 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329495956] [2022-03-15 19:26:40,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:26:40,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:26:40,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:26:41,344 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:26:41,344 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:26:41,344 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329495956] [2022-03-15 19:26:41,345 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329495956] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:26:41,345 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82064869] [2022-03-15 19:26:41,345 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:26:41,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:26:41,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:26:41,346 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:26:41,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-03-15 19:26:41,451 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 19:26:41,452 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:26:41,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 46 conjunts are in the unsatisfiable core [2022-03-15 19:26:41,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:26:41,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:26:41,783 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2022-03-15 19:26:42,229 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:26:42,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:26:42,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:26:42,231 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:26:42,236 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:26:42,236 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 164 treesize of output 84 [2022-03-15 19:26:42,402 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:26:42,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:26:44,094 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_633 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_633) c_~A~0.base))) (or (let ((.cse8 (* 4 c_~M~0))) (let ((.cse3 (select .cse7 (+ c_~A~0.offset .cse8))) (.cse5 (select .cse7 (+ c_~A~0.offset .cse8 4))) (.cse2 (= c_~max1~0 c_~max2~0))) (let ((.cse4 (and (or (= c_~max1~0 .cse5) (<= .cse5 c_~max2~0)) (or (< c_~max2~0 .cse5) .cse2))) (.cse0 (< c_~max3~0 .cse3))) (and (or (not .cse0) (let ((.cse1 (< .cse3 .cse5))) (and (or .cse1 (and (or .cse2 (< c_~max2~0 .cse3)) (or (= c_~max1~0 .cse3) (<= .cse3 c_~max2~0)))) (or .cse4 (not .cse1))))) (or (let ((.cse6 (< c_~max3~0 .cse5))) (and (or .cse6 (and (or .cse2 (< c_~max2~0 c_~max3~0)) (or (= c_~max1~0 c_~max3~0) (<= c_~max3~0 c_~max2~0)))) (or .cse4 (not .cse6)))) .cse0))))) (< c_~max1~0 (select .cse7 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))))))) (forall ((v_ArrVal_633 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_633) c_~A~0.base))) (let ((.cse9 (select .cse17 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))))) (or (not (< c_~max1~0 .cse9)) (let ((.cse18 (* 4 c_~M~0))) (let ((.cse11 (= c_~max2~0 .cse9)) (.cse14 (select .cse17 (+ c_~A~0.offset .cse18 4))) (.cse12 (select .cse17 (+ c_~A~0.offset .cse18)))) (let ((.cse15 (< c_~max3~0 .cse12)) (.cse13 (and (or .cse11 (< c_~max2~0 .cse14)) (or (<= .cse14 c_~max2~0) (= .cse14 .cse9))))) (and (or (let ((.cse10 (< .cse12 .cse14))) (and (or .cse10 (and (or .cse11 (< c_~max2~0 .cse12)) (or (<= .cse12 c_~max2~0) (= .cse12 .cse9)))) (or .cse13 (not .cse10)))) (not .cse15)) (or .cse15 (let ((.cse16 (< c_~max3~0 .cse14))) (and (or (not .cse16) .cse13) (or .cse16 (and (or .cse11 (< c_~max2~0 c_~max3~0)) (or (= c_~max3~0 .cse9) (<= c_~max3~0 c_~max2~0)))))))))))))))) is different from false [2022-03-15 19:26:44,204 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:26:44,205 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1371 treesize of output 1017 [2022-03-15 19:26:44,235 INFO L353 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2022-03-15 19:26:44,235 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 942 treesize of output 794 [2022-03-15 19:26:44,266 INFO L353 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2022-03-15 19:26:44,266 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 767 treesize of output 675 [2022-03-15 19:26:53,810 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:26:53,811 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82064869] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:26:53,811 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:26:53,811 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 11] total 38 [2022-03-15 19:26:53,811 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1824376708] [2022-03-15 19:26:53,811 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:26:53,814 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:26:53,842 INFO L252 McrAutomatonBuilder]: Finished intersection with 160 states and 380 transitions. [2022-03-15 19:26:53,842 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:27:20,010 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 36 new interpolants: [18334#(and (or (< 0 ~M~0) (<= 1 ~max3~0) (< thread3Thread1of1ForFork1_~i~2 ~N~0) (<= ~N~0 thread1Thread1of1ForFork2_~i~0) (= ~max2~0 ~max1~0) (< ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (< 0 ~M~0) (< thread3Thread1of1ForFork1_~i~2 ~N~0) (= ~max2~0 0) (<= ~N~0 thread1Thread1of1ForFork2_~i~0)) (or (= ~max2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))) (< 0 ~M~0) (<= 1 ~max3~0) (< thread3Thread1of1ForFork1_~i~2 ~N~0) (<= ~N~0 thread1Thread1of1ForFork2_~i~0) (not (< ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))))) (or (< 0 ~M~0) (< thread3Thread1of1ForFork1_~i~2 ~N~0) (<= ~N~0 thread1Thread1of1ForFork2_~i~0) (not (< ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (= ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))) (<= ~max3~0 0)) (or (= ~max3~0 ~max1~0) (< 0 ~M~0) (< thread3Thread1of1ForFork1_~i~2 ~N~0) (<= ~N~0 thread1Thread1of1ForFork2_~i~0) (< ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))) (<= ~max3~0 0))), 18337#(and (or (<= (* ~N~0 4) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~A~0.offset)) (< 0 ~M~0) (= ~max3~0 0)) (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (<= (* ~N~0 4) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~A~0.offset)) (< 0 ~M~0) (<= 2 ~N~0) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (= (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset) (+ (* ~N~0 4) (- 4))) (<= (* ~N~0 4) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~A~0.offset)) (< 0 ~M~0) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (<= (* ~N~0 4) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~A~0.offset)) (< 0 ~M~0) (= ~max2~0 0) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (<= (* ~N~0 4) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~A~0.offset)) (< 0 ~M~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 0) (< (+ (* ~M~0 4) 8) (* ~N~0 4)) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (<= (* ~N~0 4) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~A~0.offset)) (< 0 ~M~0) (= ~max1~0 0) (<= 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (< (+ (* ~M~0 4) 8) (* ~N~0 4)))), 18319#(and (or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= 2 ~N~0) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (= ~max3~0 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1) (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4)))) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< (+ (* ~M~0 4) 8) (* ~N~0 4)) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 0) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (= ~A~0.offset 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 0) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< (+ (* ~M~0 4) 8) (* ~N~0 4)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))))) (or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= (+ ~A~0.offset (* ~M~0 4)) 0) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))) 0) (<= 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (< (+ (* ~M~0 4) 8) (* ~N~0 4)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))))) (or (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4)))) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 ~max1~0) (<= 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (< (+ (* ~M~0 4) 8) (* ~N~0 4)))), 18321#(and (or (< thread3Thread1of1ForFork1_~i~2 ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= ~N~0 thread1Thread1of1ForFork2_~i~0) (not (< ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (= ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))) (<= ~max3~0 0)) (or (= ~max2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))) (<= 1 ~max3~0) (< thread3Thread1of1ForFork1_~i~2 ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= ~N~0 thread1Thread1of1ForFork2_~i~0) (not (< ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))))) (or (= ~max3~0 ~max1~0) (< thread3Thread1of1ForFork1_~i~2 ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= ~N~0 thread1Thread1of1ForFork2_~i~0) (< ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))) (<= ~max3~0 0)) (or (<= 1 ~max3~0) (< thread3Thread1of1ForFork1_~i~2 ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= ~N~0 thread1Thread1of1ForFork2_~i~0) (= ~max2~0 ~max1~0) (< ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (< thread3Thread1of1ForFork1_~i~2 ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 0) (<= ~N~0 thread1Thread1of1ForFork2_~i~0))), 18313#(and (or (= ~max3~0 ~max1~0) (< thread3Thread1of1ForFork1_~i~2 ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= ~max3~0 0)) (or (< thread3Thread1of1ForFork1_~i~2 ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 0)) (or (<= 1 ~max3~0) (< thread3Thread1of1ForFork1_~i~2 ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 ~max1~0))), 18328#(and (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 0) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (not (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)))) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< 0 ~M~0)) (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (< 0 ~M~0) (<= 1 ~max3~0) (= ~max2~0 ~max1~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)))) (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (= ~max3~0 ~max1~0) (< 0 ~M~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= ~max3~0 0)) (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (< 0 ~M~0) (= ~max2~0 0)) (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (not (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)))) (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< 0 ~M~0) (= ~max2~0 ~max1~0))), 18316#(and (or (= ~max3~0 ~max1~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (<= (+ 3 ~M~0) ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= ~N~0 (+ ~M~0 1)) (<= ~max3~0 0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4)))) (or (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 0) (<= (+ 3 ~M~0) ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max3~0) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4))) (<= ~N~0 (+ ~M~0 1)) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4))) (<= (+ 3 ~M~0) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4)) 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max3~0) (<= ~N~0 (+ ~M~0 1)) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4)) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (<= (+ 3 ~M~0) ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 ~max1~0) (<= 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max3~0) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4))) (<= ~N~0 (+ ~M~0 1))) (or (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4)) ~max3~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (<= 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4))) (<= (+ 3 ~M~0) ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 ~max1~0) (<= ~N~0 (+ ~M~0 1))) (or (<= 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4))) (<= (+ 3 ~M~0) ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 ~max1~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max3~0) (<= ~N~0 (+ ~M~0 1)) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4)) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (<= 1 ~max3~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (<= (+ 3 ~M~0) ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 ~max1~0) (<= ~N~0 (+ ~M~0 1)) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4)))) (or (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4)) ~max3~0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4))) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (<= (+ 3 ~M~0) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4)) 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= ~N~0 (+ ~M~0 1))) (or (<= (+ 3 ~M~0) ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 0) (<= ~N~0 (+ ~M~0 1)))), 18308#(and (or (= ~max3~0 ~max1~0) (<= ~N~0 thread1Thread1of1ForFork2_~i~0) (< ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))) (<= ~max3~0 0)) (or (<= ~N~0 thread1Thread1of1ForFork2_~i~0) (not (< ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (= ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))) (<= ~max3~0 0)) (or (= ~max2~0 0) (<= ~N~0 thread1Thread1of1ForFork2_~i~0)) (or (= ~max2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))) (<= 1 ~max3~0) (<= ~N~0 thread1Thread1of1ForFork2_~i~0) (not (< ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))))) (or (<= 1 ~max3~0) (<= ~N~0 thread1Thread1of1ForFork2_~i~0) (= ~max2~0 ~max1~0) (< ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))))), 18339#(and (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (< (* ~N~0 4) 8) (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< 0 ~M~0) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (< (* ~N~0 4) 8) (< 0 ~M~0) (= ~max1~0 0) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (< 0 ~M~0) (= thread1Thread1of1ForFork2_~i~0 0)) (or (< (* ~N~0 4) 8) (< 0 ~M~0) (= ~max2~0 ~max1~0) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (< 0 ~M~0) (<= (* ~N~0 4) 8)) (or (< (* ~N~0 4) 8) (< 0 ~M~0) (= ~max3~0 0))), 18312#(and (= ~A~0.offset 0) (or (<= 2 ~N~0) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1) (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4)))) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 0) (< (+ (* ~M~0 4) 8) (* ~N~0 4)) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))) 0) (<= 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (< (+ (* ~M~0 4) 8) (* ~N~0 4)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))))) (= ~max3~0 0) (or (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4)))) (= ~max2~0 ~max1~0) (<= 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 0) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (< (+ (* ~M~0 4) 8) (* ~N~0 4)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))))) (or (= ~max2~0 0) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (<= (+ ~A~0.offset (* ~M~0 4)) 0) (< (+ (* ~M~0 4) 8) (* ~N~0 4)))), 18324#(and (or (<= (* ~N~0 4) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~A~0.offset)) (= ~max3~0 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (<= (* ~N~0 4) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~A~0.offset)) (< (+ (* thread3Thread1of1ForFork1_~i~2 4) 8) (* ~N~0 4)) (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (= ~A~0.offset 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (= (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset) (+ (* ~N~0 4) (- 4))) (<= (* ~N~0 4) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~A~0.offset)) (< (+ (* thread3Thread1of1ForFork1_~i~2 4) 8) (* ~N~0 4)) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (<= (* ~N~0 4) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~A~0.offset)) (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< (+ (* thread3Thread1of1ForFork1_~i~2 4) 8) (* ~N~0 4)) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max1~0 0)) (or (<= (* ~N~0 4) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~A~0.offset)) (< (+ (* thread3Thread1of1ForFork1_~i~2 4) 8) (* ~N~0 4)) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 0)) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= (* ~N~0 4) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~A~0.offset)) (< (+ (* thread3Thread1of1ForFork1_~i~2 4) 8) (* ~N~0 4)) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (<= (* ~N~0 4) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~A~0.offset)) (< (+ (* thread3Thread1of1ForFork1_~i~2 4) 8) (* ~N~0 4)) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= 2 ~N~0))), 18335#(and (or (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) 5 ~A~0.offset) (* ~N~0 4)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< 0 ~M~0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) ~max3~0) (<= ~N~0 thread1Thread1of1ForFork2_~i~0) (< ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) 5 ~A~0.offset) (* ~N~0 4)) (< 0 ~M~0) (<= 1 ~max3~0) (= ~max3~0 0) (<= ~N~0 thread1Thread1of1ForFork2_~i~0)) (or (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) 5 ~A~0.offset) (* ~N~0 4)) (< 0 ~M~0) (<= (+ ~max3~0 1) (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= ~N~0 thread1Thread1of1ForFork2_~i~0) (not (< ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (= ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) 5 ~A~0.offset) (* ~N~0 4)) (< 0 ~M~0) (= ~max2~0 0) (<= ~N~0 thread1Thread1of1ForFork2_~i~0)) (or (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) 5 ~A~0.offset) (* ~N~0 4)) (< 0 ~M~0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) ~max3~0) (<= ~N~0 thread1Thread1of1ForFork2_~i~0) (not (< ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (= ~A~0.offset 0) (< 0 ~M~0) (<= ~N~0 thread1Thread1of1ForFork2_~i~0)) (or (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) 5 ~A~0.offset) (* ~N~0 4)) (= ~max3~0 ~max1~0) (< 0 ~M~0) (<= (+ ~max3~0 1) (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= ~N~0 thread1Thread1of1ForFork2_~i~0) (< ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))))), 18315#(and (or (<= 1 ~max3~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 ~max1~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= (+ 3 thread3Thread1of1ForFork1_~i~2) ~N~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4))) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) ~max3~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 ~max1~0) (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4))) (<= (+ 3 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4)) ~max3~0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4)) 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= (+ 3 thread3Thread1of1ForFork1_~i~2) ~N~0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4))) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))) (or (< (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4))) (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) ~max3~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 ~max1~0) (<= (+ 3 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))) (or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 0) (<= (+ 3 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))) (or (= ~max3~0 ~max1~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= (+ 3 thread3Thread1of1ForFork1_~i~2) ~N~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4))) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1)) (<= ~max3~0 0)) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) ~max3~0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4)) 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= (+ 3 thread3Thread1of1ForFork1_~i~2) ~N~0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4))) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4)) ~max3~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 ~max1~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4))) (<= (+ 3 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 0) (< (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4))) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) ~max3~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= (+ 3 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1)))), 18331#(and (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) 5 ~A~0.offset) (* ~N~0 4)) (< 0 ~M~0) (<= 1 ~max3~0) (= ~max3~0 0)) (or (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) 5 ~A~0.offset) (* ~N~0 4)) (< 0 ~M~0) (= ~max2~0 0)) (or (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) 5 ~A~0.offset) (* ~N~0 4)) (= ~max3~0 ~max1~0) (< 0 ~M~0) (<= (+ ~max3~0 1) (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)))) (or (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) 5 ~A~0.offset) (* ~N~0 4)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< 0 ~M~0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) ~max3~0))), 18305#(and (or (<= 1 ~max3~0) (= ~max2~0 ~max1~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= (+ 3 thread3Thread1of1ForFork1_~i~2) ~N~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4))) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))) (or (= ~max2~0 0) (<= (+ 3 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) ~max3~0) (= ~max2~0 ~max1~0) (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4))) (<= (+ 3 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) ~max3~0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4)) 0) (<= (+ 3 thread3Thread1of1ForFork1_~i~2) ~N~0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4))) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4)) ~max3~0) (= ~max2~0 ~max1~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4))) (<= (+ 3 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 0) (< (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4))) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) ~max3~0) (<= (+ 3 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))) (or (< (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4))) (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) ~max3~0) (= ~max2~0 ~max1~0) (<= (+ 3 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))) (or (= ~max3~0 ~max1~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= (+ 3 thread3Thread1of1ForFork1_~i~2) ~N~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4))) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1)) (<= ~max3~0 0)) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4)) ~max3~0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4)) 0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= (+ 3 thread3Thread1of1ForFork1_~i~2) ~N~0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4))) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1)))), 18333#(and (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (< 0 ~M~0) (= ~max3~0 0)) (or (< 0 ~M~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 0) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (< (+ (* ~M~0 4) 8) (* ~N~0 4)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))))) (or (< 0 ~M~0) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))) 0) (<= 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (< (+ (* ~M~0 4) 8) (* ~N~0 4)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))))) (or (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1) (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4)))) (< 0 ~M~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 0) (< (+ (* ~M~0 4) 8) (* ~N~0 4)) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (< 0 ~M~0) (<= 2 ~N~0) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (< 0 ~M~0) (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4)))) (= ~max2~0 ~max1~0) (<= 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (< 0 ~M~0) (= ~max2~0 0) (< (+ (* ~M~0 4) 8) (* ~N~0 4)))), 18314#(and (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 0)) (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 0) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (not (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)))) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (= ~max3~0 ~max1~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= ~max3~0 0)) (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= 1 ~max3~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 ~max1~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)))) (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (not (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)))) (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 ~max1~0))), 18320#(and (or (= ~max3~0 ~max1~0) (< thread3Thread1of1ForFork1_~i~2 ~N~0) (<= ~N~0 thread1Thread1of1ForFork2_~i~0) (< ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))) (<= ~max3~0 0)) (or (< thread3Thread1of1ForFork1_~i~2 ~N~0) (= ~max2~0 0) (<= ~N~0 thread1Thread1of1ForFork2_~i~0)) (or (<= 1 ~max3~0) (< thread3Thread1of1ForFork1_~i~2 ~N~0) (<= ~N~0 thread1Thread1of1ForFork2_~i~0) (= ~max2~0 ~max1~0) (< ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (< thread3Thread1of1ForFork1_~i~2 ~N~0) (<= ~N~0 thread1Thread1of1ForFork2_~i~0) (not (< ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (= ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))) (<= ~max3~0 0)) (or (= ~max2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))) (<= 1 ~max3~0) (< thread3Thread1of1ForFork1_~i~2 ~N~0) (<= ~N~0 thread1Thread1of1ForFork2_~i~0) (not (< ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))))), 18318#(and (or (< (+ (* thread3Thread1of1ForFork1_~i~2 4) 8) (* ~N~0 4)) (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< (+ (* thread3Thread1of1ForFork1_~i~2 4) 8) (* ~N~0 4)) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4)))) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (= ~max3~0 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (< (+ (* thread3Thread1of1ForFork1_~i~2 4) 8) (* ~N~0 4)) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= 2 ~N~0)) (or (= ~A~0.offset 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< (+ (* thread3Thread1of1ForFork1_~i~2 4) 8) (* ~N~0 4)) (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4)))) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 ~max1~0)) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 0) (< (+ (* thread3Thread1of1ForFork1_~i~2 4) 8) (* ~N~0 4)) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))) (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))))) (or (< (+ (* thread3Thread1of1ForFork1_~i~2 4) 8) (* ~N~0 4)) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 0)) (or (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< (+ (* thread3Thread1of1ForFork1_~i~2 4) 8) (* ~N~0 4)) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))) 0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4)))))), 18306#(and (or (<= 1 ~max3~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 ~max1~0)) (or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 0)) (or (= ~max3~0 ~max1~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= ~max3~0 0))), 18325#(and (or (<= (* ~N~0 4) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~A~0.offset)) (= ~max3~0 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (<= (* ~N~0 4) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~A~0.offset)) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 ~max1~0) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (<= (* ~N~0 4) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~A~0.offset)) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= 2 ~N~0) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (<= (* ~N~0 4) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~A~0.offset)) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 0) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (= ~A~0.offset 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (= (* ~N~0 4) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4)) (<= (* ~N~0 4) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~A~0.offset)) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (<= (* ~N~0 4) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) 0) 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0)) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (<= (* ~N~0 4) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~A~0.offset)) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= (+ ~A~0.offset (* ~M~0 4)) 0) (< (+ (* ~M~0 4) 8) (* ~N~0 4)))), 18310#(and (or (< 0 ~M~0) (<= 1 ~max3~0) (<= ~N~0 thread1Thread1of1ForFork2_~i~0) (= ~max2~0 ~max1~0) (< ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (< 0 ~M~0) (= ~max2~0 0) (<= ~N~0 thread1Thread1of1ForFork2_~i~0)) (or (< 0 ~M~0) (<= ~N~0 thread1Thread1of1ForFork2_~i~0) (not (< ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (= ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))) (<= ~max3~0 0)) (or (= ~max2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))) (< 0 ~M~0) (<= 1 ~max3~0) (<= ~N~0 thread1Thread1of1ForFork2_~i~0) (not (< ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))))) (or (= ~max3~0 ~max1~0) (< 0 ~M~0) (<= ~N~0 thread1Thread1of1ForFork2_~i~0) (< ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))) (<= ~max3~0 0))), 18329#(and (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 0) (< (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4))) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< 0 ~M~0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) ~max3~0) (<= (+ 3 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))) (or (< (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4))) (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< 0 ~M~0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) ~max3~0) (= ~max2~0 ~max1~0) (<= (+ 3 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4)) ~max3~0) (< 0 ~M~0) (= ~max2~0 ~max1~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4))) (<= (+ 3 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))) (or (< 0 ~M~0) (= ~max2~0 0) (<= (+ 3 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4)) ~max3~0) (< 0 ~M~0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4)) 0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= (+ 3 thread3Thread1of1ForFork1_~i~2) ~N~0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4))) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))) (or (< 0 ~M~0) (<= 1 ~max3~0) (= ~max2~0 ~max1~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= (+ 3 thread3Thread1of1ForFork1_~i~2) ~N~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4))) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))) (or (= ~max3~0 ~max1~0) (< 0 ~M~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= (+ 3 thread3Thread1of1ForFork1_~i~2) ~N~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4))) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1)) (<= ~max3~0 0)) (or (< 0 ~M~0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) ~max3~0) (= ~max2~0 ~max1~0) (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4))) (<= (+ 3 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))) (or (< 0 ~M~0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) ~max3~0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4)) 0) (<= (+ 3 thread3Thread1of1ForFork1_~i~2) ~N~0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4))) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1)))), 18317#(and (or (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) 5 ~A~0.offset) (* ~N~0 4)) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 0)) (or (= ~A~0.offset 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) 5 ~A~0.offset) (* ~N~0 4)) (<= 1 ~max3~0) (= ~max3~0 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) 5 ~A~0.offset) (* ~N~0 4)) (= ~max3~0 ~max1~0) (<= (+ ~max3~0 1) (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) 5 ~A~0.offset) (* ~N~0 4)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) ~max3~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0))), 18336#(and (or (<= (* ~N~0 4) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~A~0.offset)) (< 0 ~M~0) (= ~max3~0 0)) (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (= (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset) (+ (* ~N~0 4) (- 4))) (<= (* ~N~0 4) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~A~0.offset)) (< (+ (* thread3Thread1of1ForFork1_~i~2 4) 8) (* ~N~0 4)) (< 0 ~M~0)) (or (<= (* ~N~0 4) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~A~0.offset)) (< (+ (* thread3Thread1of1ForFork1_~i~2 4) 8) (* ~N~0 4)) (< 0 ~M~0) (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0)) (or (<= (* ~N~0 4) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~A~0.offset)) (< (+ (* thread3Thread1of1ForFork1_~i~2 4) 8) (* ~N~0 4)) (< 0 ~M~0) (= ~max2~0 0)) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= (* ~N~0 4) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~A~0.offset)) (< (+ (* thread3Thread1of1ForFork1_~i~2 4) 8) (* ~N~0 4)) (< 0 ~M~0)) (or (<= (* ~N~0 4) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~A~0.offset)) (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< (+ (* thread3Thread1of1ForFork1_~i~2 4) 8) (* ~N~0 4)) (< 0 ~M~0) (= ~max1~0 0)) (or (<= (* ~N~0 4) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~A~0.offset)) (< (+ (* thread3Thread1of1ForFork1_~i~2 4) 8) (* ~N~0 4)) (< 0 ~M~0) (<= 2 ~N~0))), 18311#(and (or (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4)) ~max3~0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4))) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (<= (+ 3 ~M~0) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4)) 0) (<= ~N~0 (+ ~M~0 1))) (or (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4)) ~max3~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (<= 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4))) (<= (+ 3 ~M~0) ~N~0) (= ~max2~0 ~max1~0) (<= ~N~0 (+ ~M~0 1))) (or (<= (+ 3 ~M~0) ~N~0) (= ~max2~0 ~max1~0) (<= 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max3~0) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4))) (<= ~N~0 (+ ~M~0 1))) (or (<= 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4))) (<= (+ 3 ~M~0) ~N~0) (= ~max2~0 ~max1~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max3~0) (<= ~N~0 (+ ~M~0 1)) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4)) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (<= (+ 3 ~M~0) ~N~0) (= ~max2~0 0) (<= ~N~0 (+ ~M~0 1))) (or (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 0) (<= (+ 3 ~M~0) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max3~0) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4))) (<= ~N~0 (+ ~M~0 1)) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4))) (<= (+ 3 ~M~0) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4)) 0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max3~0) (<= ~N~0 (+ ~M~0 1)) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4)) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (<= 1 ~max3~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (<= (+ 3 ~M~0) ~N~0) (= ~max2~0 ~max1~0) (<= ~N~0 (+ ~M~0 1)) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4)))) (or (= ~max3~0 ~max1~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (<= (+ 3 ~M~0) ~N~0) (<= ~N~0 (+ ~M~0 1)) (<= ~max3~0 0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4))))), 18309#(and (or (<= 1 ~max3~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= ~N~0 thread1Thread1of1ForFork2_~i~0) (= ~max2~0 ~max1~0) (< ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= ~N~0 thread1Thread1of1ForFork2_~i~0) (not (< ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (= ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))) (<= ~max3~0 0)) (or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 0) (<= ~N~0 thread1Thread1of1ForFork2_~i~0)) (or (= ~max2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))) (<= 1 ~max3~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= ~N~0 thread1Thread1of1ForFork2_~i~0) (not (< ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))))) (or (= ~max3~0 ~max1~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= ~N~0 thread1Thread1of1ForFork2_~i~0) (< ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))) (<= ~max3~0 0))), 18330#(and (or (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4)) ~max3~0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4))) (< 0 ~M~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (<= (+ 3 ~M~0) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4)) 0) (<= ~N~0 (+ ~M~0 1))) (or (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4))) (< 0 ~M~0) (<= (+ 3 ~M~0) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4)) 0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max3~0) (<= ~N~0 (+ ~M~0 1)) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4)) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (< 0 ~M~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 0) (<= (+ 3 ~M~0) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max3~0) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4))) (<= ~N~0 (+ ~M~0 1)) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (< 0 ~M~0) (<= 1 ~max3~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (<= (+ 3 ~M~0) ~N~0) (= ~max2~0 ~max1~0) (<= ~N~0 (+ ~M~0 1)) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4)))) (or (< 0 ~M~0) (<= (+ 3 ~M~0) ~N~0) (= ~max2~0 0) (<= ~N~0 (+ ~M~0 1))) (or (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4)) ~max3~0) (< 0 ~M~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (<= 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4))) (<= (+ 3 ~M~0) ~N~0) (= ~max2~0 ~max1~0) (<= ~N~0 (+ ~M~0 1))) (or (< 0 ~M~0) (<= (+ 3 ~M~0) ~N~0) (= ~max2~0 ~max1~0) (<= 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max3~0) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4))) (<= ~N~0 (+ ~M~0 1))) (or (< 0 ~M~0) (<= 1 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4))) (<= (+ 3 ~M~0) ~N~0) (= ~max2~0 ~max1~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max3~0) (<= ~N~0 (+ ~M~0 1)) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4)) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (= ~max3~0 ~max1~0) (< 0 ~M~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (<= (+ 3 ~M~0) ~N~0) (<= ~N~0 (+ ~M~0 1)) (<= ~max3~0 0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4))))), 18332#(and (or (< (+ (* thread3Thread1of1ForFork1_~i~2 4) 8) (* ~N~0 4)) (< 0 ~M~0) (= ~max2~0 0)) (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (< 0 ~M~0) (= ~max3~0 0)) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 0) (< (+ (* thread3Thread1of1ForFork1_~i~2 4) 8) (* ~N~0 4)) (< 0 ~M~0) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))) (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))))) (or (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< (+ (* thread3Thread1of1ForFork1_~i~2 4) 8) (* ~N~0 4)) (< 0 ~M~0) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))) 0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))))) (or (< (+ (* thread3Thread1of1ForFork1_~i~2 4) 8) (* ~N~0 4)) (< 0 ~M~0) (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0)) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< (+ (* thread3Thread1of1ForFork1_~i~2 4) 8) (* ~N~0 4)) (< 0 ~M~0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4))))) (or (< (+ (* thread3Thread1of1ForFork1_~i~2 4) 8) (* ~N~0 4)) (< 0 ~M~0) (<= 2 ~N~0)) (or (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< (+ (* thread3Thread1of1ForFork1_~i~2 4) 8) (* ~N~0 4)) (< 0 ~M~0) (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* ~N~0 4) (- 4)))) (= ~max2~0 ~max1~0))), 18304#(and (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (not (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)))) (<= 1 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (= ~max2~0 ~max1~0)) (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= 1 ~max3~0) (= ~max2~0 ~max1~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)))) (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (= ~max3~0 ~max1~0) (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= ~max3~0 0)) (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (= ~max2~0 0)) (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 0) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (not (< ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)))) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))))), 18322#(and (or (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) 5 ~A~0.offset) (* ~N~0 4)) (= ~max3~0 ~max1~0) (<= (+ ~max3~0 1) (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= ~N~0 thread1Thread1of1ForFork2_~i~0) (< ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) 5 ~A~0.offset) (* ~N~0 4)) (<= 1 ~max3~0) (= ~max3~0 0) (<= ~N~0 thread1Thread1of1ForFork2_~i~0)) (or (= ~A~0.offset 0) (<= ~N~0 thread1Thread1of1ForFork2_~i~0)) (or (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) 5 ~A~0.offset) (* ~N~0 4)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) ~max3~0) (<= ~N~0 thread1Thread1of1ForFork2_~i~0) (< ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) 5 ~A~0.offset) (* ~N~0 4)) (<= (+ ~max3~0 1) (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= ~N~0 thread1Thread1of1ForFork2_~i~0) (not (< ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (= ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) 5 ~A~0.offset) (* ~N~0 4)) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) ~max3~0) (<= ~N~0 thread1Thread1of1ForFork2_~i~0) (not (< ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) 5 ~A~0.offset) (* ~N~0 4)) (= ~max2~0 0) (<= ~N~0 thread1Thread1of1ForFork2_~i~0))), 18323#(and (or (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) 5 ~A~0.offset) (* ~N~0 4)) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) ~max3~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= ~N~0 thread1Thread1of1ForFork2_~i~0) (not (< ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) 5 ~A~0.offset) (* ~N~0 4)) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 0) (<= ~N~0 thread1Thread1of1ForFork2_~i~0)) (or (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) 5 ~A~0.offset) (* ~N~0 4)) (= ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) ~max3~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= ~N~0 thread1Thread1of1ForFork2_~i~0) (< ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) 5 ~A~0.offset) (* ~N~0 4)) (<= (+ ~max3~0 1) (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= ~N~0 thread1Thread1of1ForFork2_~i~0) (not (< ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (= ~max3~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) 5 ~A~0.offset) (* ~N~0 4)) (= ~max3~0 ~max1~0) (<= (+ ~max3~0 1) (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= ~N~0 thread1Thread1of1ForFork2_~i~0) (< ~max1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) 5 ~A~0.offset) (* ~N~0 4)) (<= 1 ~max3~0) (= ~max3~0 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= ~N~0 thread1Thread1of1ForFork2_~i~0)) (or (= ~A~0.offset 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= ~N~0 thread1Thread1of1ForFork2_~i~0))), 18338#(and (or (< (* ~N~0 4) 8) (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (< (* ~N~0 4) 8) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= ~M~0 0)) (or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= (* ~N~0 4) 8)) (or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= thread1Thread1of1ForFork2_~i~0 0)) (or (< (* ~N~0 4) 8) (= ~max3~0 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (= ~A~0.offset 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (< (* ~N~0 4) 8) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 ~max1~0) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (< (* ~N~0 4) 8) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max1~0 0) (< (+ (* ~M~0 4) 8) (* ~N~0 4)))), 18327#(and (or (= ~max3~0 ~max1~0) (< 0 ~M~0) (< thread3Thread1of1ForFork1_~i~2 ~N~0) (<= ~max3~0 0)) (or (< 0 ~M~0) (< thread3Thread1of1ForFork1_~i~2 ~N~0) (= ~max2~0 0)) (or (< 0 ~M~0) (<= 1 ~max3~0) (< thread3Thread1of1ForFork1_~i~2 ~N~0) (= ~max2~0 ~max1~0))), 18307#(and (or (< 0 ~M~0) (= ~max2~0 0)) (or (= ~max3~0 ~max1~0) (< 0 ~M~0) (<= ~max3~0 0)) (or (< 0 ~M~0) (<= 1 ~max3~0) (= ~max2~0 ~max1~0))), 18326#(and (or (<= (* ~N~0 4) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~A~0.offset)) (= ~max3~0 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (<= 1 (select (select |#memory_int| ~A~0.base) 0)) (<= (* ~N~0 4) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~A~0.offset)) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 ~max1~0) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (<= (* ~N~0 4) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~A~0.offset)) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= 2 ~N~0) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (<= (* ~N~0 4) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~A~0.offset)) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max2~0 0) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (= ~A~0.offset 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (* ~N~0 4) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~A~0.offset)) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (= (* ~N~0 4) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4)) (<= (* ~N~0 4) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~A~0.offset)) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (<= (* ~N~0 4) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) 0) 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~max1~0 (select (select |#memory_int| ~A~0.base) 0)) (< (+ (* ~M~0 4) 8) (* ~N~0 4))) (or (<= (* ~N~0 4) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~A~0.offset)) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= (+ ~A~0.offset (* ~M~0 4)) 0) (< (+ (* ~M~0 4) 8) (* ~N~0 4))))] [2022-03-15 19:27:20,011 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-03-15 19:27:20,011 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:27:20,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-03-15 19:27:20,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=375, Invalid=5178, Unknown=1, NotChecked=146, Total=5700 [2022-03-15 19:27:20,012 INFO L87 Difference]: Start difference. First operand 416 states and 1384 transitions. Second operand has 53 states, 52 states have (on average 3.8653846153846154) internal successors, (201), 52 states have internal predecessors, (201), 0 states have call successors, (0), 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-03-15 19:28:19,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:28:19,403 INFO L93 Difference]: Finished difference Result 2218 states and 6813 transitions. [2022-03-15 19:28:19,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2022-03-15 19:28:19,403 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 3.8653846153846154) internal successors, (201), 52 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 19:28:19,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:28:19,412 INFO L225 Difference]: With dead ends: 2218 [2022-03-15 19:28:19,412 INFO L226 Difference]: Without dead ends: 2204 [2022-03-15 19:28:19,416 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 111 SyntacticMatches, 12 SemanticMatches, 240 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 19316 ImplicationChecksByTransitivity, 56.9s TimeCoverageRelationStatistics Valid=5500, Invalid=52343, Unknown=1, NotChecked=478, Total=58322 [2022-03-15 19:28:19,417 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 843 mSDsluCounter, 1714 mSDsCounter, 0 mSdLazyCounter, 9224 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 843 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 9439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 9224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:28:19,417 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [843 Valid, 337 Invalid, 9439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 9224 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2022-03-15 19:28:19,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2204 states. [2022-03-15 19:28:19,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2204 to 520. [2022-03-15 19:28:19,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 519 states have (on average 3.418111753371869) internal successors, (1774), 519 states have internal predecessors, (1774), 0 states have call successors, (0), 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-03-15 19:28:19,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 1774 transitions. [2022-03-15 19:28:19,440 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 1774 transitions. Word has length 26 [2022-03-15 19:28:19,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:28:19,440 INFO L470 AbstractCegarLoop]: Abstraction has 520 states and 1774 transitions. [2022-03-15 19:28:19,441 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 3.8653846153846154) internal successors, (201), 52 states have internal predecessors, (201), 0 states have call successors, (0), 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-03-15 19:28:19,441 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 1774 transitions. [2022-03-15 19:28:19,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:28:19,444 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:28:19,444 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:28:19,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-03-15 19:28:19,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-03-15 19:28:19,667 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:28:19,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:28:19,668 INFO L85 PathProgramCache]: Analyzing trace with hash 2091340547, now seen corresponding path program 10 times [2022-03-15 19:28:19,668 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:28:19,669 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691299384] [2022-03-15 19:28:19,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:28:19,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:28:19,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:28:20,254 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:28:20,254 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:28:20,254 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691299384] [2022-03-15 19:28:20,254 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691299384] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:28:20,254 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291544058] [2022-03-15 19:28:20,254 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:28:20,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:28:20,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:28:20,256 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:28:20,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-15 19:28:20,345 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:28:20,345 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:28:20,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 52 conjunts are in the unsatisfiable core [2022-03-15 19:28:20,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:28:20,434 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 13 treesize of output 9 [2022-03-15 19:28:20,502 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-03-15 19:28:20,555 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-03-15 19:28:20,711 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-03-15 19:28:21,060 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:28:21,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:28:21,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:28:21,062 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:28:21,066 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:28:21,066 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 164 treesize of output 84 [2022-03-15 19:28:21,247 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:28:21,247 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:28:26,875 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_686 (Array Int Int))) (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) c_~A~0.base))) (let ((.cse0 (select .cse21 c_~A~0.offset))) (or (not (< c_~max1~0 .cse0)) (let ((.cse22 (* 4 c_~M~0))) (let ((.cse16 (select .cse21 (+ c_~A~0.offset .cse22 4))) (.cse4 (select .cse21 (+ c_~A~0.offset .cse22)))) (let ((.cse11 (< c_~max3~0 .cse4)) (.cse2 (< .cse4 .cse16)) (.cse13 (< c_~max3~0 .cse16)) (.cse5 (select .cse21 (+ c_~A~0.offset 4)))) (let ((.cse1 (< .cse0 .cse5)) (.cse12 (not .cse13)) (.cse14 (< c_~max2~0 c_~max3~0)) (.cse15 (<= c_~max3~0 c_~max2~0)) (.cse8 (not .cse2)) (.cse3 (<= .cse4 c_~max2~0)) (.cse7 (< c_~max2~0 .cse4)) (.cse10 (not .cse11)) (.cse18 (< c_~max2~0 .cse16)) (.cse17 (<= .cse16 c_~max2~0))) (and (or (not .cse1) (let ((.cse6 (= .cse5 c_~max2~0))) (let ((.cse9 (and (or (= .cse5 .cse16) .cse17) (or .cse6 .cse18)))) (and (or (and (or .cse2 (and (or .cse3 (= .cse4 .cse5)) (or .cse6 .cse7))) (or .cse8 .cse9)) .cse10) (or .cse11 (and (or .cse9 .cse12) (or .cse13 (and (or .cse6 .cse14) (or (= .cse5 c_~max3~0) .cse15))))))))) (or .cse1 (let ((.cse20 (= .cse0 c_~max2~0))) (let ((.cse19 (and (or .cse20 .cse18) (or (= .cse0 .cse16) .cse17)))) (and (or (and (or .cse19 .cse12) (or (and (or .cse20 .cse14) (or (= .cse0 c_~max3~0) .cse15)) .cse13)) .cse11) (or (and (or .cse8 .cse19) (or (and (or (= .cse4 .cse0) .cse3) (or .cse20 .cse7)) .cse2)) .cse10)))))))))))))) (forall ((v_ArrVal_686 (Array Int Int))) (let ((.cse43 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_686) c_~A~0.base))) (or (let ((.cse44 (* 4 c_~M~0))) (let ((.cse38 (select .cse43 (+ c_~A~0.offset .cse44 4))) (.cse26 (select .cse43 (+ c_~A~0.offset .cse44)))) (let ((.cse33 (< c_~max3~0 .cse26)) (.cse24 (< .cse26 .cse38)) (.cse35 (< c_~max3~0 .cse38)) (.cse27 (select .cse43 (+ c_~A~0.offset 4)))) (let ((.cse23 (< c_~max1~0 .cse27)) (.cse36 (< c_~max2~0 c_~max3~0)) (.cse37 (<= c_~max3~0 c_~max2~0)) (.cse34 (not .cse35)) (.cse30 (not .cse24)) (.cse29 (< c_~max2~0 .cse26)) (.cse25 (<= .cse26 c_~max2~0)) (.cse32 (not .cse33)) (.cse39 (<= .cse38 c_~max2~0)) (.cse40 (< c_~max2~0 .cse38))) (and (or (not .cse23) (let ((.cse28 (= .cse27 c_~max2~0))) (let ((.cse31 (and (or (= .cse27 .cse38) .cse39) (or .cse28 .cse40)))) (and (or (and (or .cse24 (and (or .cse25 (= .cse26 .cse27)) (or .cse28 .cse29))) (or .cse30 .cse31)) .cse32) (or .cse33 (and (or .cse31 .cse34) (or .cse35 (and (or .cse28 .cse36) (or (= .cse27 c_~max3~0) .cse37))))))))) (or .cse23 (let ((.cse41 (= c_~max1~0 c_~max2~0))) (let ((.cse42 (and (or (= c_~max1~0 .cse38) .cse39) (or .cse41 .cse40)))) (and (or .cse33 (and (or (and (or .cse41 .cse36) (or (= c_~max1~0 c_~max3~0) .cse37)) .cse35) (or .cse42 .cse34))) (or (and (or .cse30 .cse42) (or .cse24 (and (or .cse41 .cse29) (or (= c_~max1~0 .cse26) .cse25)))) .cse32)))))))))) (< c_~max1~0 (select .cse43 c_~A~0.offset)))))) is different from false [2022-03-15 19:28:42,946 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:28:42,947 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 1212 treesize of output 781 [2022-03-15 19:28:43,032 INFO L353 Elim1Store]: treesize reduction 112, result has 20.6 percent of original size [2022-03-15 19:28:43,034 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 9960 treesize of output 9440 [2022-03-15 19:28:43,247 INFO L353 Elim1Store]: treesize reduction 73, result has 11.0 percent of original size [2022-03-15 19:28:43,248 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 9407 treesize of output 8840 [2022-03-15 19:28:43,370 INFO L353 Elim1Store]: treesize reduction 73, result has 11.0 percent of original size [2022-03-15 19:28:43,371 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 8831 treesize of output 7688 [2022-03-15 19:28:43,535 INFO L353 Elim1Store]: treesize reduction 73, result has 11.0 percent of original size [2022-03-15 19:28:43,538 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 7679 treesize of output 7400 [2022-03-15 19:28:43,702 INFO L353 Elim1Store]: treesize reduction 73, result has 11.0 percent of original size [2022-03-15 19:28:43,703 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 7391 treesize of output 6984 [2022-03-15 19:28:43,822 INFO L353 Elim1Store]: treesize reduction 73, result has 11.0 percent of original size [2022-03-15 19:28:43,823 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 6975 treesize of output 6776 [2022-03-15 19:28:43,867 INFO L884 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2022-03-15 19:28:43,944 INFO L353 Elim1Store]: treesize reduction 73, result has 11.0 percent of original size [2022-03-15 19:28:43,945 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 6767 treesize of output 6672 [2022-03-15 19:28:44,085 WARN L325 FreeRefinementEngine]: Global settings require throwing the following exception [2022-03-15 19:28:44,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-03-15 19:28:44,307 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:28:44,308 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger out of long range at java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.computeDerApplicabilityScore(QuantifierPusher.java:685) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:668) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.doit(QuantifierPusher.java:604) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:446) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-03-15 19:28:44,310 INFO L158 Benchmark]: Toolchain (without parser) took 252279.34ms. Allocated memory was 170.9MB in the beginning and 676.3MB in the end (delta: 505.4MB). Free memory was 143.9MB in the beginning and 474.1MB in the end (delta: -330.1MB). Peak memory consumption was 458.9MB. Max. memory is 8.0GB. [2022-03-15 19:28:44,310 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 170.9MB. Free memory is still 131.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 19:28:44,310 INFO L158 Benchmark]: CACSL2BoogieTranslator took 212.26ms. Allocated memory was 170.9MB in the beginning and 270.5MB in the end (delta: 99.6MB). Free memory was 143.9MB in the beginning and 241.1MB in the end (delta: -97.2MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2022-03-15 19:28:44,310 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.28ms. Allocated memory is still 270.5MB. Free memory was 241.1MB in the beginning and 239.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 19:28:44,311 INFO L158 Benchmark]: Boogie Preprocessor took 22.21ms. Allocated memory is still 270.5MB. Free memory was 239.1MB in the beginning and 237.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 19:28:44,311 INFO L158 Benchmark]: RCFGBuilder took 489.47ms. Allocated memory is still 270.5MB. Free memory was 237.5MB in the beginning and 218.6MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-03-15 19:28:44,311 INFO L158 Benchmark]: TraceAbstraction took 251514.56ms. Allocated memory was 270.5MB in the beginning and 676.3MB in the end (delta: 405.8MB). Free memory was 218.1MB in the beginning and 474.1MB in the end (delta: -256.0MB). Peak memory consumption was 434.2MB. Max. memory is 8.0GB. [2022-03-15 19:28:44,312 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 170.9MB. Free memory is still 131.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 212.26ms. Allocated memory was 170.9MB in the beginning and 270.5MB in the end (delta: 99.6MB). Free memory was 143.9MB in the beginning and 241.1MB in the end (delta: -97.2MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.28ms. Allocated memory is still 270.5MB. Free memory was 241.1MB in the beginning and 239.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.21ms. Allocated memory is still 270.5MB. Free memory was 239.1MB in the beginning and 237.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 489.47ms. Allocated memory is still 270.5MB. Free memory was 237.5MB in the beginning and 218.6MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 251514.56ms. Allocated memory was 270.5MB in the beginning and 676.3MB in the end (delta: 405.8MB). Free memory was 218.1MB in the beginning and 474.1MB in the end (delta: -256.0MB). Peak memory consumption was 434.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.4s, 156 PlacesBefore, 34 PlacesAfterwards, 159 TransitionsBefore, 28 TransitionsAfterwards, 1320 CoEnabledTransitionPairs, 7 FixpointIterations, 100 TrivialSequentialCompositions, 27 ConcurrentSequentialCompositions, 15 TrivialYvCompositions, 6 ConcurrentYvCompositions, 9 ChoiceCompositions, 157 TotalNumberOfCompositions, 1603 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1454, positive: 1424, positive conditional: 0, positive unconditional: 1424, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 712, positive: 704, positive conditional: 0, positive unconditional: 704, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1454, positive: 720, positive conditional: 0, positive unconditional: 720, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 712, unknown conditional: 0, unknown unconditional: 712] , Statistics on independence cache: Total cache size (in pairs): 51, Positive cache size: 49, Positive conditional cache size: 0, Positive unconditional cache size: 49, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2 - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-03-15 19:28:44,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...