/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-array-sum-alt.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 19:19:46,878 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 19:19:46,880 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 19:19:46,904 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 19:19:46,904 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 19:19:46,905 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 19:19:46,906 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 19:19:46,912 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 19:19:46,913 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 19:19:46,914 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 19:19:46,914 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 19:19:46,915 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 19:19:46,915 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 19:19:46,916 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 19:19:46,916 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 19:19:46,920 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 19:19:46,921 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 19:19:46,924 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 19:19:46,926 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 19:19:46,927 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 19:19:46,927 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 19:19:46,929 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 19:19:46,931 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 19:19:46,932 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 19:19:46,944 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 19:19:46,944 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 19:19:46,944 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 19:19:46,946 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 19:19:46,946 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 19:19:46,947 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 19:19:46,947 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 19:19:46,947 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 19:19:46,948 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 19:19:46,948 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 19:19:46,948 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 19:19:46,949 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 19:19:46,949 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 19:19:46,949 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 19:19:46,949 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 19:19:46,950 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 19:19:46,950 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 19:19:46,951 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:19:46,963 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 19:19:46,963 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 19:19:46,963 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 19:19:46,963 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 19:19:46,964 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 19:19:46,964 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 19:19:46,964 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 19:19:46,964 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 19:19:46,964 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 19:19:46,964 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 19:19:46,964 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 19:19:46,964 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 19:19:46,965 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 19:19:46,965 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 19:19:46,965 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 19:19:46,965 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 19:19:46,965 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 19:19:46,965 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 19:19:46,965 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 19:19:46,965 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 19:19:46,965 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 19:19:46,965 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 19:19:46,965 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 19:19:46,966 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 19:19:46,966 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 19:19:46,966 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 19:19:46,966 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 19:19:46,966 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 19:19:46,966 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 19:19:46,966 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 19:19:46,966 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 19:19:46,966 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 19:19:46,966 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:19:47,139 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 19:19:47,156 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 19:19:47,157 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 19:19:47,158 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 19:19:47,160 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 19:19:47,161 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-array-sum-alt.wvr.c [2022-03-15 19:19:47,216 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73e578a71/cda87cf2ee944a68a25db4b161cfe897/FLAGf25428a79 [2022-03-15 19:19:47,531 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 19:19:47,532 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum-alt.wvr.c [2022-03-15 19:19:47,536 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73e578a71/cda87cf2ee944a68a25db4b161cfe897/FLAGf25428a79 [2022-03-15 19:19:47,962 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73e578a71/cda87cf2ee944a68a25db4b161cfe897 [2022-03-15 19:19:47,963 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 19:19:47,964 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 19:19:47,967 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 19:19:47,967 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 19:19:47,969 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 19:19:47,969 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 07:19:47" (1/1) ... [2022-03-15 19:19:47,970 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ed0ab6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:19:47, skipping insertion in model container [2022-03-15 19:19:47,970 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 07:19:47" (1/1) ... [2022-03-15 19:19:47,974 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 19:19:47,986 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 19:19:48,113 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-array-sum-alt.wvr.c[2761,2774] [2022-03-15 19:19:48,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 19:19:48,124 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 19:19:48,137 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-array-sum-alt.wvr.c[2761,2774] [2022-03-15 19:19:48,142 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 19:19:48,152 INFO L208 MainTranslator]: Completed translation [2022-03-15 19:19:48,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:19:48 WrapperNode [2022-03-15 19:19:48,153 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 19:19:48,153 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 19:19:48,153 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 19:19:48,154 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 19:19:48,158 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:19:48" (1/1) ... [2022-03-15 19:19:48,173 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:19:48" (1/1) ... [2022-03-15 19:19:48,204 INFO L137 Inliner]: procedures = 25, calls = 51, calls flagged for inlining = 12, calls inlined = 16, statements flattened = 200 [2022-03-15 19:19:48,204 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 19:19:48,205 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 19:19:48,205 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 19:19:48,205 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 19:19:48,211 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:19:48" (1/1) ... [2022-03-15 19:19:48,212 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:19:48" (1/1) ... [2022-03-15 19:19:48,222 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:19:48" (1/1) ... [2022-03-15 19:19:48,222 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:19:48" (1/1) ... [2022-03-15 19:19:48,230 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:19:48" (1/1) ... [2022-03-15 19:19:48,238 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:19:48" (1/1) ... [2022-03-15 19:19:48,239 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:19:48" (1/1) ... [2022-03-15 19:19:48,241 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 19:19:48,242 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 19:19:48,242 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 19:19:48,242 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 19:19:48,246 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:19:48" (1/1) ... [2022-03-15 19:19:48,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 19:19:48,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:19:48,269 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:19:48,279 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:19:48,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 19:19:48,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 19:19:48,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 19:19:48,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 19:19:48,295 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 19:19:48,295 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 19:19:48,295 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 19:19:48,295 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 19:19:48,295 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 19:19:48,295 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 19:19:48,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 19:19:48,295 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-15 19:19:48,295 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-15 19:19:48,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-15 19:19:48,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 19:19:48,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 19:19:48,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 19:19:48,297 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:19:48,371 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 19:19:48,372 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 19:19:48,713 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 19:19:48,796 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 19:19:48,796 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-03-15 19:19:48,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 07:19:48 BoogieIcfgContainer [2022-03-15 19:19:48,797 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 19:19:48,798 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 19:19:48,798 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 19:19:48,805 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 19:19:48,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 07:19:47" (1/3) ... [2022-03-15 19:19:48,806 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d4d481e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 07:19:48, skipping insertion in model container [2022-03-15 19:19:48,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:19:48" (2/3) ... [2022-03-15 19:19:48,806 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d4d481e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 07:19:48, skipping insertion in model container [2022-03-15 19:19:48,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 07:19:48" (3/3) ... [2022-03-15 19:19:48,807 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum-alt.wvr.c [2022-03-15 19:19:48,810 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 19:19:48,810 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 19:19:48,810 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 19:19:48,810 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 19:19:48,836 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,837 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,837 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,837 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,837 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,837 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,837 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,837 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,838 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,838 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,838 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,838 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,838 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,838 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,838 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,838 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,838 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,838 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,838 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,838 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,839 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,839 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,839 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,839 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,839 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,839 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,840 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,840 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,840 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,840 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,840 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,840 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,841 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,841 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,841 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,841 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,841 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,841 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,841 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,841 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,842 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,842 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,842 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,842 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,842 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,842 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,842 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,842 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,843 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,843 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,843 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,843 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,843 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,843 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,843 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,844 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,844 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~tmp~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,844 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,844 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,844 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,844 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,844 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,844 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,844 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,844 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,848 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,848 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,848 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~tmp~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,848 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,848 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,848 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,848 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,848 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,848 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,849 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,849 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,849 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~tmp~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,849 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~tmp~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,850 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,850 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,850 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,850 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,850 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,850 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,850 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,850 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,850 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,851 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,851 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,851 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,851 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,851 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,851 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,852 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,852 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,852 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,852 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,852 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,852 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,852 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,852 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,853 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,853 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,853 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,853 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~tmp~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,853 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,853 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,853 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,853 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,855 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,855 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,855 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,856 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,856 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,856 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,856 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~tmp~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,856 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,856 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,856 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,857 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,859 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~tmp~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,859 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~tmp~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,859 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,859 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,859 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,859 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,860 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,860 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,860 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,860 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,860 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,860 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,862 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,863 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,863 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,863 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,863 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,863 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,863 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,863 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,863 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,864 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,864 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,864 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,864 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,864 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,865 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,865 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,865 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,865 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,865 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,865 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,865 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,865 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,865 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,866 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,866 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,866 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,866 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~tmp~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,866 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,866 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,867 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,867 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,867 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,867 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,867 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,867 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,867 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,867 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,867 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,867 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,868 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~tmp~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,868 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,868 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:48,870 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-03-15 19:19:48,915 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 19:19:48,919 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:19:48,919 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-03-15 19:19:48,930 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 19:19:48,935 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 154 places, 156 transitions, 336 flow [2022-03-15 19:19:48,937 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 154 places, 156 transitions, 336 flow [2022-03-15 19:19:48,938 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 154 places, 156 transitions, 336 flow [2022-03-15 19:19:48,998 INFO L129 PetriNetUnfolder]: 12/153 cut-off events. [2022-03-15 19:19:48,999 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-03-15 19:19:49,002 INFO L84 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 153 events. 12/153 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 101 event pairs, 0 based on Foata normal form. 0/140 useless extension candidates. Maximal degree in co-relation 114. Up to 2 conditions per place. [2022-03-15 19:19:49,011 INFO L116 LiptonReduction]: Number of co-enabled transitions 1518 [2022-03-15 19:19:53,056 INFO L131 LiptonReduction]: Checked pairs total: 2348 [2022-03-15 19:19:53,056 INFO L133 LiptonReduction]: Total number of compositions: 151 [2022-03-15 19:19:53,061 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 30 transitions, 84 flow [2022-03-15 19:19:53,085 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 171 states, 170 states have (on average 3.164705882352941) internal successors, (538), 170 states have internal predecessors, (538), 0 states have call successors, (0), 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:19:53,087 INFO L276 IsEmpty]: Start isEmpty. Operand has 171 states, 170 states have (on average 3.164705882352941) internal successors, (538), 170 states have internal predecessors, (538), 0 states have call successors, (0), 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:19:53,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 19:19:53,093 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:19:53,094 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:19:53,094 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:19:53,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:19:53,097 INFO L85 PathProgramCache]: Analyzing trace with hash 834760591, now seen corresponding path program 1 times [2022-03-15 19:19:53,114 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:19:53,114 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712210247] [2022-03-15 19:19:53,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:19:53,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:19:53,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:19:53,402 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:19:53,403 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:19:53,403 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712210247] [2022-03-15 19:19:53,403 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712210247] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:19:53,403 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:19:53,404 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 19:19:53,405 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1804841878] [2022-03-15 19:19:53,405 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:19:53,410 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:19:53,442 INFO L252 McrAutomatonBuilder]: Finished intersection with 107 states and 244 transitions. [2022-03-15 19:19:53,442 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:19:54,060 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:19:54,061 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 19:19:54,061 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:19:54,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 19:19:54,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 19:19:54,075 INFO L87 Difference]: Start difference. First operand has 171 states, 170 states have (on average 3.164705882352941) internal successors, (538), 170 states have internal predecessors, (538), 0 states have call successors, (0), 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:19:54,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:19:54,124 INFO L93 Difference]: Finished difference Result 332 states and 1054 transitions. [2022-03-15 19:19:54,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 19:19:54,126 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:19:54,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:19:54,138 INFO L225 Difference]: With dead ends: 332 [2022-03-15 19:19:54,138 INFO L226 Difference]: Without dead ends: 325 [2022-03-15 19:19:54,139 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:19:54,141 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 3 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:19:54,142 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 6 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 19:19:54,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2022-03-15 19:19:54,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 261. [2022-03-15 19:19:54,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 260 states have (on average 3.173076923076923) internal successors, (825), 260 states have internal predecessors, (825), 0 states have call successors, (0), 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:19:54,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 825 transitions. [2022-03-15 19:19:54,197 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 825 transitions. Word has length 20 [2022-03-15 19:19:54,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:19:54,197 INFO L470 AbstractCegarLoop]: Abstraction has 261 states and 825 transitions. [2022-03-15 19:19:54,197 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:19:54,197 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 825 transitions. [2022-03-15 19:19:54,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:19:54,203 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:19:54,204 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:19:54,204 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 19:19:54,204 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:19:54,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:19:54,206 INFO L85 PathProgramCache]: Analyzing trace with hash -913011636, now seen corresponding path program 1 times [2022-03-15 19:19:54,207 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:19:54,209 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157627051] [2022-03-15 19:19:54,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:19:54,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:19:54,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:19:54,279 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:19:54,279 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:19:54,279 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157627051] [2022-03-15 19:19:54,279 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157627051] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:19:54,280 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:19:54,280 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 19:19:54,280 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1746862389] [2022-03-15 19:19:54,280 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:19:54,282 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:19:54,300 INFO L252 McrAutomatonBuilder]: Finished intersection with 123 states and 291 transitions. [2022-03-15 19:19:54,300 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:19:55,101 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [1362#(or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (<= ~N~0 |thread1Thread1of1ForFork0_~i~0#1|)), 1361#(< |thread1Thread1of1ForFork0_~i~0#1| ~N~0), 1363#(or (<= ~N~0 0) (< 1 ~N~0))] [2022-03-15 19:19:55,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 19:19:55,102 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:19:55,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 19:19:55,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-03-15 19:19:55,103 INFO L87 Difference]: Start difference. First operand 261 states and 825 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 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:19:55,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:19:55,262 INFO L93 Difference]: Finished difference Result 507 states and 1547 transitions. [2022-03-15 19:19:55,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 19:19:55,263 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 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:19:55,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:19:55,268 INFO L225 Difference]: With dead ends: 507 [2022-03-15 19:19:55,268 INFO L226 Difference]: Without dead ends: 503 [2022-03-15 19:19:55,269 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-03-15 19:19:55,269 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 64 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:19:55,270 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 30 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:19:55,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2022-03-15 19:19:55,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 383. [2022-03-15 19:19:55,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 382 states have (on average 3.2198952879581153) internal successors, (1230), 382 states have internal predecessors, (1230), 0 states have call successors, (0), 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:19:55,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1230 transitions. [2022-03-15 19:19:55,288 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1230 transitions. Word has length 21 [2022-03-15 19:19:55,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:19:55,289 INFO L470 AbstractCegarLoop]: Abstraction has 383 states and 1230 transitions. [2022-03-15 19:19:55,289 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 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:19:55,289 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1230 transitions. [2022-03-15 19:19:55,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:19:55,290 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:19:55,290 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:19:55,290 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 19:19:55,290 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:19:55,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:19:55,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1942164593, now seen corresponding path program 1 times [2022-03-15 19:19:55,292 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:19:55,292 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735409565] [2022-03-15 19:19:55,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:19:55,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:19:55,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:19:55,387 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:19:55,387 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:19:55,387 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735409565] [2022-03-15 19:19:55,388 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735409565] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:19:55,388 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205881671] [2022-03-15 19:19:55,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:19:55,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:19:55,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:19:55,389 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:19:55,390 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:19:55,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:19:55,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 19:19:55,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:19:55,555 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:19:55,555 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:19:55,620 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:19:55,620 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1205881671] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 19:19:55,621 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 19:19:55,621 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 13 [2022-03-15 19:19:55,621 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [79356795] [2022-03-15 19:19:55,621 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:19:55,623 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:19:55,642 INFO L252 McrAutomatonBuilder]: Finished intersection with 124 states and 292 transitions. [2022-03-15 19:19:55,642 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:19:56,481 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [2783#(or (<= (+ ~M~0 1) ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)), 2782#(< |thread2Thread1of1ForFork1_~i~1#1| ~M~0), 2781#(<= (+ ~M~0 1) ~N~0), 2784#(< 0 ~M~0), 2785#(or (<= (+ ~M~0 1) ~N~0) (< 0 ~M~0))] [2022-03-15 19:19:56,482 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 19:19:56,482 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:19:56,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 19:19:56,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2022-03-15 19:19:56,482 INFO L87 Difference]: Start difference. First operand 383 states and 1230 transitions. Second operand has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 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:19:56,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:19:56,950 INFO L93 Difference]: Finished difference Result 663 states and 2041 transitions. [2022-03-15 19:19:56,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 19:19:56,951 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 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:19:56,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:19:56,954 INFO L225 Difference]: With dead ends: 663 [2022-03-15 19:19:56,954 INFO L226 Difference]: Without dead ends: 663 [2022-03-15 19:19:56,955 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 128 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=240, Invalid=882, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 19:19:56,955 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 109 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:19:56,955 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 95 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 712 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:19:56,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2022-03-15 19:19:56,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 365. [2022-03-15 19:19:56,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 364 states have (on average 3.230769230769231) internal successors, (1176), 364 states have internal predecessors, (1176), 0 states have call successors, (0), 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:19:56,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 1176 transitions. [2022-03-15 19:19:56,967 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 1176 transitions. Word has length 22 [2022-03-15 19:19:56,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:19:56,968 INFO L470 AbstractCegarLoop]: Abstraction has 365 states and 1176 transitions. [2022-03-15 19:19:56,969 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 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:19:56,970 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 1176 transitions. [2022-03-15 19:19:56,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:19:56,971 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:19:56,971 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:19:56,998 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:19:57,187 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:19:57,188 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:19:57,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:19:57,188 INFO L85 PathProgramCache]: Analyzing trace with hash -943605975, now seen corresponding path program 1 times [2022-03-15 19:19:57,189 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:19:57,189 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014365443] [2022-03-15 19:19:57,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:19:57,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:19:57,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:19:57,261 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:19:57,262 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:19:57,263 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014365443] [2022-03-15 19:19:57,265 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014365443] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:19:57,265 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:19:57,265 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 19:19:57,265 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [274936580] [2022-03-15 19:19:57,265 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:19:57,268 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:19:57,291 INFO L252 McrAutomatonBuilder]: Finished intersection with 159 states and 386 transitions. [2022-03-15 19:19:57,291 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:19:57,986 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [4214#(<= ~N~0 |thread3Thread1of1ForFork2_~i~2#1|), 4215#(<= ~N~0 ~M~0)] [2022-03-15 19:19:57,987 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 19:19:57,987 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:19:57,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 19:19:57,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-03-15 19:19:57,988 INFO L87 Difference]: Start difference. First operand 365 states and 1176 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 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:19:58,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:19:58,133 INFO L93 Difference]: Finished difference Result 435 states and 1275 transitions. [2022-03-15 19:19:58,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 19:19:58,133 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 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:19:58,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:19:58,135 INFO L225 Difference]: With dead ends: 435 [2022-03-15 19:19:58,135 INFO L226 Difference]: Without dead ends: 409 [2022-03-15 19:19:58,135 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-03-15 19:19:58,137 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 54 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:19:58,138 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 22 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:19:58,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2022-03-15 19:19:58,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 385. [2022-03-15 19:19:58,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 384 states have (on average 3.0520833333333335) internal successors, (1172), 384 states have internal predecessors, (1172), 0 states have call successors, (0), 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:19:58,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1172 transitions. [2022-03-15 19:19:58,146 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 1172 transitions. Word has length 22 [2022-03-15 19:19:58,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:19:58,146 INFO L470 AbstractCegarLoop]: Abstraction has 385 states and 1172 transitions. [2022-03-15 19:19:58,146 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 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:19:58,146 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 1172 transitions. [2022-03-15 19:19:58,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:19:58,148 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:19:58,148 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:19:58,148 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-15 19:19:58,148 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:19:58,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:19:58,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1383067489, now seen corresponding path program 1 times [2022-03-15 19:19:58,149 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:19:58,149 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431662776] [2022-03-15 19:19:58,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:19:58,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:19:58,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:19:58,264 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:19:58,264 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:19:58,264 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431662776] [2022-03-15 19:19:58,265 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431662776] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:19:58,265 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:19:58,265 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 19:19:58,265 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1940126587] [2022-03-15 19:19:58,265 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:19:58,267 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:19:58,299 INFO L252 McrAutomatonBuilder]: Finished intersection with 158 states and 386 transitions. [2022-03-15 19:19:58,299 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:19:59,526 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [5433#(or (<= ~M~0 0) (< 1 ~M~0)), 5431#(< (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~M~0), 5430#(< |thread2Thread1of1ForFork1_~i~1#1| ~M~0), 5432#(or (<= ~M~0 |thread2Thread1of1ForFork1_~i~1#1|) (< (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~M~0))] [2022-03-15 19:19:59,527 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 19:19:59,527 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:19:59,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 19:19:59,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-03-15 19:19:59,527 INFO L87 Difference]: Start difference. First operand 385 states and 1172 transitions. Second operand has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 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:19:59,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:19:59,706 INFO L93 Difference]: Finished difference Result 311 states and 920 transitions. [2022-03-15 19:19:59,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 19:19:59,707 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 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:19:59,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:19:59,709 INFO L225 Difference]: With dead ends: 311 [2022-03-15 19:19:59,709 INFO L226 Difference]: Without dead ends: 244 [2022-03-15 19:19:59,709 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-03-15 19:19:59,710 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 45 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:19:59,710 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 22 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:19:59,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-03-15 19:19:59,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2022-03-15 19:19:59,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 243 states have (on average 3.1769547325102883) internal successors, (772), 243 states have internal predecessors, (772), 0 states have call successors, (0), 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:19:59,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 772 transitions. [2022-03-15 19:19:59,715 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 772 transitions. Word has length 22 [2022-03-15 19:19:59,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:19:59,716 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 772 transitions. [2022-03-15 19:19:59,716 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 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:19:59,716 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 772 transitions. [2022-03-15 19:19:59,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:19:59,717 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:19:59,717 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:19:59,717 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-15 19:19:59,717 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:19:59,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:19:59,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1512390726, now seen corresponding path program 1 times [2022-03-15 19:19:59,718 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:19:59,718 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535083688] [2022-03-15 19:19:59,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:19:59,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:19:59,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:19:59,757 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:19:59,757 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:19:59,758 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535083688] [2022-03-15 19:19:59,758 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535083688] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:19:59,758 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779948809] [2022-03-15 19:19:59,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:19:59,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:19:59,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:19:59,759 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:19:59,760 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:19:59,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:19:59,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 19:19:59,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:19:59,882 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:19:59,882 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:19:59,925 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:19:59,925 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779948809] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 19:19:59,925 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 19:19:59,925 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2022-03-15 19:19:59,926 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1604231854] [2022-03-15 19:19:59,926 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:19:59,930 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:19:59,953 INFO L252 McrAutomatonBuilder]: Finished intersection with 160 states and 387 transitions. [2022-03-15 19:19:59,953 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:20:00,585 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:20:00,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 19:20:00,586 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:20:00,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 19:20:00,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-03-15 19:20:00,586 INFO L87 Difference]: Start difference. First operand 244 states and 772 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 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:20:00,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:20:00,634 INFO L93 Difference]: Finished difference Result 304 states and 973 transitions. [2022-03-15 19:20:00,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 19:20:00,634 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 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:20:00,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:20:00,636 INFO L225 Difference]: With dead ends: 304 [2022-03-15 19:20:00,636 INFO L226 Difference]: Without dead ends: 304 [2022-03-15 19:20:00,636 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 169 SyntacticMatches, 8 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-03-15 19:20:00,636 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 26 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:20:00,637 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 7 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 19:20:00,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-03-15 19:20:00,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2022-03-15 19:20:00,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 303 states have (on average 3.211221122112211) internal successors, (973), 303 states have internal predecessors, (973), 0 states have call successors, (0), 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:20:00,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 973 transitions. [2022-03-15 19:20:00,643 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 973 transitions. Word has length 23 [2022-03-15 19:20:00,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:20:00,643 INFO L470 AbstractCegarLoop]: Abstraction has 304 states and 973 transitions. [2022-03-15 19:20:00,643 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 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:20:00,643 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 973 transitions. [2022-03-15 19:20:00,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:20:00,644 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:20:00,644 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:20:00,663 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:20:00,859 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,SelfDestructingSolverStorable5 [2022-03-15 19:20:00,862 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:20:00,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:20:00,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1900950313, now seen corresponding path program 1 times [2022-03-15 19:20:00,863 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:20:00,863 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919055088] [2022-03-15 19:20:00,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:20:00,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:20:00,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:20:01,207 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:20:01,208 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:20:01,208 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919055088] [2022-03-15 19:20:01,208 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919055088] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:20:01,208 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646593256] [2022-03-15 19:20:01,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:20:01,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:20:01,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:20:01,209 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:20:01,210 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:20:01,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:20:01,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 69 conjunts are in the unsatisfiable core [2022-03-15 19:20:01,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:20:01,344 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 11 treesize of output 7 [2022-03-15 19:20:01,386 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:20:01,469 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:20:01,524 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:20:01,651 INFO L353 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-03-15 19:20:01,651 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 23 treesize of output 14 [2022-03-15 19:20:01,684 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:20:01,684 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:20:02,055 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:20:02,055 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 61 treesize of output 50 [2022-03-15 19:20:02,067 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:20:02,067 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 806 treesize of output 770 [2022-03-15 19:20:02,080 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:20:02,080 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 379 treesize of output 328 [2022-03-15 19:20:02,092 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:20:02,092 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 694 treesize of output 674 [2022-03-15 19:20:02,117 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:20:02,117 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 662 treesize of output 546 [2022-03-15 19:20:05,691 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:20:05,692 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646593256] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:20:05,692 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:20:05,692 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2022-03-15 19:20:05,692 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1103691987] [2022-03-15 19:20:05,692 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:20:05,695 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:20:05,723 INFO L252 McrAutomatonBuilder]: Finished intersection with 188 states and 472 transitions. [2022-03-15 19:20:05,723 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:20:16,187 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 33 new interpolants: [7492#(and (= ~A~0.offset 0) (or (<= (+ ~M~0 1) 0) (< 0 (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 1))) (= ~res2~0 0) (or (<= (+ ~M~0 1) 0) (= ~res1~0 0) (not (= 0 (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)))) (or (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) (+ ~N~0 ~M~0)) (not (<= (+ ~M~0 1) 0))) (or (<= (+ ~M~0 1) 0) (= (+ (- 1) ~N~0) 0))), 7489#(and (or (<= (+ ~M~0 1) 0) (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) 2147483647)) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (< 1 ~N~0) (not (< 0 ~N~0))) (or (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))) (not (<= (+ ~M~0 1) 0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) 2147483647)) (<= |thread3Thread1of1ForFork2_~i~2#1| (+ ~N~0 ~M~0)) (< 1 ~N~0) (not (< 0 ~N~0)))), 7485#(and (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0) 2147483647)) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) (+ ~N~0 ~M~0)) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648))) (not (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0))) (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0) 2147483647)) (<= (+ ~M~0 1) 0) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (= (+ (- 1) ~N~0) 0) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648))) (not (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0))) (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0) 2147483647)) (<= (+ ~M~0 1) 0) (= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0)) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648))) (not (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0)))), 7480#(and (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 2) ~N~0) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) |thread3Thread1of1ForFork2_~tmp~2#1|)) (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 2) ~N~0) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (= (+ (- 1) ~N~0) 0))), 7476#(and (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (= (+ (- 1) ~N~0) 0))), 7483#(and (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0) (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 2147483648))) (<= (+ 2 ~M~0) ~N~0) (not (< ~M~0 ~N~0)) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0) 2147483647))) (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (= (+ (- 1) ~N~0) 0) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 2147483648))) (<= (+ 2 ~M~0) ~N~0) (not (< ~M~0 ~N~0)) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0) 2147483647)))), 7470#(and (or (<= (+ ~M~0 1) 0) (= ~res1~0 |thread3Thread1of1ForFork2_~tmp~2#1|) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (or (<= (+ ~M~0 1) 0) (= (+ (- 1) ~N~0) 0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (or (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) (+ ~N~0 ~M~0)) (not (<= (+ ~M~0 1) 0)) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0))), 7474#(and (= ~A~0.offset 0) (or (not (= (+ ~A~0.offset (* ~M~0 4)) 0)) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res1~0)) (or (not (= (+ ~A~0.offset (* ~M~0 4)) 0)) (<= ~res1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (<= 1 ~N~0) (= ~res2~0 0) (or (<= (+ ~M~0 1) 0) (= (+ (- 1) ~N~0) 0))), 7463#(or (= ~res2~0 ~res1~0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)), 7486#(and (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (<= 1 ~N~0) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 2147483648))) (not (< ~M~0 ~N~0)) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0) 2147483647))) (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (<= (+ ~M~0 1) 0) (= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0) (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 2147483648))) (not (< ~M~0 ~N~0)) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0) 2147483647))) (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (<= (+ ~M~0 1) 0) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (= (+ (- 1) ~N~0) 0) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 2147483648))) (not (< ~M~0 ~N~0)) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0) 2147483647)))), 7487#(or (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0) 2147483647)) (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 2) ~N~0) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648))) (not (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) 2147483647)) (< 1 ~N~0) (= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0)) (not (< 0 ~N~0))), 7471#(and (or (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0) 2147483647)) (<= (+ ~M~0 1) 0) (= (+ (- 1) ~N~0) 0) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648))) (not (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0)) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (or (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0) 2147483647)) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) (+ ~N~0 ~M~0)) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648))) (not (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0)) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (or (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0) 2147483647)) (<= (+ ~M~0 1) 0) (= ~res1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0)) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648))) (not (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0)) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0))), 7472#(and (or (<= 1 ~N~0) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 2147483648))) (not (< ~M~0 ~N~0)) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0) 2147483647))) (or (<= (+ ~M~0 1) 0) (= (+ (- 1) ~N~0) 0) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 2147483648))) (not (< ~M~0 ~N~0)) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0) 2147483647))) (or (= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0) ~res1~0) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 2147483648))) (<= (+ 2 ~M~0) ~N~0) (not (< ~M~0 ~N~0)) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0) 2147483647)))), 7467#(and (or (= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0) ~res1~0) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 2147483648))) (<= (+ 2 ~M~0) ~N~0) (not (< ~M~0 ~N~0)) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0) 2147483647)) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (or (= (+ (- 1) ~N~0) 0) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 2147483648))) (<= (+ 2 ~M~0) ~N~0) (not (< ~M~0 ~N~0)) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0) 2147483647)) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0))), 7478#(or (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) 2147483647)) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (< 1 ~N~0) (not (< 0 ~N~0))), 7468#(and (or (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0) 2147483647)) (<= (+ ~M~0 1) 0) (= (+ (- 1) ~N~0) 0) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648))) (not (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0))) (or (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0) 2147483647)) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) (+ ~N~0 ~M~0)) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648))) (not (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0))) (or (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0) 2147483647)) (<= (+ ~M~0 1) 0) (= ~res1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0)) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648))) (not (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0)))), 7484#(and (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) (+ ~N~0 ~M~0)) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (not (<= (+ ~M~0 1) 0))) (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (<= (+ ~M~0 1) 0) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) |thread3Thread1of1ForFork2_~tmp~2#1|)) (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (<= (+ ~M~0 1) 0) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (= (+ (- 1) ~N~0) 0))), 7473#(and (or (<= (+ ~M~0 1) 0) (= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0) ~res1~0) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 2147483648))) (not (< ~M~0 ~N~0)) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0) 2147483647)) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (or (<= 1 ~N~0) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 2147483648))) (not (< ~M~0 ~N~0)) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0) 2147483647)) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (or (<= (+ ~M~0 1) 0) (= (+ (- 1) ~N~0) 0) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 2147483648))) (not (< ~M~0 ~N~0)) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0) 2147483647)) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0))), 7477#(and (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (not (<= (+ ~M~0 1) 0)) (<= |thread3Thread1of1ForFork2_~i~2#1| (+ ~N~0 ~M~0))) (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (<= (+ ~M~0 1) 0) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (<= (+ ~M~0 1) 0) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (= (+ (- 1) ~N~0) 0))), 7462#(and (or (= (+ (- 1) ~N~0) 0) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 2147483648))) (<= (+ 2 ~M~0) ~N~0) (not (< ~M~0 ~N~0)) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0) 2147483647))) (or (= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0) ~res1~0) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 2147483648))) (<= (+ 2 ~M~0) ~N~0) (not (< ~M~0 ~N~0)) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0) 2147483647)))), 7464#(and (or (= ~res2~0 ~res1~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (or (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (= (+ (- 1) ~N~0) 0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0))), 7482#(or (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 2) ~N~0) (= |thread3Thread1of1ForFork2_~tmp~2#1| (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) 2147483647)) (< 1 ~N~0) (not (< 0 ~N~0))), 7491#(and (or (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0) 2147483647)) (<= (+ ~M~0 1) 0) (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648))) (not (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) 2147483647)) (< 1 ~N~0) (= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0)) (not (< 0 ~N~0))) (or (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0) 2147483647)) (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) (+ ~N~0 ~M~0)) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648))) (not (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) 2147483647)) (< 1 ~N~0) (not (< 0 ~N~0)))), 7490#(and (or (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) (+ ~N~0 ~M~0)) (not (<= (+ ~M~0 1) 0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) 2147483647)) (< 1 ~N~0) (not (< 0 ~N~0))) (or (<= (+ ~M~0 1) 0) (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))) (= |thread3Thread1of1ForFork2_~tmp~2#1| (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) 2147483647)) (< 1 ~N~0) (not (< 0 ~N~0)))), 7475#(or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))), 7466#(and (or (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0) 2147483647)) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 2) ~N~0) (= (+ (- 1) ~N~0) 0) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648))) (not (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0)) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (or (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0) 2147483647)) (= ~res1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0)) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 2) ~N~0) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648))) (not (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0)) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0))), 7461#(and (or (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0) 2147483647)) (= ~res1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0)) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 2) ~N~0) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648))) (not (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0))) (or (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0) 2147483647)) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 2) ~N~0) (= (+ (- 1) ~N~0) 0) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648))) (not (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0)))), 7481#(and (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0) 2147483647)) (= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0)) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 2) ~N~0) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648))) (not (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0))) (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0) 2147483647)) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 2) ~N~0) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (= (+ (- 1) ~N~0) 0) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648))) (not (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0)))), 7479#(or (< 2147483647 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (<= ~N~0 0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (< 1 ~N~0) (< (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648) 0)), 7460#(and (or (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 2) ~N~0) (= ~res1~0 |thread3Thread1of1ForFork2_~tmp~2#1|)) (or (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 2) ~N~0) (= (+ (- 1) ~N~0) 0))), 7465#(and (or (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 2) ~N~0) (= (+ (- 1) ~N~0) 0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (or (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 2) ~N~0) (= ~res1~0 |thread3Thread1of1ForFork2_~tmp~2#1|) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0))), 7469#(and (or (<= (+ ~M~0 1) 0) (= (+ (- 1) ~N~0) 0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (or (not (<= (+ ~M~0 1) 0)) (<= |thread3Thread1of1ForFork2_~i~2#1| (+ ~N~0 ~M~0)) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (or (<= (+ ~M~0 1) 0) (= ~res2~0 ~res1~0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0))), 7488#(or (= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0) (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 2147483648))) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) 2147483647)) (<= (+ 2 ~M~0) ~N~0) (not (< ~M~0 ~N~0)) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0) 2147483647)) (< 1 ~N~0) (not (< 0 ~N~0)))] [2022-03-15 19:20:16,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-03-15 19:20:16,188 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:20:16,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-03-15 19:20:16,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=3483, Unknown=17, NotChecked=0, Total=3782 [2022-03-15 19:20:16,190 INFO L87 Difference]: Start difference. First operand 304 states and 973 transitions. Second operand has 45 states, 44 states have (on average 5.181818181818182) internal successors, (228), 44 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:20:42,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:20:42,303 INFO L93 Difference]: Finished difference Result 2944 states and 8738 transitions. [2022-03-15 19:20:42,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2022-03-15 19:20:42,303 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 5.181818181818182) internal successors, (228), 44 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:20:42,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:20:42,317 INFO L225 Difference]: With dead ends: 2944 [2022-03-15 19:20:42,317 INFO L226 Difference]: Without dead ends: 2902 [2022-03-15 19:20:42,324 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 136 SyntacticMatches, 19 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12655 ImplicationChecksByTransitivity, 23.2s TimeCoverageRelationStatistics Valid=3626, Invalid=34577, Unknown=17, NotChecked=0, Total=38220 [2022-03-15 19:20:42,324 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 1390 mSDsluCounter, 2275 mSDsCounter, 0 mSdLazyCounter, 8133 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1390 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 8311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 8133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:20:42,324 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1390 Valid, 866 Invalid, 8311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 8133 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-03-15 19:20:42,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2902 states. [2022-03-15 19:20:42,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2902 to 574. [2022-03-15 19:20:42,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 573 states have (on average 3.43804537521815) internal successors, (1970), 573 states have internal predecessors, (1970), 0 states have call successors, (0), 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:20:42,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 1970 transitions. [2022-03-15 19:20:42,352 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 1970 transitions. Word has length 24 [2022-03-15 19:20:42,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:20:42,352 INFO L470 AbstractCegarLoop]: Abstraction has 574 states and 1970 transitions. [2022-03-15 19:20:42,352 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 5.181818181818182) internal successors, (228), 44 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:20:42,352 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 1970 transitions. [2022-03-15 19:20:42,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:20:42,354 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:20:42,354 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:20:42,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-03-15 19:20:42,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:20:42,567 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:20:42,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:20:42,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1461488799, now seen corresponding path program 1 times [2022-03-15 19:20:42,568 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:20:42,569 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170484564] [2022-03-15 19:20:42,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:20:42,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:20:42,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:20:42,798 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:20:42,798 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:20:42,798 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170484564] [2022-03-15 19:20:42,798 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170484564] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:20:42,798 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712544623] [2022-03-15 19:20:42,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:20:42,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:20:42,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:20:42,799 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:20:42,800 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:20:42,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:20:42,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 62 conjunts are in the unsatisfiable core [2022-03-15 19:20:42,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:20:42,929 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 11 treesize of output 7 [2022-03-15 19:20:42,966 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:20:43,035 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:20:43,065 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:20:43,114 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-03-15 19:20:43,141 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:20:43,141 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:20:43,205 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_266 (Array Int Int))) (= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (+ (select .cse0 c_~A~0.offset) c_~res2~0 (* (- 1) (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))) (* (- 1) c_~res1~0))) 0)) is different from false [2022-03-15 19:20:43,212 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (= (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_266) c_~A~0.base))) (+ c_~res2~0 (* (- 1) c_~res1~0) (select .cse0 c_~A~0.offset) (* (- 1) (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))))) 0)) is different from false [2022-03-15 19:20:43,231 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:20:43,231 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [712544623] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:20:43,231 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:20:43,231 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 7] total 21 [2022-03-15 19:20:43,231 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [342124614] [2022-03-15 19:20:43,231 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:20:43,233 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:20:43,273 INFO L252 McrAutomatonBuilder]: Finished intersection with 190 states and 481 transitions. [2022-03-15 19:20:43,273 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:20:47,156 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [12014#(or (< 2147483647 (+ ~res2~0 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)))) (< (+ ~res2~0 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 2147483648) 0) (= ~res1~0 (+ ~res2~0 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))))), 12016#(or (< 2147483647 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (< (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 0)), 12028#(and (= ~A~0.offset 0) (= ~res1~0 0) (= ~res2~0 0)), 11912#(= (+ (* (- 1) ~res1~0) |thread2Thread1of1ForFork1_~tmp~1#1|) 0), 12017#(or (< 2147483647 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (< (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648) 0)), 12020#(and (or (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)) (or (< 2147483647 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) |thread2Thread1of1ForFork1_~tmp~1#1|) (< (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 0))), 12019#(or (< 2147483647 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (= |thread2Thread1of1ForFork1_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (< (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648) 0)), 12027#(or (< (+ ~res2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648) 0) (< 2147483647 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (+ ~res2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (< 2147483647 (+ ~res2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (< (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648) 0)), 12029#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (= ~res1~0 0) (= ~res2~0 0)), 12021#(and (or (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) 2147483647))) (or (< 2147483647 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (= |thread2Thread1of1ForFork1_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (< (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648) 0))), 12015#(or (< (+ ~res2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648) 0) (= ~res1~0 (+ ~res2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (< 2147483647 (+ ~res2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)))), 12022#(or (< 2147483647 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (< 2147483647 (+ ~res2~0 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)))) (< (+ ~res2~0 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 2147483648) 0) (< (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 0) (= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ ~res2~0 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))))), 12023#(or (< 2147483647 (+ ~res2~0 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)))) (< 2147483647 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (< (+ ~res2~0 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 2147483648) 0) (= (+ ~res2~0 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (< (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648) 0)), 12024#(or (< 2147483647 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (< (+ ~res2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648) 0) (< (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 0) (= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ ~res2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (< 2147483647 (+ ~res2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)))), 12025#(and (or (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)) (or (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)))) (or (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (= ~res2~0 0)) (or (= ~A~0.offset 0) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)))), 12018#(or (< 2147483647 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) |thread2Thread1of1ForFork1_~tmp~1#1|) (< (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 0)), 12026#(and (or (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))) (= (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) 2147483647))) (or (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) 2147483647)) (= ~res2~0 0)) (or (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) 2147483647))) (or (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))) (= ~A~0.offset 0) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) 2147483647))))] [2022-03-15 19:20:47,156 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 19:20:47,156 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:20:47,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 19:20:47,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1177, Unknown=2, NotChecked=142, Total=1482 [2022-03-15 19:20:47,157 INFO L87 Difference]: Start difference. First operand 574 states and 1970 transitions. Second operand has 29 states, 28 states have (on average 5.035714285714286) internal successors, (141), 28 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:20:48,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:20:48,456 INFO L93 Difference]: Finished difference Result 1155 states and 3898 transitions. [2022-03-15 19:20:48,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 19:20:48,457 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 5.035714285714286) internal successors, (141), 28 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 24 [2022-03-15 19:20:48,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:20:48,461 INFO L225 Difference]: With dead ends: 1155 [2022-03-15 19:20:48,462 INFO L226 Difference]: Without dead ends: 1148 [2022-03-15 19:20:48,462 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 157 SyntacticMatches, 25 SemanticMatches, 51 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1045 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=309, Invalid=2247, Unknown=2, NotChecked=198, Total=2756 [2022-03-15 19:20:48,463 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 227 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 1863 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 1896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:20:48,463 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [227 Valid, 226 Invalid, 1896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1863 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 19:20:48,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2022-03-15 19:20:48,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 776. [2022-03-15 19:20:48,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 775 states have (on average 3.5058064516129033) internal successors, (2717), 775 states have internal predecessors, (2717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:20:48,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 2717 transitions. [2022-03-15 19:20:48,480 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 2717 transitions. Word has length 24 [2022-03-15 19:20:48,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:20:48,480 INFO L470 AbstractCegarLoop]: Abstraction has 776 states and 2717 transitions. [2022-03-15 19:20:48,480 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 5.035714285714286) internal successors, (141), 28 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:20:48,480 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 2717 transitions. [2022-03-15 19:20:48,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:20:48,482 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:20:48,482 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:20:48,498 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:20:48,698 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:20:48,698 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:20:48,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:20:48,699 INFO L85 PathProgramCache]: Analyzing trace with hash -2025426415, now seen corresponding path program 2 times [2022-03-15 19:20:48,700 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:20:48,700 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873886256] [2022-03-15 19:20:48,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:20:48,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:20:48,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:20:49,022 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:20:49,023 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:20:49,023 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873886256] [2022-03-15 19:20:49,023 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873886256] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:20:49,023 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87784789] [2022-03-15 19:20:49,023 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:20:49,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:20:49,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:20:49,024 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:20:49,024 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:20:49,101 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:20:49,101 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:20:49,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 65 conjunts are in the unsatisfiable core [2022-03-15 19:20:49,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:20:49,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:20:49,302 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 14 treesize of output 16 [2022-03-15 19:20:49,376 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:20:49,377 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:20:49,377 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 17 treesize of output 10 [2022-03-15 19:20:49,402 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:20:49,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:20:49,508 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:20:49,508 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 54 treesize of output 46 [2022-03-15 19:20:49,511 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 17 treesize of output 11 [2022-03-15 19:20:49,744 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:20:49,745 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87784789] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:20:49,745 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:20:49,745 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 26 [2022-03-15 19:20:49,745 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [246906797] [2022-03-15 19:20:49,745 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:20:49,747 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:20:49,779 INFO L252 McrAutomatonBuilder]: Finished intersection with 130 states and 292 transitions. [2022-03-15 19:20:49,779 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:20:53,648 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [14939#(and (or (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 2) ~N~0) (= ~res1~0 |thread3Thread1of1ForFork2_~tmp~2#1|) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (or (= ~res1~0 |thread3Thread1of1ForFork2_~tmp~2#1|) (= (+ (- 1) ~N~0) 0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0))), 14938#(and (= ~A~0.offset 0) (or (not (= (+ ~A~0.offset (* ~M~0 4)) 0)) (= ~res2~0 0)) (or (not (= (+ ~A~0.offset (* ~M~0 4)) 0)) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res1~0)) (or (= ~N~0 1) (= (+ ~A~0.offset (* ~M~0 4)) 0))), 14932#(or (= ~res2~0 ~res1~0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)), 14934#(and (or (= ~res2~0 ~res1~0) (= (+ (- 1) ~N~0) 0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (or (= ~res2~0 ~res1~0) (<= |thread3Thread1of1ForFork2_~i~2#1| (+ ~N~0 ~M~0)) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (or (<= (+ ~M~0 1) 0) (= ~res2~0 ~res1~0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0))), 14937#(and (or (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0) 2147483647)) (= ~res1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0)) (= (+ (- 1) ~N~0) 0) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648))) (not (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0))) (or (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0) 2147483647)) (= ~res1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0)) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) (+ ~N~0 ~M~0)) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648))) (not (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0))) (or (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0) 2147483647)) (<= (+ ~M~0 1) 0) (= ~res1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0)) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648))) (not (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0)))), 14936#(and (or (= (+ (- 1) ~N~0) 0) (= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0) ~res1~0) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 2147483648))) (not (< ~M~0 ~N~0)) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0) 2147483647))) (or (= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0) ~res1~0) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 2147483648))) (<= (+ 2 ~M~0) ~N~0) (not (< ~M~0 ~N~0)) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0) 2147483647)))), 14941#(and (or (<= (+ ~M~0 1) 0) (= ~res1~0 |thread3Thread1of1ForFork2_~tmp~2#1|) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (or (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) (+ ~N~0 ~M~0)) (= ~res1~0 |thread3Thread1of1ForFork2_~tmp~2#1|) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (or (= ~res1~0 |thread3Thread1of1ForFork2_~tmp~2#1|) (= (+ (- 1) ~N~0) 0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0))), 14935#(and (or (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0) 2147483647)) (= ~res1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0)) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 2) ~N~0) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648))) (not (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0))) (or (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0) 2147483647)) (= ~res1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0)) (= (+ (- 1) ~N~0) 0) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648))) (not (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0)))), 14931#(and (or (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 2) ~N~0) (= ~res1~0 |thread3Thread1of1ForFork2_~tmp~2#1|)) (or (= ~res1~0 |thread3Thread1of1ForFork2_~tmp~2#1|) (= (+ (- 1) ~N~0) 0))), 14933#(and (or (= ~res2~0 ~res1~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (or (= ~res2~0 ~res1~0) (= (+ (- 1) ~N~0) 0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0))), 14943#(and (or (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0) 2147483647)) (= ~res1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0)) (= (+ (- 1) ~N~0) 0) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648))) (not (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0)) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (or (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0) 2147483647)) (<= (+ ~M~0 1) 0) (= ~res1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0)) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648))) (not (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0)) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (or (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0) 2147483647)) (= ~res1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0)) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) (+ ~N~0 ~M~0)) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648))) (not (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0)) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0))), 14942#(and (or (= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0) ~res1~0) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 2147483648))) (<= (+ 2 ~M~0) ~N~0) (not (< ~M~0 ~N~0)) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0) 2147483647)) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (or (= (+ (- 1) ~N~0) 0) (= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0) ~res1~0) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 2147483648))) (not (< ~M~0 ~N~0)) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0) 2147483647)) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0))), 14940#(and (or (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0) 2147483647)) (= ~res1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0)) (= (+ (- 1) ~N~0) 0) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648))) (not (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0)) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (or (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0) 2147483647)) (= ~res1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0)) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 2) ~N~0) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648))) (not (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0)) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)))] [2022-03-15 19:20:53,648 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 19:20:53,648 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:20:53,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 19:20:53,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1424, Unknown=4, NotChecked=0, Total=1640 [2022-03-15 19:20:53,649 INFO L87 Difference]: Start difference. First operand 776 states and 2717 transitions. Second operand has 26 states, 25 states have (on average 4.88) internal successors, (122), 25 states have internal predecessors, (122), 0 states have call successors, (0), 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:20:55,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:20:55,274 INFO L93 Difference]: Finished difference Result 1706 states and 5667 transitions. [2022-03-15 19:20:55,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-15 19:20:55,275 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 4.88) internal successors, (122), 25 states have internal predecessors, (122), 0 states have call successors, (0), 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:20:55,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:20:55,282 INFO L225 Difference]: With dead ends: 1706 [2022-03-15 19:20:55,282 INFO L226 Difference]: Without dead ends: 1699 [2022-03-15 19:20:55,283 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 109 SyntacticMatches, 9 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 994 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=473, Invalid=2945, Unknown=4, NotChecked=0, Total=3422 [2022-03-15 19:20:55,283 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 335 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 1195 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 1247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:20:55,283 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [335 Valid, 99 Invalid, 1247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1195 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:20:55,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1699 states. [2022-03-15 19:20:55,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1699 to 786. [2022-03-15 19:20:55,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 786 states, 785 states have (on average 3.4968152866242037) internal successors, (2745), 785 states have internal predecessors, (2745), 0 states have call successors, (0), 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:20:55,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 2745 transitions. [2022-03-15 19:20:55,303 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 2745 transitions. Word has length 24 [2022-03-15 19:20:55,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:20:55,303 INFO L470 AbstractCegarLoop]: Abstraction has 786 states and 2745 transitions. [2022-03-15 19:20:55,304 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 4.88) internal successors, (122), 25 states have internal predecessors, (122), 0 states have call successors, (0), 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:20:55,304 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 2745 transitions. [2022-03-15 19:20:55,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:20:55,305 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:20:55,305 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:20:55,331 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:20:55,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:20:55,515 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:20:55,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:20:55,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1830079367, now seen corresponding path program 2 times [2022-03-15 19:20:55,516 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:20:55,516 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598169754] [2022-03-15 19:20:55,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:20:55,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:20:55,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:20:55,646 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:20:55,646 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:20:55,646 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598169754] [2022-03-15 19:20:55,646 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598169754] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:20:55,646 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828737841] [2022-03-15 19:20:55,646 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:20:55,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:20:55,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:20:55,647 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:20:55,648 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:20:55,725 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:20:55,725 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:20:55,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 54 conjunts are in the unsatisfiable core [2022-03-15 19:20:55,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:20:55,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:20:55,836 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 14 treesize of output 16 [2022-03-15 19:20:55,871 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-03-15 19:20:55,896 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:20:55,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:20:55,947 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_356 (Array Int Int))) (= (+ c_~res2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_356) c_~A~0.base) c_~A~0.offset) (* (- 1) c_~res1~0)) 0)) is different from false [2022-03-15 19:20:55,953 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:20:55,953 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 54 treesize of output 46 [2022-03-15 19:20:55,955 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 17 treesize of output 15 [2022-03-15 19:20:56,022 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:20:56,023 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828737841] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:20:56,023 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:20:56,023 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2022-03-15 19:20:56,023 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1250246787] [2022-03-15 19:20:56,023 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:20:56,025 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:20:56,041 INFO L252 McrAutomatonBuilder]: Finished intersection with 126 states and 285 transitions. [2022-03-15 19:20:56,041 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:20:57,332 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [18314#(= (+ (* (- 1) ~res1~0) |thread2Thread1of1ForFork1_~tmp~1#1|) 0), 18418#(or (< (+ ~res2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648) 0) (= ~res1~0 (+ ~res2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (< 2147483647 (+ ~res2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)))), 18417#(or (< 2147483647 (+ ~res2~0 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)))) (< (+ ~res2~0 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 2147483648) 0) (= ~res1~0 (+ ~res2~0 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)))))] [2022-03-15 19:20:57,332 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 19:20:57,332 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:20:57,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 19:20:57,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=381, Unknown=1, NotChecked=40, Total=506 [2022-03-15 19:20:57,332 INFO L87 Difference]: Start difference. First operand 786 states and 2745 transitions. Second operand has 13 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 0 states have call successors, (0), 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:20:57,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:20:57,657 INFO L93 Difference]: Finished difference Result 1552 states and 5322 transitions. [2022-03-15 19:20:57,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 19:20:57,658 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 0 states have call successors, (0), 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:20:57,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:20:57,664 INFO L225 Difference]: With dead ends: 1552 [2022-03-15 19:20:57,664 INFO L226 Difference]: Without dead ends: 1545 [2022-03-15 19:20:57,664 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 109 SyntacticMatches, 22 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=579, Unknown=1, NotChecked=50, Total=756 [2022-03-15 19:20:57,664 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 107 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:20:57,665 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 61 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 612 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:20:57,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1545 states. [2022-03-15 19:20:57,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1545 to 790. [2022-03-15 19:20:57,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 790 states, 789 states have (on average 3.49936628643853) internal successors, (2761), 789 states have internal predecessors, (2761), 0 states have call successors, (0), 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:20:57,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 2761 transitions. [2022-03-15 19:20:57,683 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 2761 transitions. Word has length 24 [2022-03-15 19:20:57,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:20:57,684 INFO L470 AbstractCegarLoop]: Abstraction has 790 states and 2761 transitions. [2022-03-15 19:20:57,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 0 states have call successors, (0), 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:20:57,684 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 2761 transitions. [2022-03-15 19:20:57,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:20:57,685 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:20:57,685 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:20:57,723 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:20:57,907 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:20:57,907 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:20:57,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:20:57,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1816939623, now seen corresponding path program 3 times [2022-03-15 19:20:57,908 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:20:57,909 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940316955] [2022-03-15 19:20:57,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:20:57,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:20:57,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:20:58,117 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:20:58,117 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:20:58,118 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940316955] [2022-03-15 19:20:58,118 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940316955] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:20:58,118 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047653325] [2022-03-15 19:20:58,118 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:20:58,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:20:58,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:20:58,119 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:20:58,119 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:20:58,195 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 19:20:58,195 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:20:58,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 54 conjunts are in the unsatisfiable core [2022-03-15 19:20:58,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:20:58,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:20:58,378 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 18 treesize of output 20 [2022-03-15 19:20:58,404 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-03-15 19:20:58,415 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:20:58,415 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:20:58,447 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_401 (Array Int Int))) (= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_401) c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0) c_~res2~0)) is different from false [2022-03-15 19:20:58,454 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_401 (Array Int Int))) (= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_401) c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0) |c_thread2Thread1of1ForFork1_~tmp~1#1|)) is different from false [2022-03-15 19:20:58,462 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:20:58,462 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 54 treesize of output 46 [2022-03-15 19:20:58,465 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 17 treesize of output 11 [2022-03-15 19:20:58,569 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-03-15 19:20:58,570 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1047653325] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:20:58,570 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:20:58,570 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 23 [2022-03-15 19:20:58,570 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1048526018] [2022-03-15 19:20:58,570 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:20:58,572 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:20:58,604 INFO L252 McrAutomatonBuilder]: Finished intersection with 128 states and 298 transitions. [2022-03-15 19:20:58,604 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:20:59,851 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [21727#(or (< 2147483647 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (< (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648) 0)), 21724#(= ~res1~0 |thread2Thread1of1ForFork1_~tmp~1#1|), 21726#(or (< 2147483647 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) |thread2Thread1of1ForFork1_~tmp~1#1|) (< (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 0)), 21732#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (= ~res1~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= ~res2~0 0)), 21729#(or (< 2147483647 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (= |thread2Thread1of1ForFork1_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (< (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648) 0)), 21731#(and (= ~A~0.offset 0) (= ~res1~0 0) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) |thread2Thread1of1ForFork1_~tmp~1#1|)), 21733#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (= ~res1~0 0) (= ~res2~0 0)), 21728#(and (= ~res2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= ~A~0.offset 0) (= ~res1~0 0)), 21730#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (= |thread2Thread1of1ForFork1_~tmp~1#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= ~res1~0 0)), 21725#(or (< 2147483647 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (< (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 0))] [2022-03-15 19:20:59,851 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 19:20:59,851 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:20:59,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 19:20:59,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=909, Unknown=2, NotChecked=126, Total=1190 [2022-03-15 19:20:59,852 INFO L87 Difference]: Start difference. First operand 790 states and 2761 transitions. Second operand has 22 states, 21 states have (on average 3.9047619047619047) internal successors, (82), 21 states have internal predecessors, (82), 0 states have call successors, (0), 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:21:00,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:21:00,459 INFO L93 Difference]: Finished difference Result 1246 states and 4281 transitions. [2022-03-15 19:21:00,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 19:21:00,459 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.9047619047619047) internal successors, (82), 21 states have internal predecessors, (82), 0 states have call successors, (0), 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:21:00,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:21:00,464 INFO L225 Difference]: With dead ends: 1246 [2022-03-15 19:21:00,464 INFO L226 Difference]: Without dead ends: 1239 [2022-03-15 19:21:00,465 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=283, Invalid=1615, Unknown=2, NotChecked=170, Total=2070 [2022-03-15 19:21:00,465 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 199 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 1053 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 1087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:21:00,466 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [199 Valid, 129 Invalid, 1087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1053 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:21:00,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2022-03-15 19:21:00,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 792. [2022-03-15 19:21:00,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 792 states, 791 states have (on average 3.4981036662452594) internal successors, (2767), 791 states have internal predecessors, (2767), 0 states have call successors, (0), 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:21:00,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 2767 transitions. [2022-03-15 19:21:00,483 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 2767 transitions. Word has length 24 [2022-03-15 19:21:00,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:21:00,483 INFO L470 AbstractCegarLoop]: Abstraction has 792 states and 2767 transitions. [2022-03-15 19:21:00,483 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.9047619047619047) internal successors, (82), 21 states have internal predecessors, (82), 0 states have call successors, (0), 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:21:00,483 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 2767 transitions. [2022-03-15 19:21:00,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:21:00,485 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:21:00,485 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:21:00,502 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:21:00,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:21:00,700 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:21:00,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:21:00,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1182937401, now seen corresponding path program 4 times [2022-03-15 19:21:00,701 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:21:00,701 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642734920] [2022-03-15 19:21:00,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:21:00,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:21:00,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:21:00,932 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:21:00,932 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:21:00,932 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642734920] [2022-03-15 19:21:00,932 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642734920] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:21:00,932 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319290613] [2022-03-15 19:21:00,932 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:21:00,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:21:00,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:21:00,934 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:21:00,934 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:21:01,015 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:21:01,015 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:21:01,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 69 conjunts are in the unsatisfiable core [2022-03-15 19:21:01,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:21:01,028 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 18 treesize of output 16 [2022-03-15 19:21:01,044 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 19:21:01,058 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 19:21:01,093 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 19:21:01,135 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 18 treesize of output 20 [2022-03-15 19:21:01,145 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-03-15 19:21:01,173 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:21:01,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:21:01,210 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_455 (Array Int Int))) (= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_455) c_~A~0.base) (+ c_~A~0.offset (* |c_thread2Thread1of1ForFork1_~i~1#1| 4))) c_~res2~0 (* (- 1) c_~res1~0)) 0)) is different from false [2022-03-15 19:21:01,216 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_455 (Array Int Int))) (= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_455) c_~A~0.base) (+ c_~A~0.offset (* |c_thread2Thread1of1ForFork1_~i~1#1| 4))) c_~res2~0 (* (- 1) (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))) (* (- 1) c_~res1~0)) 0)) is different from false [2022-03-15 19:21:01,220 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_455 (Array Int Int))) (= (+ c_~res2~0 (* (- 1) (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_455) c_~A~0.base) c_~A~0.offset) (* (- 1) c_~res1~0)) 0)) is different from false [2022-03-15 19:21:01,230 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_454 (Array Int Int)) (v_ArrVal_455 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_454))) (+ c_~res2~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_455) c_~A~0.base) c_~A~0.offset) (* (- 1) (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))) (* (- 1) c_~res1~0))) 0)) is different from false [2022-03-15 19:21:01,235 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_454 (Array Int Int)) (v_ArrVal_455 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_454))) (+ c_~res2~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_455) c_~A~0.base) c_~A~0.offset) (* (- 1) (select (select .cse0 c_~A~0.base) c_~A~0.offset)) (* (- 1) c_~res1~0))) 0)) is different from false [2022-03-15 19:21:01,249 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_454 (Array Int Int)) (v_ArrVal_453 (Array Int Int)) (v_ArrVal_455 (Array Int Int))) (= (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_453) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_454))) (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_455) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~res2~0 (* (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (- 1)) (* (- 1) c_~res1~0))) 0)) is different from false [2022-03-15 19:21:01,254 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:21:01,254 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 58 treesize of output 47 [2022-03-15 19:21:01,268 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1534 treesize of output 1454 [2022-03-15 19:21:01,273 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 1454 treesize of output 1390 [2022-03-15 19:21:01,281 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 1390 treesize of output 1326 [2022-03-15 19:21:01,287 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 1326 treesize of output 1286 [2022-03-15 19:21:03,393 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-03-15 19:21:03,393 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [319290613] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:21:03,393 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:21:03,393 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2022-03-15 19:21:03,393 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1731032154] [2022-03-15 19:21:03,393 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:21:03,395 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:21:03,412 INFO L252 McrAutomatonBuilder]: Finished intersection with 126 states and 285 transitions. [2022-03-15 19:21:03,412 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:21:04,757 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [24631#(= (+ (* (- 1) ~res1~0) |thread2Thread1of1ForFork1_~tmp~1#1|) 0), 24747#(and (= ~A~0.offset 0) (= ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= ~res2~0 0)), 24745#(or (< 2147483647 (+ ~res2~0 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)))) (< (+ ~res2~0 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 2147483648) 0) (= ~res1~0 (+ ~res2~0 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))))), 24746#(or (< (+ ~res2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648) 0) (= ~res1~0 (+ ~res2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (< 2147483647 (+ ~res2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)))), 24748#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (= ~res1~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (= ~res2~0 0)), 24749#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (= ~res1~0 0) (= ~res2~0 0))] [2022-03-15 19:21:04,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:21:04,757 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:21:04,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:21:04,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=316, Unknown=6, NotChecked=246, Total=650 [2022-03-15 19:21:04,758 INFO L87 Difference]: Start difference. First operand 792 states and 2767 transitions. Second operand has 18 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 16 states have internal predecessors, (60), 0 states have call successors, (0), 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:21:05,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:21:05,236 INFO L93 Difference]: Finished difference Result 1621 states and 5569 transitions. [2022-03-15 19:21:05,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 19:21:05,236 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 16 states have internal predecessors, (60), 0 states have call successors, (0), 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:21:05,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:21:05,242 INFO L225 Difference]: With dead ends: 1621 [2022-03-15 19:21:05,242 INFO L226 Difference]: Without dead ends: 1614 [2022-03-15 19:21:05,242 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 106 SyntacticMatches, 24 SemanticMatches, 32 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=155, Invalid=619, Unknown=6, NotChecked=342, Total=1122 [2022-03-15 19:21:05,243 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 140 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:21:05,243 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 108 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 955 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:21:05,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1614 states. [2022-03-15 19:21:05,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1614 to 788. [2022-03-15 19:21:05,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 787 states have (on average 3.4955527318932655) internal successors, (2751), 787 states have internal predecessors, (2751), 0 states have call successors, (0), 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:21:05,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 2751 transitions. [2022-03-15 19:21:05,263 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 2751 transitions. Word has length 24 [2022-03-15 19:21:05,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:21:05,263 INFO L470 AbstractCegarLoop]: Abstraction has 788 states and 2751 transitions. [2022-03-15 19:21:05,263 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 16 states have internal predecessors, (60), 0 states have call successors, (0), 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:21:05,263 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 2751 transitions. [2022-03-15 19:21:05,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:21:05,265 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:21:05,265 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:21:05,284 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:21:05,484 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,SelfDestructingSolverStorable11 [2022-03-15 19:21:05,485 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:21:05,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:21:05,485 INFO L85 PathProgramCache]: Analyzing trace with hash 75172757, now seen corresponding path program 3 times [2022-03-15 19:21:05,486 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:21:05,486 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576402610] [2022-03-15 19:21:05,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:21:05,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:21:05,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:21:05,739 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:21:05,739 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:21:05,739 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576402610] [2022-03-15 19:21:05,739 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576402610] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:21:05,739 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [378028041] [2022-03-15 19:21:05,739 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:21:05,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:21:05,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:21:05,741 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:21:05,742 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:21:05,828 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 19:21:05,828 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:21:05,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 71 conjunts are in the unsatisfiable core [2022-03-15 19:21:05,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:21:05,877 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 11 treesize of output 7 [2022-03-15 19:21:05,923 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:21:06,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:21:06,053 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 14 treesize of output 16 [2022-03-15 19:21:06,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:21:06,107 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 14 treesize of output 16 [2022-03-15 19:21:06,191 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:21:06,192 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:21:06,193 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 17 treesize of output 10 [2022-03-15 19:21:06,219 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:21:06,220 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:21:06,531 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:21:06,531 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 55 treesize of output 44 [2022-03-15 19:21:06,540 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:21:06,540 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 410 treesize of output 374 [2022-03-15 19:21:06,544 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 362 treesize of output 314 [2022-03-15 19:21:06,548 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 314 treesize of output 290 [2022-03-15 19:21:06,557 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:21:06,557 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 290 treesize of output 274 [2022-03-15 19:21:06,953 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:21:06,954 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [378028041] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:21:06,954 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:21:06,954 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2022-03-15 19:21:06,954 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1233186680] [2022-03-15 19:21:06,954 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:21:06,957 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:21:06,977 INFO L252 McrAutomatonBuilder]: Finished intersection with 124 states and 280 transitions. [2022-03-15 19:21:06,977 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:21:08,836 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [28131#(or (= ~res2~0 ~res1~0) (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)), 28132#(or (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0) 2147483647)) (= ~res1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0)) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 2) ~N~0) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648))) (not (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0))), 28134#(or (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0) 2147483647)) (< (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (= ~res1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0)) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648))) (not (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0)) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)), 28130#(or (= ~res2~0 ~res1~0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)), 28133#(or (< (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (= ~res1~0 |thread3Thread1of1ForFork2_~tmp~2#1|) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0))] [2022-03-15 19:21:08,836 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 19:21:08,836 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:21:08,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 19:21:08,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=967, Unknown=10, NotChecked=0, Total=1122 [2022-03-15 19:21:08,837 INFO L87 Difference]: Start difference. First operand 788 states and 2751 transitions. Second operand has 17 states, 16 states have (on average 4.4375) internal successors, (71), 16 states have internal predecessors, (71), 0 states have call successors, (0), 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:21:09,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:21:09,650 INFO L93 Difference]: Finished difference Result 1816 states and 6151 transitions. [2022-03-15 19:21:09,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 19:21:09,651 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.4375) internal successors, (71), 16 states have internal predecessors, (71), 0 states have call successors, (0), 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:21:09,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:21:09,658 INFO L225 Difference]: With dead ends: 1816 [2022-03-15 19:21:09,658 INFO L226 Difference]: Without dead ends: 1809 [2022-03-15 19:21:09,658 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 94 SyntacticMatches, 11 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 811 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=322, Invalid=2020, Unknown=10, NotChecked=0, Total=2352 [2022-03-15 19:21:09,659 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 200 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:21:09,659 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [200 Valid, 70 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:21:09,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2022-03-15 19:21:09,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 800. [2022-03-15 19:21:09,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 799 states have (on average 3.4893617021276597) internal successors, (2788), 799 states have internal predecessors, (2788), 0 states have call successors, (0), 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:21:09,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 2788 transitions. [2022-03-15 19:21:09,677 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 2788 transitions. Word has length 24 [2022-03-15 19:21:09,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:21:09,678 INFO L470 AbstractCegarLoop]: Abstraction has 800 states and 2788 transitions. [2022-03-15 19:21:09,678 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.4375) internal successors, (71), 16 states have internal predecessors, (71), 0 states have call successors, (0), 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:21:09,678 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 2788 transitions. [2022-03-15 19:21:09,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:21:09,679 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:21:09,679 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:21:09,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-15 19:21:09,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-03-15 19:21:09,896 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:21:09,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:21:09,896 INFO L85 PathProgramCache]: Analyzing trace with hash -364288757, now seen corresponding path program 5 times [2022-03-15 19:21:09,897 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:21:09,897 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213854799] [2022-03-15 19:21:09,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:21:09,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:21:09,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:21:10,039 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:21:10,040 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:21:10,040 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213854799] [2022-03-15 19:21:10,040 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213854799] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:21:10,040 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430917550] [2022-03-15 19:21:10,040 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:21:10,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:21:10,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:21:10,041 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:21:10,042 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:21:10,132 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:21:10,132 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:21:10,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 62 conjunts are in the unsatisfiable core [2022-03-15 19:21:10,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:21:10,172 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 11 treesize of output 7 [2022-03-15 19:21:10,204 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:21:10,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:21:10,282 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 14 treesize of output 16 [2022-03-15 19:21:10,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:21:10,312 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 14 treesize of output 16 [2022-03-15 19:21:10,348 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-03-15 19:21:10,373 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:21:10,373 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:21:10,422 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_553 (Array Int Int))) (= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_553) c_~A~0.base) c_~A~0.offset) c_~res2~0 (* (- 1) c_~res1~0)) 0)) is different from false [2022-03-15 19:21:10,431 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_553 (Array Int Int)) (v_ArrVal_552 (Array Int Int))) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_552) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_553) c_~A~0.base) c_~A~0.offset) (* (- 1) c_~res1~0)) 0)) is different from false [2022-03-15 19:21:10,441 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_553 (Array Int Int)) (v_ArrVal_552 (Array Int Int))) (= (+ c_~res2~0 (* (- 1) (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_552) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_553) c_~A~0.base) c_~A~0.offset) (* (- 1) c_~res1~0)) 0)) is different from false [2022-03-15 19:21:10,445 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_553 (Array Int Int)) (v_ArrVal_552 (Array Int Int))) (= (+ (* (- 1) (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset)) c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_552) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_553) c_~A~0.base) c_~A~0.offset) (* (- 1) c_~res1~0)) 0)) is different from false [2022-03-15 19:21:10,452 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_551 (Array Int Int)) (v_ArrVal_553 (Array Int Int)) (v_ArrVal_552 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_551))) (+ (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_552) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_553) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (* (- 1) (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~res2~0 (* (- 1) c_~res1~0))) 0)) is different from false [2022-03-15 19:21:10,459 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:21:10,459 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 55 treesize of output 44 [2022-03-15 19:21:10,466 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1590 treesize of output 1462 [2022-03-15 19:21:10,471 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 1462 treesize of output 1398 [2022-03-15 19:21:10,476 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 1398 treesize of output 1366 [2022-03-15 19:21:10,480 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 1366 treesize of output 1302 [2022-03-15 19:21:11,292 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-03-15 19:21:11,293 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1430917550] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:21:11,293 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:21:11,293 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 23 [2022-03-15 19:21:11,293 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1381781769] [2022-03-15 19:21:11,293 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:21:11,295 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:21:11,311 INFO L252 McrAutomatonBuilder]: Finished intersection with 122 states and 277 transitions. [2022-03-15 19:21:11,311 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:21:12,551 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [31639#(= (+ (* (- 1) ~res1~0) |thread2Thread1of1ForFork1_~tmp~1#1|) 0), 31745#(or (< (+ ~res2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648) 0) (= ~res1~0 (+ ~res2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (< 2147483647 (+ ~res2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)))), 31744#(or (< 2147483647 (+ ~res2~0 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)))) (< (+ ~res2~0 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) 2147483648) 0) (= ~res1~0 (+ ~res2~0 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)))))] [2022-03-15 19:21:12,551 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 19:21:12,551 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:21:12,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 19:21:12,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=386, Unknown=5, NotChecked=220, Total=702 [2022-03-15 19:21:12,552 INFO L87 Difference]: Start difference. First operand 800 states and 2788 transitions. Second operand has 13 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 0 states have call successors, (0), 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:21:12,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:21:12,842 INFO L93 Difference]: Finished difference Result 1484 states and 5036 transitions. [2022-03-15 19:21:12,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 19:21:12,842 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 0 states have call successors, (0), 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:21:12,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:21:12,847 INFO L225 Difference]: With dead ends: 1484 [2022-03-15 19:21:12,847 INFO L226 Difference]: Without dead ends: 1477 [2022-03-15 19:21:12,848 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 102 SyntacticMatches, 22 SemanticMatches, 30 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=130, Invalid=587, Unknown=5, NotChecked=270, Total=992 [2022-03-15 19:21:12,848 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 128 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:21:12,849 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 54 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:21:12,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1477 states. [2022-03-15 19:21:12,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1477 to 794. [2022-03-15 19:21:12,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 793 states have (on average 3.490542244640605) internal successors, (2768), 793 states have internal predecessors, (2768), 0 states have call successors, (0), 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:21:12,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 2768 transitions. [2022-03-15 19:21:12,866 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 2768 transitions. Word has length 24 [2022-03-15 19:21:12,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:21:12,866 INFO L470 AbstractCegarLoop]: Abstraction has 794 states and 2768 transitions. [2022-03-15 19:21:12,866 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 0 states have call successors, (0), 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:21:12,866 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 2768 transitions. [2022-03-15 19:21:12,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:21:12,868 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:21:12,868 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:21:12,886 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:21:13,084 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,SelfDestructingSolverStorable13 [2022-03-15 19:21:13,084 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:21:13,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:21:13,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1713279779, now seen corresponding path program 6 times [2022-03-15 19:21:13,085 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:21:13,085 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060542836] [2022-03-15 19:21:13,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:21:13,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:21:13,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:21:13,239 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:21:13,239 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:21:13,239 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060542836] [2022-03-15 19:21:13,239 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060542836] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:21:13,240 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692272963] [2022-03-15 19:21:13,240 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:21:13,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:21:13,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:21:13,241 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:21:13,241 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:21:13,324 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-03-15 19:21:13,324 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:21:13,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 54 conjunts are in the unsatisfiable core [2022-03-15 19:21:13,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:21:13,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:21:13,484 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 18 treesize of output 20 [2022-03-15 19:21:13,515 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-03-15 19:21:13,527 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:21:13,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:21:13,560 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_598 (Array Int Int))) (= (+ c_~res1~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_598) c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))) c_~res2~0)) is different from false [2022-03-15 19:21:13,563 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_598 (Array Int Int))) (= (+ c_~res1~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_598) c_~A~0.base) c_~A~0.offset)) c_~res2~0)) is different from false [2022-03-15 19:21:13,568 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_598 (Array Int Int))) (= (+ c_~res1~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_598) c_~A~0.base) c_~A~0.offset)) |c_thread2Thread1of1ForFork1_~tmp~1#1|)) is different from false [2022-03-15 19:21:13,580 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:21:13,581 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 46 treesize of output 38 [2022-03-15 19:21:13,584 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 13 treesize of output 11 [2022-03-15 19:21:13,654 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-03-15 19:21:13,654 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692272963] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:21:13,654 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:21:13,654 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2022-03-15 19:21:13,655 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [131772424] [2022-03-15 19:21:13,655 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:21:13,657 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:21:13,674 INFO L252 McrAutomatonBuilder]: Finished intersection with 128 states and 298 transitions. [2022-03-15 19:21:13,674 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:21:14,992 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [34994#(and (= ~res2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= ~A~0.offset 0) (= ~res1~0 0)), 34993#(or (< 2147483647 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (< (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648) 0)), 34995#(or (< 2147483647 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (= |thread2Thread1of1ForFork1_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (< (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648) 0)), 34992#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~A~0.offset 0) (= |thread2Thread1of1ForFork1_~tmp~1#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= ~res1~0 0)), 34991#(or (< 2147483647 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) |thread2Thread1of1ForFork1_~tmp~1#1|) (< (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 0)), 34996#(and (= ~A~0.offset 0) (= ~res1~0 0) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) |thread2Thread1of1ForFork1_~tmp~1#1|)), 34989#(or (< 2147483647 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (< (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 0)), 34990#(= ~res1~0 |thread2Thread1of1ForFork1_~tmp~1#1|)] [2022-03-15 19:21:14,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:21:14,992 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:21:14,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:21:14,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=649, Unknown=3, NotChecked=162, Total=930 [2022-03-15 19:21:14,993 INFO L87 Difference]: Start difference. First operand 794 states and 2768 transitions. Second operand has 18 states, 17 states have (on average 4.588235294117647) internal successors, (78), 17 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:21:15,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:21:15,468 INFO L93 Difference]: Finished difference Result 1307 states and 4486 transitions. [2022-03-15 19:21:15,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 19:21:15,468 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.588235294117647) internal successors, (78), 17 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 24 [2022-03-15 19:21:15,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:21:15,472 INFO L225 Difference]: With dead ends: 1307 [2022-03-15 19:21:15,472 INFO L226 Difference]: Without dead ends: 1300 [2022-03-15 19:21:15,472 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 125 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=197, Invalid=1072, Unknown=3, NotChecked=210, Total=1482 [2022-03-15 19:21:15,473 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 137 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 922 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:21:15,473 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 106 Invalid, 950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 922 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:21:15,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1300 states. [2022-03-15 19:21:15,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1300 to 792. [2022-03-15 19:21:15,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 792 states, 791 states have (on average 3.4917825537294562) internal successors, (2762), 791 states have internal predecessors, (2762), 0 states have call successors, (0), 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:21:15,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 2762 transitions. [2022-03-15 19:21:15,501 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 2762 transitions. Word has length 24 [2022-03-15 19:21:15,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:21:15,502 INFO L470 AbstractCegarLoop]: Abstraction has 792 states and 2762 transitions. [2022-03-15 19:21:15,502 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.588235294117647) internal successors, (78), 17 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:21:15,502 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 2762 transitions. [2022-03-15 19:21:15,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 19:21:15,505 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:21:15,505 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, 1] [2022-03-15 19:21:15,521 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:21:15,707 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,SelfDestructingSolverStorable14 [2022-03-15 19:21:15,707 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:21:15,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:21:15,708 INFO L85 PathProgramCache]: Analyzing trace with hash -2076449082, now seen corresponding path program 4 times [2022-03-15 19:21:15,708 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:21:15,708 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670176952] [2022-03-15 19:21:15,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:21:15,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:21:15,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:21:15,764 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:21:15,764 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:21:15,764 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670176952] [2022-03-15 19:21:15,764 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670176952] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:21:15,764 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676967121] [2022-03-15 19:21:15,764 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:21:15,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:21:15,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:21:15,780 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:21:15,781 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:21:15,866 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:21:15,866 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:21:15,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 19:21:15,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:21:15,979 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:21:15,979 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:21:16,079 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:21:16,079 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676967121] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:21:16,079 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:21:16,079 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 19 [2022-03-15 19:21:16,079 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1239254631] [2022-03-15 19:21:16,079 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:21:16,082 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:21:16,110 INFO L252 McrAutomatonBuilder]: Finished intersection with 189 states and 473 transitions. [2022-03-15 19:21:16,110 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:21:17,565 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [38068#(or (<= ~N~0 |thread1Thread1of1ForFork0_~i~0#1|) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| 2) ~N~0)), 38069#(or (<= ~N~0 0) (<= 2 ~N~0))] [2022-03-15 19:21:17,565 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 19:21:17,565 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:21:17,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 19:21:17,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2022-03-15 19:21:17,565 INFO L87 Difference]: Start difference. First operand 792 states and 2762 transitions. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 9 states have internal predecessors, (70), 0 states have call successors, (0), 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:21:17,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:21:17,769 INFO L93 Difference]: Finished difference Result 1184 states and 4033 transitions. [2022-03-15 19:21:17,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 19:21:17,769 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 9 states have internal predecessors, (70), 0 states have call successors, (0), 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:21:17,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:21:17,772 INFO L225 Difference]: With dead ends: 1184 [2022-03-15 19:21:17,772 INFO L226 Difference]: Without dead ends: 1184 [2022-03-15 19:21:17,773 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 186 SyntacticMatches, 12 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=548, Unknown=0, NotChecked=0, Total=702 [2022-03-15 19:21:17,773 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 104 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:21:17,773 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 45 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:21:17,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2022-03-15 19:21:17,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 786. [2022-03-15 19:21:17,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 786 states, 785 states have (on average 3.4420382165605097) internal successors, (2702), 785 states have internal predecessors, (2702), 0 states have call successors, (0), 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:21:17,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 2702 transitions. [2022-03-15 19:21:17,787 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 2702 transitions. Word has length 25 [2022-03-15 19:21:17,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:21:17,787 INFO L470 AbstractCegarLoop]: Abstraction has 786 states and 2702 transitions. [2022-03-15 19:21:17,787 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 9 states have internal predecessors, (70), 0 states have call successors, (0), 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:21:17,787 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 2702 transitions. [2022-03-15 19:21:17,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 19:21:17,788 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:21:17,789 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, 1] [2022-03-15 19:21:17,805 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:21:17,989 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,SelfDestructingSolverStorable15 [2022-03-15 19:21:17,989 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:21:17,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:21:17,989 INFO L85 PathProgramCache]: Analyzing trace with hash 621934108, now seen corresponding path program 7 times [2022-03-15 19:21:17,990 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:21:17,990 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796970987] [2022-03-15 19:21:17,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:21:17,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:21:18,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:21:18,040 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:21:18,040 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:21:18,040 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796970987] [2022-03-15 19:21:18,040 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796970987] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:21:18,040 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743624462] [2022-03-15 19:21:18,041 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:21:18,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:21:18,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:21:18,042 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:21:18,043 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:21:18,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:21:18,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 19:21:18,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:21:18,191 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:21:18,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:21:18,243 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:21:18,243 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743624462] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:21:18,243 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:21:18,243 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-03-15 19:21:18,243 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1985817408] [2022-03-15 19:21:18,243 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:21:18,261 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:21:18,294 INFO L252 McrAutomatonBuilder]: Finished intersection with 225 states and 584 transitions. [2022-03-15 19:21:18,294 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:21:20,300 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [40995#(or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (<= ~N~0 |thread1Thread1of1ForFork0_~i~0#1|)), 40997#(or (<= ~N~0 1) (< 2 ~N~0)), 40996#(or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 2) ~N~0) (<= ~N~0 (+ |thread1Thread1of1ForFork0_~i~0#1| 1))), 40994#(< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)] [2022-03-15 19:21:20,301 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 19:21:20,301 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:21:20,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 19:21:20,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2022-03-15 19:21:20,301 INFO L87 Difference]: Start difference. First operand 786 states and 2702 transitions. Second operand has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 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:21:20,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:21:20,442 INFO L93 Difference]: Finished difference Result 930 states and 2946 transitions. [2022-03-15 19:21:20,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 19:21:20,442 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 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:21:20,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:21:20,444 INFO L225 Difference]: With dead ends: 930 [2022-03-15 19:21:20,444 INFO L226 Difference]: Without dead ends: 922 [2022-03-15 19:21:20,444 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 236 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2022-03-15 19:21:20,445 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 116 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:21:20,445 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 40 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:21:20,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2022-03-15 19:21:20,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 764. [2022-03-15 19:21:20,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 764 states, 763 states have (on average 3.238532110091743) internal successors, (2471), 763 states have internal predecessors, (2471), 0 states have call successors, (0), 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:21:20,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 2471 transitions. [2022-03-15 19:21:20,458 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 2471 transitions. Word has length 25 [2022-03-15 19:21:20,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:21:20,458 INFO L470 AbstractCegarLoop]: Abstraction has 764 states and 2471 transitions. [2022-03-15 19:21:20,458 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 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:21:20,458 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 2471 transitions. [2022-03-15 19:21:20,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:21:20,462 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:21:20,462 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, 1] [2022-03-15 19:21:20,478 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:21:20,664 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,SelfDestructingSolverStorable16 [2022-03-15 19:21:20,665 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:21:20,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:21:20,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1403739543, now seen corresponding path program 5 times [2022-03-15 19:21:20,666 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:21:20,666 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964775720] [2022-03-15 19:21:20,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:21:20,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:21:20,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:21:20,720 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:21:20,720 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:21:20,720 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964775720] [2022-03-15 19:21:20,720 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964775720] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:21:20,720 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806168881] [2022-03-15 19:21:20,720 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:21:20,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:21:20,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:21:20,722 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:21:20,743 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:21:20,816 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:21:20,816 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:21:20,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 19:21:20,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:21:20,925 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:21:20,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:21:21,018 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:21:21,019 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806168881] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:21:21,019 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:21:21,019 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 21 [2022-03-15 19:21:21,019 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [904964582] [2022-03-15 19:21:21,019 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:21:21,021 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:21:21,058 INFO L252 McrAutomatonBuilder]: Finished intersection with 222 states and 570 transitions. [2022-03-15 19:21:21,058 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:21:23,534 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [43634#(< |thread2Thread1of1ForFork1_~i~1#1| ~M~0), 43580#(or (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0)), 43588#(or (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 2) ~N~0) (< 0 ~M~0)), 43640#(or (<= ~N~0 ~M~0) (<= (+ 2 ~M~0) ~N~0)), 43635#(< 0 ~M~0), 43639#(or (<= ~N~0 |thread3Thread1of1ForFork2_~i~2#1|) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 2) ~N~0) (< 0 ~M~0)), 43644#(and (or (= |thread2Thread1of1ForFork1_~i~1#1| 0) (not (< ~M~0 ~N~0))) (or (<= 2 ~N~0) (not (< ~M~0 ~N~0)))), 43636#(or (<= ~N~0 |thread3Thread1of1ForFork2_~i~2#1|) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 2) ~N~0)), 43641#(and (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 2) (+ ~N~0 ~M~0)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 43633#(<= (+ |thread3Thread1of1ForFork2_~i~2#1| 2) ~N~0), 43642#(and (or (not (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)) (or (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 2) (+ ~N~0 ~M~0)) (not (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0)))), 43638#(or (<= ~N~0 |thread3Thread1of1ForFork2_~i~2#1|) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 2) ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)), 43643#(or (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= ~N~0 ~M~0) (<= (+ 2 ~M~0) ~N~0)), 43645#(or (< 0 ~M~0) (<= ~N~0 ~M~0) (<= (+ 2 ~M~0) ~N~0)), 43584#(or (< 0 ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0)), 43637#(or (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 2) ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0))] [2022-03-15 19:21:23,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 19:21:23,534 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:21:23,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 19:21:23,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=975, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 19:21:23,535 INFO L87 Difference]: Start difference. First operand 764 states and 2471 transitions. Second operand has 25 states, 25 states have (on average 6.96) internal successors, (174), 24 states have internal predecessors, (174), 0 states have call successors, (0), 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:21:25,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:21:25,963 INFO L93 Difference]: Finished difference Result 1684 states and 5238 transitions. [2022-03-15 19:21:25,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-03-15 19:21:25,963 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 6.96) internal successors, (174), 24 states have internal predecessors, (174), 0 states have call successors, (0), 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:21:25,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:21:25,967 INFO L225 Difference]: With dead ends: 1684 [2022-03-15 19:21:25,967 INFO L226 Difference]: Without dead ends: 1684 [2022-03-15 19:21:25,968 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 216 SyntacticMatches, 5 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2793 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1727, Invalid=7779, Unknown=0, NotChecked=0, Total=9506 [2022-03-15 19:21:25,969 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 317 mSDsluCounter, 1575 mSDsCounter, 0 mSdLazyCounter, 2762 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 2823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 2762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:21:25,969 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [317 Valid, 354 Invalid, 2823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 2762 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 19:21:25,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1684 states. [2022-03-15 19:21:25,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1684 to 858. [2022-03-15 19:21:25,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 858 states, 857 states have (on average 3.3442240373395564) internal successors, (2866), 857 states have internal predecessors, (2866), 0 states have call successors, (0), 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:21:25,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 2866 transitions. [2022-03-15 19:21:25,991 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 2866 transitions. Word has length 26 [2022-03-15 19:21:25,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:21:25,991 INFO L470 AbstractCegarLoop]: Abstraction has 858 states and 2866 transitions. [2022-03-15 19:21:25,991 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 6.96) internal successors, (174), 24 states have internal predecessors, (174), 0 states have call successors, (0), 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:21:25,991 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 2866 transitions. [2022-03-15 19:21:25,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:21:25,993 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:21:25,993 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, 1] [2022-03-15 19:21:26,013 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:21:26,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:21:26,203 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:21:26,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:21:26,204 INFO L85 PathProgramCache]: Analyzing trace with hash -2067277141, now seen corresponding path program 8 times [2022-03-15 19:21:26,204 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:21:26,204 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373612062] [2022-03-15 19:21:26,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:21:26,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:21:26,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:21:26,295 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:21:26,296 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:21:26,296 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373612062] [2022-03-15 19:21:26,296 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373612062] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:21:26,296 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354007975] [2022-03-15 19:21:26,296 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:21:26,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:21:26,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:21:26,297 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:21:26,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-03-15 19:21:26,390 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:21:26,391 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:21:26,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 19:21:26,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:21:26,508 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:21:26,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:21:26,609 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:21:26,610 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354007975] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:21:26,610 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:21:26,610 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20 [2022-03-15 19:21:26,610 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [778146412] [2022-03-15 19:21:26,610 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:21:26,612 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:21:26,652 INFO L252 McrAutomatonBuilder]: Finished intersection with 226 states and 585 transitions. [2022-03-15 19:21:26,652 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:21:29,315 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [47354#(or (not (< 0 ~M~0)) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 2) (+ ~N~0 ~M~0))), 47345#(< |thread3Thread1of1ForFork2_~i~2#1| ~N~0), 47352#(and (or (<= 2 ~N~0) (not (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0))) (or (= |thread2Thread1of1ForFork1_~i~1#1| 0) (not (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)))), 47347#(or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (<= (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~M~0)), 47353#(or (<= 2 ~M~0) (<= ~M~0 0)), 47348#(or (<= (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~M~0) (< ~M~0 ~N~0)), 47349#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 2 ~N~0)), 47350#(and (or (= |thread2Thread1of1ForFork1_~i~1#1| 0) (not (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0))) (or (<= 2 ~M~0) (<= ~M~0 |thread2Thread1of1ForFork1_~i~1#1|))), 47355#(or (not (< 0 ~M~0)) (<= 2 ~N~0)), 47351#(and (or (= |thread2Thread1of1ForFork1_~i~1#1| 0) (not (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0))) (or (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 2) (+ ~N~0 ~M~0)) (not (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)))), 47346#(< ~M~0 ~N~0)] [2022-03-15 19:21:29,315 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 19:21:29,315 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:21:29,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 19:21:29,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=845, Unknown=0, NotChecked=0, Total=992 [2022-03-15 19:21:29,316 INFO L87 Difference]: Start difference. First operand 858 states and 2866 transitions. Second operand has 21 states, 21 states have (on average 6.9523809523809526) internal successors, (146), 20 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:21:31,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:21:31,113 INFO L93 Difference]: Finished difference Result 1752 states and 5592 transitions. [2022-03-15 19:21:31,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-03-15 19:21:31,113 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.9523809523809526) internal successors, (146), 20 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 26 [2022-03-15 19:21:31,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:21:31,117 INFO L225 Difference]: With dead ends: 1752 [2022-03-15 19:21:31,117 INFO L226 Difference]: Without dead ends: 1752 [2022-03-15 19:21:31,118 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 209 SyntacticMatches, 19 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1992 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1341, Invalid=5301, Unknown=0, NotChecked=0, Total=6642 [2022-03-15 19:21:31,118 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 308 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 1855 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 1923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:21:31,119 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [308 Valid, 231 Invalid, 1923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1855 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 19:21:31,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2022-03-15 19:21:31,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 924. [2022-03-15 19:21:31,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 924 states, 923 states have (on average 3.304442036836403) internal successors, (3050), 923 states have internal predecessors, (3050), 0 states have call successors, (0), 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:21:31,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 3050 transitions. [2022-03-15 19:21:31,137 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 3050 transitions. Word has length 26 [2022-03-15 19:21:31,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:21:31,137 INFO L470 AbstractCegarLoop]: Abstraction has 924 states and 3050 transitions. [2022-03-15 19:21:31,137 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.9523809523809526) internal successors, (146), 20 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:21:31,138 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 3050 transitions. [2022-03-15 19:21:31,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:21:31,139 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:21:31,139 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, 1] [2022-03-15 19:21:31,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-03-15 19:21:31,350 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:21:31,350 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:21:31,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:21:31,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1462500419, now seen corresponding path program 6 times [2022-03-15 19:21:31,351 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:21:31,352 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270813505] [2022-03-15 19:21:31,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:21:31,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:21:31,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:21:31,416 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:21:31,416 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:21:31,416 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270813505] [2022-03-15 19:21:31,416 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270813505] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:21:31,416 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333113553] [2022-03-15 19:21:31,416 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:21:31,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:21:31,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:21:31,432 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:21:31,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-03-15 19:21:31,533 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 19:21:31,534 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:21:31,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 19:21:31,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:21:31,647 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:21:31,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:21:31,705 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:21:31,705 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333113553] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:21:31,705 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:21:31,705 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-03-15 19:21:31,705 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [678558887] [2022-03-15 19:21:31,705 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:21:31,708 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:21:31,766 INFO L252 McrAutomatonBuilder]: Finished intersection with 252 states and 652 transitions. [2022-03-15 19:21:31,766 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:21:33,102 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:21:33,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 19:21:33,102 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:21:33,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 19:21:33,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-03-15 19:21:33,102 INFO L87 Difference]: Start difference. First operand 924 states and 3050 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 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:21:33,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:21:33,217 INFO L93 Difference]: Finished difference Result 1082 states and 3402 transitions. [2022-03-15 19:21:33,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 19:21:33,217 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 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:21:33,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:21:33,219 INFO L225 Difference]: With dead ends: 1082 [2022-03-15 19:21:33,220 INFO L226 Difference]: Without dead ends: 1026 [2022-03-15 19:21:33,220 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 268 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-03-15 19:21:33,220 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 47 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:21:33,220 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 25 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:21:33,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2022-03-15 19:21:33,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 990. [2022-03-15 19:21:33,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 989 states have (on average 3.2133468149646105) internal successors, (3178), 989 states have internal predecessors, (3178), 0 states have call successors, (0), 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:21:33,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 3178 transitions. [2022-03-15 19:21:33,234 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 3178 transitions. Word has length 26 [2022-03-15 19:21:33,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:21:33,234 INFO L470 AbstractCegarLoop]: Abstraction has 990 states and 3178 transitions. [2022-03-15 19:21:33,235 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 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:21:33,235 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 3178 transitions. [2022-03-15 19:21:33,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:21:33,236 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:21:33,236 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, 1, 1] [2022-03-15 19:21:33,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-03-15 19:21:33,454 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:21:33,454 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:21:33,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:21:33,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1023038905, now seen corresponding path program 1 times [2022-03-15 19:21:33,455 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:21:33,455 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153920138] [2022-03-15 19:21:33,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:21:33,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:21:33,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:21:33,527 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:21:33,527 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:21:33,527 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153920138] [2022-03-15 19:21:33,527 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153920138] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:21:33,527 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500807223] [2022-03-15 19:21:33,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:21:33,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:21:33,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:21:33,528 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:21:33,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-03-15 19:21:33,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:21:33,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 19:21:33,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:21:33,691 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:21:33,691 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:21:33,772 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:21:33,773 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500807223] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:21:33,773 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:21:33,773 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2022-03-15 19:21:33,773 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [361709923] [2022-03-15 19:21:33,773 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:21:33,775 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:21:33,805 INFO L252 McrAutomatonBuilder]: Finished intersection with 186 states and 456 transitions. [2022-03-15 19:21:33,805 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:21:35,697 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [54458#(or (<= ~N~0 |thread3Thread1of1ForFork2_~i~2#1|) (<= ~M~0 |thread2Thread1of1ForFork1_~i~1#1|) (< (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~M~0)), 54455#(< (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~M~0), 54459#(or (<= ~N~0 |thread3Thread1of1ForFork2_~i~2#1|) (<= ~M~0 0) (< 1 ~M~0)), 54462#(and (or (= |thread2Thread1of1ForFork1_~i~1#1| 0) (not (< ~M~0 ~N~0))) (or (not (< ~M~0 ~N~0)) (<= ~M~0 0))), 54461#(and (or (not (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0)) (<= ~M~0 0)) (or (not (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0)) (= |thread2Thread1of1ForFork1_~i~1#1| 0))), 54463#(or (<= ~N~0 ~M~0) (<= ~M~0 0) (< 1 ~M~0)), 54454#(< |thread2Thread1of1ForFork1_~i~1#1| ~M~0), 54456#(or (<= ~M~0 |thread2Thread1of1ForFork1_~i~1#1|) (< (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~M~0)), 54460#(or (<= ~M~0 |thread2Thread1of1ForFork1_~i~1#1|) (< (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~M~0) (<= ~N~0 ~M~0)), 54457#(or (<= ~M~0 0) (< 1 ~M~0))] [2022-03-15 19:21:35,697 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:21:35,697 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:21:35,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:21:35,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=535, Unknown=0, NotChecked=0, Total=650 [2022-03-15 19:21:35,697 INFO L87 Difference]: Start difference. First operand 990 states and 3178 transitions. Second operand has 18 states, 18 states have (on average 6.833333333333333) internal successors, (123), 17 states have internal predecessors, (123), 0 states have call successors, (0), 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:21:36,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:21:36,343 INFO L93 Difference]: Finished difference Result 1000 states and 3036 transitions. [2022-03-15 19:21:36,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 19:21:36,343 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 6.833333333333333) internal successors, (123), 17 states have internal predecessors, (123), 0 states have call successors, (0), 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:21:36,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:21:36,345 INFO L225 Difference]: With dead ends: 1000 [2022-03-15 19:21:36,345 INFO L226 Difference]: Without dead ends: 940 [2022-03-15 19:21:36,346 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 190 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=334, Invalid=1226, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 19:21:36,346 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 173 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 951 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:21:36,346 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 123 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 951 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:21:36,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2022-03-15 19:21:36,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 894. [2022-03-15 19:21:36,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 893 states have (on average 3.141097424412094) internal successors, (2805), 893 states have internal predecessors, (2805), 0 states have call successors, (0), 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:21:36,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 2805 transitions. [2022-03-15 19:21:36,361 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 2805 transitions. Word has length 26 [2022-03-15 19:21:36,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:21:36,361 INFO L470 AbstractCegarLoop]: Abstraction has 894 states and 2805 transitions. [2022-03-15 19:21:36,361 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.833333333333333) internal successors, (123), 17 states have internal predecessors, (123), 0 states have call successors, (0), 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:21:36,361 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 2805 transitions. [2022-03-15 19:21:36,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:21:36,362 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:21:36,362 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, 1, 1] [2022-03-15 19:21:36,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-03-15 19:21:36,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:21:36,579 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:21:36,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:21:36,580 INFO L85 PathProgramCache]: Analyzing trace with hash 777986553, now seen corresponding path program 2 times [2022-03-15 19:21:36,580 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:21:36,580 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860352613] [2022-03-15 19:21:36,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:21:36,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:21:36,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:21:36,652 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:21:36,653 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:21:36,653 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860352613] [2022-03-15 19:21:36,653 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860352613] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:21:36,653 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629173731] [2022-03-15 19:21:36,653 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:21:36,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:21:36,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:21:36,654 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:21:36,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-03-15 19:21:36,752 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:21:36,753 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:21:36,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 19:21:36,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:21:36,831 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:21:36,831 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:21:36,906 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:21:36,906 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629173731] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:21:36,906 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:21:36,906 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 17 [2022-03-15 19:21:36,906 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [10368014] [2022-03-15 19:21:36,906 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:21:36,908 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:21:36,967 INFO L252 McrAutomatonBuilder]: Finished intersection with 204 states and 501 transitions. [2022-03-15 19:21:36,968 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:21:38,733 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [57459#(or (<= ~N~0 ~M~0) (<= ~M~0 0) (< 1 ~M~0)), 57454#(or (< (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~M~0) (<= ~N~0 ~M~0)), 57450#(or (<= ~N~0 |thread3Thread1of1ForFork2_~i~2#1|) (< (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~M~0)), 57451#(or (<= ~N~0 |thread3Thread1of1ForFork2_~i~2#1|) (<= ~M~0 |thread2Thread1of1ForFork1_~i~1#1|) (< (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~M~0)), 57455#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ ~N~0 |thread2Thread1of1ForFork1_~i~1#1|) ~M~0)), 57452#(<= ~N~0 ~M~0), 57457#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~N~0 1)), 57448#(< |thread2Thread1of1ForFork1_~i~1#1| ~M~0), 57449#(or (<= ~N~0 |thread3Thread1of1ForFork2_~i~2#1|) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)), 57456#(or (<= ~M~0 |thread2Thread1of1ForFork1_~i~1#1|) (< (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~M~0) (<= ~N~0 ~M~0)), 57453#(or (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= ~N~0 ~M~0)), 57458#(or (<= ~N~0 |thread3Thread1of1ForFork2_~i~2#1|) (<= ~M~0 0) (< 1 ~M~0))] [2022-03-15 19:21:38,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 19:21:38,734 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:21:38,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 19:21:38,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=726, Unknown=0, NotChecked=0, Total=870 [2022-03-15 19:21:38,734 INFO L87 Difference]: Start difference. First operand 894 states and 2805 transitions. Second operand has 21 states, 21 states have (on average 6.761904761904762) internal successors, (142), 20 states have internal predecessors, (142), 0 states have call successors, (0), 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:21:39,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:21:39,379 INFO L93 Difference]: Finished difference Result 1014 states and 3005 transitions. [2022-03-15 19:21:39,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-15 19:21:39,380 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.761904761904762) internal successors, (142), 20 states have internal predecessors, (142), 0 states have call successors, (0), 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:21:39,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:21:39,382 INFO L225 Difference]: With dead ends: 1014 [2022-03-15 19:21:39,382 INFO L226 Difference]: Without dead ends: 970 [2022-03-15 19:21:39,382 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 204 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=449, Invalid=1807, Unknown=0, NotChecked=0, Total=2256 [2022-03-15 19:21:39,382 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 195 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 1168 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 1203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:21:39,383 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [195 Valid, 142 Invalid, 1203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1168 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:21:39,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2022-03-15 19:21:39,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 808. [2022-03-15 19:21:39,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 807 states have (on average 3.1486988847583643) internal successors, (2541), 807 states have internal predecessors, (2541), 0 states have call successors, (0), 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:21:39,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 2541 transitions. [2022-03-15 19:21:39,396 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 2541 transitions. Word has length 26 [2022-03-15 19:21:39,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:21:39,396 INFO L470 AbstractCegarLoop]: Abstraction has 808 states and 2541 transitions. [2022-03-15 19:21:39,396 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.761904761904762) internal successors, (142), 20 states have internal predecessors, (142), 0 states have call successors, (0), 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:21:39,396 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 2541 transitions. [2022-03-15 19:21:39,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:21:39,398 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:21:39,398 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, 1] [2022-03-15 19:21:39,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-03-15 19:21:39,610 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:21:39,610 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:21:39,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:21:39,610 INFO L85 PathProgramCache]: Analyzing trace with hash -392681041, now seen corresponding path program 9 times [2022-03-15 19:21:39,611 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:21:39,611 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960620431] [2022-03-15 19:21:39,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:21:39,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:21:39,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:21:39,698 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:21:39,699 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:21:39,699 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960620431] [2022-03-15 19:21:39,699 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960620431] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:21:39,699 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992330073] [2022-03-15 19:21:39,699 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:21:39,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:21:39,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:21:39,700 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:21:39,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-03-15 19:21:39,802 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 19:21:39,802 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:21:39,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 19:21:39,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:21:39,898 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:21:39,898 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:21:39,967 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:21:39,968 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992330073] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:21:39,968 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:21:39,968 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-03-15 19:21:39,968 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [753514732] [2022-03-15 19:21:39,968 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:21:39,970 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:21:40,010 INFO L252 McrAutomatonBuilder]: Finished intersection with 258 states and 675 transitions. [2022-03-15 19:21:40,010 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:21:42,529 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [60293#(< |thread2Thread1of1ForFork1_~i~1#1| ~M~0), 60296#(or (<= ~M~0 (+ |thread2Thread1of1ForFork1_~i~1#1| 1)) (< (+ 2 |thread2Thread1of1ForFork1_~i~1#1|) ~M~0)), 60297#(or (<= ~M~0 1) (< 2 ~M~0)), 60295#(or (<= ~M~0 |thread2Thread1of1ForFork1_~i~1#1|) (< (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~M~0)), 60294#(< (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~M~0)] [2022-03-15 19:21:42,529 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 19:21:42,529 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:21:42,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 19:21:42,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2022-03-15 19:21:42,530 INFO L87 Difference]: Start difference. First operand 808 states and 2541 transitions. Second operand has 12 states, 12 states have (on average 8.166666666666666) internal successors, (98), 11 states have internal predecessors, (98), 0 states have call successors, (0), 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:21:42,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:21:42,774 INFO L93 Difference]: Finished difference Result 718 states and 2220 transitions. [2022-03-15 19:21:42,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 19:21:42,775 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.166666666666666) internal successors, (98), 11 states have internal predecessors, (98), 0 states have call successors, (0), 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:21:42,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:21:42,776 INFO L225 Difference]: With dead ends: 718 [2022-03-15 19:21:42,776 INFO L226 Difference]: Without dead ends: 557 [2022-03-15 19:21:42,777 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 265 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=146, Invalid=556, Unknown=0, NotChecked=0, Total=702 [2022-03-15 19:21:42,777 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 60 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:21:42,777 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 34 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:21:42,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2022-03-15 19:21:42,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 557. [2022-03-15 19:21:42,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 556 states have (on average 3.2553956834532376) internal successors, (1810), 556 states have internal predecessors, (1810), 0 states have call successors, (0), 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:21:42,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 1810 transitions. [2022-03-15 19:21:42,793 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 1810 transitions. Word has length 26 [2022-03-15 19:21:42,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:21:42,793 INFO L470 AbstractCegarLoop]: Abstraction has 557 states and 1810 transitions. [2022-03-15 19:21:42,794 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.166666666666666) internal successors, (98), 11 states have internal predecessors, (98), 0 states have call successors, (0), 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:21:42,794 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 1810 transitions. [2022-03-15 19:21:42,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 19:21:42,795 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:21:42,795 INFO L514 BasicCegarLoop]: trace histogram [2, 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:21:42,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-03-15 19:21:43,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:21:43,011 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:21:43,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:21:43,012 INFO L85 PathProgramCache]: Analyzing trace with hash -363619453, now seen corresponding path program 7 times [2022-03-15 19:21:43,013 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:21:43,013 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362405566] [2022-03-15 19:21:43,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:21:43,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:21:43,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:21:43,599 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:21:43,600 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:21:43,600 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362405566] [2022-03-15 19:21:43,600 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362405566] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:21:43,604 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57313411] [2022-03-15 19:21:43,604 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:21:43,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:21:43,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:21:43,605 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:21:43,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-03-15 19:21:43,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:21:43,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 91 conjunts are in the unsatisfiable core [2022-03-15 19:21:43,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:21:44,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:21:44,150 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:21:44,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:21:44,151 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:21:44,153 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:21:44,153 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 33 treesize of output 19 [2022-03-15 19:21:44,185 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:21:44,185 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:21:44,375 INFO L353 Elim1Store]: treesize reduction 47, result has 53.0 percent of original size [2022-03-15 19:21:44,375 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 42 treesize of output 62 [2022-03-15 19:21:44,836 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:21:44,836 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [57313411] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:21:44,836 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:21:44,836 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 36 [2022-03-15 19:21:44,836 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2118343380] [2022-03-15 19:21:44,836 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:21:44,839 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:21:44,895 INFO L252 McrAutomatonBuilder]: Finished intersection with 298 states and 788 transitions. [2022-03-15 19:21:44,895 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:22:08,691 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 72 new interpolants: [62350#(or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))), 62367#(and (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (not (<= (+ ~M~0 1) 0)) (<= |thread3Thread1of1ForFork2_~i~2#1| (+ ~N~0 ~M~0))) (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (<= (+ ~M~0 1) 0) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))))), 62340#(or (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 2) ~N~0) (= ~res1~0 |thread3Thread1of1ForFork2_~tmp~2#1|)), 62399#(and (or (not (<= (+ (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)) ~res2~0) 2147483647)) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (< (+ |thread1Thread1of1ForFork0_~i~0#1| 2) ~N~0) (not (< (+ ~M~0 1) ~N~0)) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 2147483648))) (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (<= 2 ~N~0) (not (<= 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)) ~res2~0 2147483648))) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0) 2147483647))) (or (<= (+ ~M~0 1) 0) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (< (+ |thread1Thread1of1ForFork0_~i~0#1| 2) ~N~0) (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ (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)) ~res2~0)) (not (< (+ ~M~0 1) ~N~0)) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 2147483648))) (not (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (not (<= 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)) ~res2~0 2147483648))) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0) 2147483647))) (or (<= (+ ~M~0 1) 0) (not (<= (+ (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)) ~res2~0) 2147483647)) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (< (+ |thread1Thread1of1ForFork0_~i~0#1| 2) ~N~0) (not (< (+ ~M~0 1) ~N~0)) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 2147483648))) (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0)) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0) 2147483647)) (< (+ (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)) ~res2~0) (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))))), 62391#(and (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0) 2147483647)) (<= (+ ~M~0 1) 0) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4))) 2147483647)) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (not (< (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0)) (< (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4))) (+ ~res1~0 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648)))) (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0) 2147483647)) (<= (+ ~M~0 1) 0) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (not (< (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4))))) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648))) (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4))))) (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0) 2147483647)) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4))) 2147483647)) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (not (< (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4))))) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648))) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 2) (+ ~N~0 ~M~0)))), 62377#(and (or (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0) 2147483647)) (<= (+ ~M~0 1) 0) (<= ~res1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0)) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648))) (not (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0))) (or (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0) 2147483647)) (<= (+ ~M~0 1) 0) (< (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0) (+ ~res1~0 1)) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648))) (not (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0))) (or (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0) 2147483647)) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) (+ ~N~0 ~M~0)) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648))) (not (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0)))), 62393#(and (or (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0) 2147483647)) (<= (+ ~M~0 1) 0) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4))))) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648))) (< (+ |thread1Thread1of1ForFork0_~i~0#1| 2) ~N~0) (not (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4))))) (or (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0) 2147483647)) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4))) 2147483647)) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4))))) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648))) (< (+ |thread1Thread1of1ForFork0_~i~0#1| 2) ~N~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 2) (+ ~N~0 ~M~0)) (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647))) (or (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0) 2147483647)) (<= (+ ~M~0 1) 0) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4))) 2147483647)) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (< (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4))) (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (not (< (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648))) (< (+ |thread1Thread1of1ForFork0_~i~0#1| 2) ~N~0) (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0)))), 62383#(and (or (< 2147483647 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 2147483647)) (not (<= (+ ~M~0 1) 0)) (not (< 1 ~N~0)) (<= |thread3Thread1of1ForFork2_~i~2#1| (+ ~N~0 ~M~0)) (< (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648) 0) (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))))) (< 2 ~N~0)) (or (<= (+ ~M~0 1) 0) (< 2147483647 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 2147483647)) (not (< 1 ~N~0)) (= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~res2~0) (< (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648) 0) (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))))) (< 2 ~N~0))), 62401#(and (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (<= (+ ~M~0 1) 0) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0) (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (<= (* ~N~0 4) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) 3 ~A~0.offset)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647))) (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) (+ ~N~0 ~M~0)) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (not (<= (+ ~M~0 1) 0))) (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (<= (+ ~M~0 1) 0) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (<= (* ~N~0 4) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) 3 ~A~0.offset)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0))) (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (<= (+ ~M~0 1) 0) (= ~A~0.offset 0) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)))), 62388#(and (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (not (< (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0)) (not (<= (+ |thread3Thread1of1ForFork2_~tmp~2#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4))) 2147483647)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 2) (+ ~N~0 ~M~0)) (not (<= 0 (+ |thread3Thread1of1ForFork2_~tmp~2#1| 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4)))))) (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (<= (+ ~M~0 1) 0) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (not (< (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0)) (not (<= (+ |thread3Thread1of1ForFork2_~tmp~2#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4))) 2147483647)) (< (+ |thread3Thread1of1ForFork2_~tmp~2#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4))) (+ ~res1~0 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (or (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ |thread3Thread1of1ForFork2_~tmp~2#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4)))) (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (<= (+ ~M~0 1) 0) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (not (< (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (not (<= 0 (+ |thread3Thread1of1ForFork2_~tmp~2#1| 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4))))))), 62346#(or (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0) 2147483647)) (< (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (= ~res1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0)) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648))) (not (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0)) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)), 62380#(and (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0) 2147483647)) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) (+ ~N~0 ~M~0)) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648))) (not (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0))) (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0) 2147483647)) (<= (+ ~M~0 1) 0) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (< (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0) (+ ~res1~0 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (not (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0))) (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (<= (+ ~M~0 1) 0) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648))) (not (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0)) (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0)))), 62375#(or (< 2147483647 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0)) (< 2147483647 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (< (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 0) (< (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 2147483648) 0) (= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (+ (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)) ~res2~0)) (<= ~N~0 1) (<= ~N~0 (+ ~M~0 1)) (< (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648) 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)) ~res2~0 2147483648) 0) (< 2 ~N~0) (< 2147483647 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (< 2147483647 (+ (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)) ~res2~0)) (< (+ 2 ~M~0) ~N~0)), 62397#(and (or (<= (+ ~M~0 1) 0) (not (<= (+ (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)) ~res2~0) 2147483647)) (<= ~res1~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)) ~res2~0)) (not (< (+ ~M~0 1) ~N~0)) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 2147483648))) (not (<= 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)) ~res2~0 2147483648))) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0) 2147483647)) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (or (not (<= (+ (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)) ~res2~0) 2147483647)) (not (< (+ ~M~0 1) ~N~0)) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 2147483648))) (<= 2 ~N~0) (not (<= 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)) ~res2~0 2147483648))) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0) 2147483647)) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (or (< (+ (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)) ~res2~0) (+ ~res1~0 1)) (<= (+ ~M~0 1) 0) (not (<= (+ (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)) ~res2~0) 2147483647)) (not (< (+ ~M~0 1) ~N~0)) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 2147483648))) (not (<= 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)) ~res2~0 2147483648))) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0) 2147483647)) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0))), 62355#(or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 3) ~N~0) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (< (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4))) 0) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (< (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648) 0) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (< 2147483647 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0)) (< 2147483647 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4)))) (= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4))) (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (<= ~N~0 (+ |thread3Thread1of1ForFork2_~i~2#1| 1))), 62365#(or (< 2147483647 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0)) (< 2147483647 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (= (+ (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)) ~res2~0) (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (<= (+ 3 ~M~0) ~N~0) (< (+ |thread1Thread1of1ForFork0_~i~0#1| 2) ~N~0) (< (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 2147483648) 0) (< (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 0) (< 2147483647 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (<= ~N~0 (+ ~M~0 1)) (<= ~N~0 (+ |thread1Thread1of1ForFork0_~i~0#1| 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) 4)) ~res2~0 2147483648) 0) (< (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 0) (< 2147483647 (+ (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)) ~res2~0))), 62404#(and (or (<= (+ ~M~0 1) 0) (<= ~N~0 2) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0) (< (+ (* ~N~0 4) (* ~M~0 4)) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) 8)) (<= (+ |thread3Thread1of1ForFork2_~tmp~2#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) (* ~M~0 (- 4)) 4))) ~res1~0)) (or (<= ~res1~0 (+ |thread3Thread1of1ForFork2_~tmp~2#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) (* ~M~0 (- 4)) 4)))) (<= (+ ~M~0 1) 0) (not (= 0 (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset))) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0) (< (+ (* ~N~0 4) (* ~M~0 4)) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) 8))) (or (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 2) (+ ~N~0 ~M~0)) (not (<= (+ ~M~0 1) 0)) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (or (<= (+ ~M~0 1) 0) (< 0 (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 1)) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0) (< (+ (* ~N~0 4) (* ~M~0 4)) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) 8)) (<= (+ |thread3Thread1of1ForFork2_~tmp~2#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) (* ~M~0 (- 4)) 4))) ~res1~0)) (or (<= ~res1~0 (+ |thread3Thread1of1ForFork2_~tmp~2#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) (* ~M~0 (- 4)) 4)))) (<= (+ ~M~0 1) 0) (<= ~N~0 2) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0) (< (+ (* ~N~0 4) (* ~M~0 4)) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) 8))) (or (<= (+ ~M~0 1) 0) (= ~A~0.offset 0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (or (<= ~res1~0 (+ |thread3Thread1of1ForFork2_~tmp~2#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) (* ~M~0 (- 4)) 4)))) (<= (+ ~M~0 1) 0) (< 0 (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 1)) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0) (< (+ (* ~N~0 4) (* ~M~0 4)) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) 8))) (or (<= (+ ~M~0 1) 0) (not (= 0 (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset))) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0) (< (+ (* ~N~0 4) (* ~M~0 4)) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) 8)) (<= (+ |thread3Thread1of1ForFork2_~tmp~2#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) (* ~M~0 (- 4)) 4))) ~res1~0)) (or (<= (+ ~M~0 1) 0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0) (<= (+ (* ~N~0 4) (* ~M~0 4)) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) 8)))), 62408#(and (or (<= (+ ~M~0 1) 0) (<= ~N~0 2)) (or (<= (+ ~M~0 1) 0) (= ~A~0.offset 0)) (or (<= (+ ~M~0 1) 0) (= ~res2~0 0)) (or (<= (+ ~M~0 1) 0) (< 0 (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 1))) (or (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 2) (+ ~N~0 ~M~0)) (not (<= (+ ~M~0 1) 0))) (or (<= (+ ~M~0 1) 0) (<= (* ~M~0 4) (* |thread3Thread1of1ForFork2_~i~2#1| 4)) (< (+ (* ~N~0 4) (* ~M~0 4)) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) 8))) (or (<= (+ ~M~0 1) 0) (= ~res1~0 0))), 62356#(or (< 2147483647 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (< (+ |thread1Thread1of1ForFork0_~i~0#1| 2) ~N~0) (< (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 0) (< 2147483647 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (<= ~N~0 (+ |thread1Thread1of1ForFork0_~i~0#1| 1)) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (< (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 0)), 62386#(and (or (<= (+ ~M~0 1) 0) (not (< (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0)) (not (<= (+ |thread3Thread1of1ForFork2_~tmp~2#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4))) 2147483647)) (not (<= 0 (+ |thread3Thread1of1ForFork2_~tmp~2#1| 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4))))) (< (+ |thread3Thread1of1ForFork2_~tmp~2#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4))) (+ ~res1~0 1))) (or (not (< (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0)) (not (<= (+ |thread3Thread1of1ForFork2_~tmp~2#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4))) 2147483647)) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 2) (+ ~N~0 ~M~0)) (not (<= 0 (+ |thread3Thread1of1ForFork2_~tmp~2#1| 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4)))))) (or (<= (+ ~M~0 1) 0) (not (< (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0)) (not (<= (+ |thread3Thread1of1ForFork2_~tmp~2#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4))) 2147483647)) (<= ~res1~0 (+ |thread3Thread1of1ForFork2_~tmp~2#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4)))) (not (<= 0 (+ |thread3Thread1of1ForFork2_~tmp~2#1| 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4))))))), 62360#(or (< 2147483647 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (not (< (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0)) (not (<= (+ |thread3Thread1of1ForFork2_~tmp~2#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4))) 2147483647)) (< (+ |thread1Thread1of1ForFork0_~i~0#1| 2) ~N~0) (< (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 0) (= (+ |thread3Thread1of1ForFork2_~tmp~2#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4))) (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (< (+ |thread3Thread1of1ForFork2_~i~2#1| 2) ~N~0) (< 2147483647 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (<= ~N~0 (+ |thread1Thread1of1ForFork0_~i~0#1| 1)) (not (<= 0 (+ |thread3Thread1of1ForFork2_~tmp~2#1| 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4))))) (< (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 0)), 62378#(and (or (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0) 2147483647)) (<= (+ ~M~0 1) 0) (<= ~res1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0)) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648))) (not (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0)) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (or (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0) 2147483647)) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) (+ ~N~0 ~M~0)) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648))) (not (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0)) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (or (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0) 2147483647)) (<= (+ ~M~0 1) 0) (< (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0) (+ ~res1~0 1)) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648))) (not (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0)) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0))), 62370#(or (< 2147483647 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 0) (= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~res2~0) (<= ~N~0 1) (< (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648) 0) (< 2 ~N~0) (< 2147483647 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))))), 62381#(and (or (<= (+ ~M~0 1) 0) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (< (+ |thread1Thread1of1ForFork0_~i~0#1| 2) ~N~0) (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (< |thread3Thread1of1ForFork2_~tmp~2#1| (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (or (< 2147483647 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) (+ ~N~0 ~M~0)) (< (+ |thread1Thread1of1ForFork0_~i~0#1| 2) ~N~0) (< (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 0) (not (<= (+ ~M~0 1) 0)) (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647))) (or (<= (+ ~M~0 1) 0) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) |thread3Thread1of1ForFork2_~tmp~2#1|) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (< (+ |thread1Thread1of1ForFork0_~i~0#1| 2) ~N~0) (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)))), 62353#(or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0) 2147483647)) (< (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0)) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648))) (not (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0))), 62390#(and (or (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0) 2147483647)) (<= (+ ~M~0 1) 0) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4))) 2147483647)) (< (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4))) (+ ~res1~0 1)) (not (< (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0)) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4))))) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648))) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (or (<= ~res1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4)))) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0) 2147483647)) (<= (+ ~M~0 1) 0) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4))) 2147483647)) (not (< (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0)) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4))))) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648))) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (or (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0) 2147483647)) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4))) 2147483647)) (not (< (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0)) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4))))) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648))) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 2) (+ ~N~0 ~M~0)) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0))), 62376#(and (or (<= (+ ~M~0 1) 0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0) (<= ~res1~0 |thread3Thread1of1ForFork2_~tmp~2#1|)) (or (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) (+ ~N~0 ~M~0)) (not (<= (+ ~M~0 1) 0)) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (or (<= (+ ~M~0 1) 0) (< |thread3Thread1of1ForFork2_~tmp~2#1| (+ ~res1~0 1)) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0))), 62394#(and (or (<= (+ ~M~0 1) 0) (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))) (< (+ |thread3Thread1of1ForFork2_~tmp~2#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4))) (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 1)) (not (< (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0)) (not (<= (+ |thread3Thread1of1ForFork2_~tmp~2#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4))) 2147483647)) (not (< 1 ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) 2147483647)) (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))))) (< 2 ~N~0)) (or (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))) (not (< (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0)) (not (<= (+ |thread3Thread1of1ForFork2_~tmp~2#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4))) 2147483647)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 2147483647)) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 2) (+ ~N~0 ~M~0)) (not (< 1 ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) 2147483647)) (not (<= 0 (+ |thread3Thread1of1ForFork2_~tmp~2#1| 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4))))) (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))))) (< 2 ~N~0)) (or (<= (+ ~M~0 1) 0) (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))) (not (< (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 2147483647)) (not (< 1 ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) 2147483647)) (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (+ |thread3Thread1of1ForFork2_~tmp~2#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4)))) (not (<= 0 (+ |thread3Thread1of1ForFork2_~tmp~2#1| 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4))))) (< 2 ~N~0))), 62396#(and (or (<= (+ ~M~0 1) 0) (not (<= (+ (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)) ~res2~0) 2147483647)) (<= ~res1~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)) ~res2~0)) (not (< (+ ~M~0 1) ~N~0)) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 2147483648))) (not (<= 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)) ~res2~0 2147483648))) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0) 2147483647))) (or (< (+ (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)) ~res2~0) (+ ~res1~0 1)) (<= (+ ~M~0 1) 0) (not (<= (+ (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)) ~res2~0) 2147483647)) (not (< (+ ~M~0 1) ~N~0)) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 2147483648))) (not (<= 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)) ~res2~0 2147483648))) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0) 2147483647))) (or (not (<= (+ (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)) ~res2~0) 2147483647)) (not (< (+ ~M~0 1) ~N~0)) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 2147483648))) (<= 2 ~N~0) (not (<= 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)) ~res2~0 2147483648))) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0) 2147483647)))), 62403#(and (or (<= (+ ~M~0 1) 0) (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))) (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0)) (<= (* ~N~0 4) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) 3 ~A~0.offset)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 2147483647)) (not (< 1 ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) 2147483647)) (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))))) (< 2 ~N~0)) (or (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) (+ ~N~0 ~M~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 2147483647)) (not (<= (+ ~M~0 1) 0)) (not (< 1 ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) 2147483647)) (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))))) (< 2 ~N~0)) (or (<= (+ ~M~0 1) 0) (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))) (= ~A~0.offset 0) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 2147483647)) (not (< 1 ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) 2147483647)) (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))))) (< 2 ~N~0)) (or (<= (+ ~M~0 1) 0) (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))) (<= (* ~N~0 4) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) 3 ~A~0.offset)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 2147483647)) (not (< 1 ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) 2147483647)) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0) (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))))) (< 2 ~N~0))), 62382#(and (or (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0) 2147483647)) (<= (+ ~M~0 1) 0) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (< (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0) (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (< (+ |thread1Thread1of1ForFork0_~i~0#1| 2) ~N~0) (not (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0)) (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0))) (or (<= (+ ~M~0 1) 0) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648))) (< (+ |thread1Thread1of1ForFork0_~i~0#1| 2) ~N~0) (not (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0)) (not (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647))) (or (< 2147483647 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0) 2147483647)) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) (+ ~N~0 ~M~0)) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648))) (< (+ |thread1Thread1of1ForFork0_~i~0#1| 2) ~N~0) (not (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0)) (< (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 0) (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)))), 62392#(and (or (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0)) (not (<= (+ |thread3Thread1of1ForFork2_~tmp~2#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4))) 2147483647)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (< (+ |thread1Thread1of1ForFork0_~i~0#1| 2) ~N~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 2) (+ ~N~0 ~M~0)) (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (not (<= 0 (+ |thread3Thread1of1ForFork2_~tmp~2#1| 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4)))))) (or (<= (+ ~M~0 1) 0) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (< (+ |thread1Thread1of1ForFork0_~i~0#1| 2) ~N~0) (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ |thread3Thread1of1ForFork2_~tmp~2#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4)))) (not (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (not (<= 0 (+ |thread3Thread1of1ForFork2_~tmp~2#1| 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4)))))) (or (<= (+ ~M~0 1) 0) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0)) (not (<= (+ |thread3Thread1of1ForFork2_~tmp~2#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4))) 2147483647)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (< (+ |thread1Thread1of1ForFork0_~i~0#1| 2) ~N~0) (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0)) (< (+ |thread3Thread1of1ForFork2_~tmp~2#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4))) (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))))), 62358#(or (< 2147483647 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (< (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (< (+ |thread1Thread1of1ForFork0_~i~0#1| 2) ~N~0) (< (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 0) (< 2147483647 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (<= ~N~0 (+ |thread1Thread1of1ForFork0_~i~0#1| 1)) (= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) |thread3Thread1of1ForFork2_~tmp~2#1|) (< (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 0)), 62352#(or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (< (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) |thread3Thread1of1ForFork2_~tmp~2#1|)), 62341#(or (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0) 2147483647)) (= ~res1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0)) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 2) ~N~0) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648))) (not (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0))), 62362#(or (< 2147483647 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0)) (<= (+ 3 ~M~0) ~N~0) (= ~res1~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)) ~res2~0)) (< (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 2147483648) 0) (<= ~N~0 (+ ~M~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) 4)) ~res2~0 2147483648) 0) (< 2147483647 (+ (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)) ~res2~0))), 62359#(or (< 2147483647 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0) 2147483647)) (< (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0)) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648))) (< (+ |thread1Thread1of1ForFork0_~i~0#1| 2) ~N~0) (not (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0)) (< (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 0) (< 2147483647 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (<= ~N~0 (+ |thread1Thread1of1ForFork0_~i~0#1| 1)) (< (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 0)), 62402#(and (or (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) (+ ~N~0 ~M~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (< (+ |thread1Thread1of1ForFork0_~i~0#1| 2) ~N~0) (not (<= (+ ~M~0 1) 0)) (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647))) (or (<= (+ ~M~0 1) 0) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0)) (<= (* ~N~0 4) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) 3 ~A~0.offset)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (< (+ |thread1Thread1of1ForFork0_~i~0#1| 2) ~N~0) (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647))) (or (<= (+ ~M~0 1) 0) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (<= (* ~N~0 4) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) 3 ~A~0.offset)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (< (+ |thread1Thread1of1ForFork0_~i~0#1| 2) ~N~0) (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0) (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (or (<= (+ ~M~0 1) 0) (= ~A~0.offset 0) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (< (+ |thread1Thread1of1ForFork0_~i~0#1| 2) ~N~0) (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)))), 62347#(or (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 3) ~N~0) (< 2147483647 (+ |thread3Thread1of1ForFork2_~tmp~2#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4)))) (< (+ |thread3Thread1of1ForFork2_~tmp~2#1| 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4))) 0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0) (= ~res1~0 (+ |thread3Thread1of1ForFork2_~tmp~2#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4)))) (<= ~N~0 (+ |thread3Thread1of1ForFork2_~i~2#1| 1))), 62389#(and (or (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0) 2147483647)) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4))) 2147483647)) (not (< (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0)) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4))))) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648))) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 2) (+ ~N~0 ~M~0))) (or (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0) 2147483647)) (<= (+ ~M~0 1) 0) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4))) 2147483647)) (< (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4))) (+ ~res1~0 1)) (not (< (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0)) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4))))) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648)))) (or (<= ~res1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4)))) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0) 2147483647)) (<= (+ ~M~0 1) 0) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4))) 2147483647)) (not (< (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0)) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4))))) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648))))), 62349#(or (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 3) ~N~0) (< (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4))) 0) (< (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648) 0) (= ~res1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4)))) (< 2147483647 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0)) (< 2147483647 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4)))) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0) (<= ~N~0 (+ |thread3Thread1of1ForFork2_~i~2#1| 1))), 62343#(or (= ~res2~0 ~res1~0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)), 62369#(or (< 2147483647 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (< (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 0) (= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~res2~0) (<= ~N~0 1) (< (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648) 0) (< 2 ~N~0) (< 2147483647 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))))), 62395#(and (or (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0) 2147483647)) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4))) 2147483647)) (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))) (not (< (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0)) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4))))) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 2147483647)) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648))) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 2) (+ ~N~0 ~M~0)) (not (< 1 ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) 2147483647)) (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))))) (< 2 ~N~0)) (or (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4)))) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0) 2147483647)) (<= (+ ~M~0 1) 0) (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))) (not (< (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0)) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4))))) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 2147483647)) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648))) (not (< 1 ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) 2147483647)) (< 2 ~N~0)) (or (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0) 2147483647)) (<= (+ ~M~0 1) 0) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4))) 2147483647)) (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))) (< (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4))) (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 1)) (not (< (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0)) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648))) (not (< 1 ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) 2147483647)) (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))))) (< 2 ~N~0))), 62368#(and (or (< 2147483647 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (<= (+ ~M~0 1) 0) (< (+ |thread1Thread1of1ForFork0_~i~0#1| 2) ~N~0) (< (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 0) (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (or (< 2147483647 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (< (+ |thread1Thread1of1ForFork0_~i~0#1| 2) ~N~0) (< (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 0) (not (<= (+ ~M~0 1) 0)) (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (<= |thread3Thread1of1ForFork2_~i~2#1| (+ ~N~0 ~M~0)))), 62385#(and (or (<= (+ ~M~0 1) 0) (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))) (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 2147483647)) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648))) (not (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0)) (not (< 1 ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) 2147483647)) (< 2 ~N~0)) (or (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0) 2147483647)) (<= (+ ~M~0 1) 0) (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))) (< (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0) (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 1)) (not (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0)) (not (< 1 ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) 2147483647)) (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))))) (< 2 ~N~0)) (or (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0) 2147483647)) (< 2147483647 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) (+ ~N~0 ~M~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 2147483647)) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648))) (not (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0)) (not (< 1 ~N~0)) (< (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648) 0) (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))))) (< 2 ~N~0))), 62387#(and (or (<= (+ ~M~0 1) 0) (not (< (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0)) (not (<= (+ |thread3Thread1of1ForFork2_~tmp~2#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4))) 2147483647)) (<= ~res1~0 (+ |thread3Thread1of1ForFork2_~tmp~2#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4)))) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0) (not (<= 0 (+ |thread3Thread1of1ForFork2_~tmp~2#1| 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4)))))) (or (not (< (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0)) (not (<= (+ |thread3Thread1of1ForFork2_~tmp~2#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4))) 2147483647)) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 2) (+ ~N~0 ~M~0)) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0) (not (<= 0 (+ |thread3Thread1of1ForFork2_~tmp~2#1| 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4)))))) (or (<= (+ ~M~0 1) 0) (not (< (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0)) (not (<= (+ |thread3Thread1of1ForFork2_~tmp~2#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4))) 2147483647)) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0) (not (<= 0 (+ |thread3Thread1of1ForFork2_~tmp~2#1| 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4))))) (< (+ |thread3Thread1of1ForFork2_~tmp~2#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4))) (+ ~res1~0 1)))), 62363#(or (< 2147483647 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0)) (<= (+ 3 ~M~0) ~N~0) (= ~res1~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)) ~res2~0)) (< (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 2147483648) 0) (<= ~N~0 (+ ~M~0 1)) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~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)) ~res2~0 2147483648) 0) (< 2147483647 (+ (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)) ~res2~0))), 62409#(and (or (<= (+ ~M~0 1) 0) (= ~A~0.offset 0)) (or (<= (+ ~M~0 1) 0) (= ~res2~0 0)) (or (not (<= (+ ~M~0 1) 0)) (<= 2 ~N~0)) (or (< (* ~N~0 4) 8) (<= (+ ~M~0 1) 0) (not (= (+ ~A~0.offset (* ~M~0 4)) 0)) (<= ~res1~0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int| ~A~0.base) 4)))) (or (< (* ~N~0 4) 8) (<= (+ ~M~0 1) 0) (not (= (+ ~A~0.offset (* ~M~0 4)) 0)) (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int| ~A~0.base) 4)) ~res1~0)) (or (<= (+ ~M~0 1) 0) (<= (* ~N~0 4) 8))), 62372#(or (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0) 2147483647)) (< 2147483647 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (< (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (< (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 0) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648))) (not (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0)) (<= ~N~0 1) (< (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648) 0) (< 2 ~N~0) (= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0)) (< 2147483647 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))))), 62405#(and (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (<= (+ ~M~0 1) 0) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (<= (+ |thread3Thread1of1ForFork2_~tmp~2#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) (* ~M~0 (- 4)) 4))) (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (not (= 0 (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset))) (< (+ (* ~N~0 4) (* ~M~0 4)) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) 8))) (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (<= (+ ~M~0 1) 0) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (not (= 0 (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset))) (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ |thread3Thread1of1ForFork2_~tmp~2#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) (* ~M~0 (- 4)) 4)))) (< (+ (* ~N~0 4) (* ~M~0 4)) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) 8))) (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (<= (+ ~M~0 1) 0) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (< 0 (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 1)) (<= (+ |thread3Thread1of1ForFork2_~tmp~2#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) (* ~M~0 (- 4)) 4))) (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (< (+ (* ~N~0 4) (* ~M~0 4)) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) 8))) (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (<= (+ ~M~0 1) 0) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (< 0 (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 1)) (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ |thread3Thread1of1ForFork2_~tmp~2#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) (* ~M~0 (- 4)) 4)))) (< (+ (* ~N~0 4) (* ~M~0 4)) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) 8))) (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (<= (+ ~M~0 1) 0) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (<= (+ |thread3Thread1of1ForFork2_~tmp~2#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) (* ~M~0 (- 4)) 4))) (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (<= ~N~0 2) (< (+ (* ~N~0 4) (* ~M~0 4)) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) 8))) (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (<= (+ ~M~0 1) 0) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (<= (+ (* ~N~0 4) (* ~M~0 4)) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) 8))) (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 2) (+ ~N~0 ~M~0)) (not (<= (+ ~M~0 1) 0))) (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (<= (+ ~M~0 1) 0) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (<= ~N~0 2) (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ |thread3Thread1of1ForFork2_~tmp~2#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) (* ~M~0 (- 4)) 4)))) (< (+ (* ~N~0 4) (* ~M~0 4)) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) 8))) (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (<= (+ ~M~0 1) 0) (= ~A~0.offset 0) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)))), 62406#(and (or (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (< (+ |thread1Thread1of1ForFork0_~i~0#1| 2) ~N~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 2) (+ ~N~0 ~M~0)) (not (<= (+ ~M~0 1) 0)) (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647))) (or (<= (+ ~M~0 1) 0) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (<= (+ |thread3Thread1of1ForFork2_~tmp~2#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) (* ~M~0 (- 4)) 4))) (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (< (+ |thread1Thread1of1ForFork0_~i~0#1| 2) ~N~0) (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (not (= 0 (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset))) (< (+ (* ~N~0 4) (* ~M~0 4)) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) 8))) (or (<= (+ ~M~0 1) 0) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (< (+ |thread1Thread1of1ForFork0_~i~0#1| 2) ~N~0) (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (<= (+ (* ~N~0 4) (* ~M~0 4)) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) 8))) (or (<= (+ ~M~0 1) 0) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (<= (+ |thread3Thread1of1ForFork2_~tmp~2#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) (* ~M~0 (- 4)) 4))) (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (< (+ |thread1Thread1of1ForFork0_~i~0#1| 2) ~N~0) (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (<= ~N~0 2) (< (+ (* ~N~0 4) (* ~M~0 4)) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) 8))) (or (<= (+ ~M~0 1) 0) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (<= (+ |thread3Thread1of1ForFork2_~tmp~2#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) (* ~M~0 (- 4)) 4))) (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (< (+ |thread1Thread1of1ForFork0_~i~0#1| 2) ~N~0) (< 0 (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 1)) (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (< (+ (* ~N~0 4) (* ~M~0 4)) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) 8))) (or (<= (+ ~M~0 1) 0) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ |thread3Thread1of1ForFork2_~tmp~2#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) (* ~M~0 (- 4)) 4)))) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (< (+ |thread1Thread1of1ForFork0_~i~0#1| 2) ~N~0) (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (<= ~N~0 2) (< (+ (* ~N~0 4) (* ~M~0 4)) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) 8))) (or (<= (+ ~M~0 1) 0) (= ~A~0.offset 0) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (< (+ |thread1Thread1of1ForFork0_~i~0#1| 2) ~N~0) (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647))) (or (<= (+ ~M~0 1) 0) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ |thread3Thread1of1ForFork2_~tmp~2#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) (* ~M~0 (- 4)) 4)))) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (< (+ |thread1Thread1of1ForFork0_~i~0#1| 2) ~N~0) (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (not (= 0 (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset))) (< (+ (* ~N~0 4) (* ~M~0 4)) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) 8))) (or (<= (+ ~M~0 1) 0) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ |thread3Thread1of1ForFork2_~tmp~2#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) (* ~M~0 (- 4)) 4)))) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (< (+ |thread1Thread1of1ForFork0_~i~0#1| 2) ~N~0) (< 0 (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 1)) (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (< (+ (* ~N~0 4) (* ~M~0 4)) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) 8)))), 62364#(or (< 2147483647 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0)) (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ (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)) ~res2~0)) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (<= (+ 3 ~M~0) ~N~0) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (< (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 2147483648) 0) (<= ~N~0 (+ ~M~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) 4)) ~res2~0 2147483648) 0) (< 2147483647 (+ (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)) ~res2~0))), 62342#(or (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 3) ~N~0) (not (< (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0)) (not (<= (+ |thread3Thread1of1ForFork2_~tmp~2#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4))) 2147483647)) (not (<= 0 (+ |thread3Thread1of1ForFork2_~tmp~2#1| 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4))))) (= ~res1~0 (+ |thread3Thread1of1ForFork2_~tmp~2#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4))))), 62345#(or (< (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (= ~res1~0 |thread3Thread1of1ForFork2_~tmp~2#1|) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)), 62357#(or (< 2147483647 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< (+ |thread1Thread1of1ForFork0_~i~0#1| 2) ~N~0) (< (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 0) (< 2147483647 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (<= ~N~0 (+ |thread1Thread1of1ForFork0_~i~0#1| 1)) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (< (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 0)), 62366#(and (or (not (<= (+ ~M~0 1) 0)) (<= |thread3Thread1of1ForFork2_~i~2#1| (+ ~N~0 ~M~0)) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (or (<= (+ ~M~0 1) 0) (= ~res2~0 ~res1~0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0))), 62351#(or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))), 62379#(and (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (<= (+ ~M~0 1) 0) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) |thread3Thread1of1ForFork2_~tmp~2#1|) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647))) (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) (+ ~N~0 ~M~0)) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (not (<= (+ ~M~0 1) 0))) (or (< |thread3Thread1of1ForFork2_~tmp~2#1| (+ ~res1~0 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (<= (+ ~M~0 1) 0) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)))), 62361#(or (< 2147483647 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4))) (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (< (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4))) 0) (< (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648) 0) (< 2147483647 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0)) (< (+ |thread1Thread1of1ForFork0_~i~0#1| 2) ~N~0) (< 2147483647 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4)))) (< (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 0) (< (+ |thread3Thread1of1ForFork2_~i~2#1| 2) ~N~0) (< 2147483647 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (<= ~N~0 (+ |thread1Thread1of1ForFork0_~i~0#1| 1)) (< (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 0) (<= ~N~0 (+ |thread3Thread1of1ForFork2_~i~2#1| 1))), 62374#(or (< 2147483647 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (< (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4))) 0) (< (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 0) (< (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648) 0) (< 2147483647 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0)) (< 2147483647 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4)))) (<= ~N~0 1) (< (+ |thread3Thread1of1ForFork2_~i~2#1| 2) ~N~0) (= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4)))) (< (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648) 0) (< 2 ~N~0) (< 2147483647 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (<= ~N~0 (+ |thread3Thread1of1ForFork2_~i~2#1| 1))), 62411#(and (or (<= (+ ~M~0 1) 0) (not (= (+ ~A~0.offset (* ~M~0 4)) 0)) (<= ~res1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (<= (+ ~M~0 1) 0) (<= ~N~0 2)) (or (< (* ~N~0 4) 8) (<= (+ ~M~0 1) 0) (= (+ (* ~M~0 4) 4) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset (* ~M~0 4))) (<= (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset) 3)) (or (<= (+ ~M~0 1) 0) (not (= (+ ~A~0.offset (* ~M~0 4)) 0)) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res1~0)) (or (<= (+ ~M~0 1) 0) (= ~A~0.offset 0)) (or (<= (+ ~M~0 1) 0) (= ~res2~0 0)) (or (not (<= (+ ~M~0 1) 0)) (<= 2 ~N~0))), 62384#(and (or (< 2147483647 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) (+ ~N~0 ~M~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 2147483647)) (not (<= (+ ~M~0 1) 0)) (not (< 1 ~N~0)) (< (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648) 0) (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))))) (< 2 ~N~0)) (or (= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) |thread3Thread1of1ForFork2_~tmp~2#1|) (<= (+ ~M~0 1) 0) (< 2147483647 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 2147483647)) (not (< 1 ~N~0)) (< (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648) 0) (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))))) (< 2 ~N~0))), 62371#(or (= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) |thread3Thread1of1ForFork2_~tmp~2#1|) (< 2147483647 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (< (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (< (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 0) (<= ~N~0 1) (< (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648) 0) (< 2 ~N~0) (< 2147483647 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))))), 62348#(or (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 3) ~N~0) (< (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4))) 0) (< (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 2147483648) 0) (= ~res1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4)))) (< 2147483647 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0)) (< 2147483647 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4)))) (<= ~N~0 (+ |thread3Thread1of1ForFork2_~i~2#1| 1))), 62400#(and (or (<= (+ ~M~0 1) 0) (<= (* ~N~0 4) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) 3 ~A~0.offset)) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0) ~res1~0)) (or (<= (+ ~M~0 1) 0) (= ~A~0.offset 0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (or (<= (+ ~M~0 1) 0) (<= (* ~N~0 4) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) 3 ~A~0.offset)) (<= ~res1~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset)) ~res2~0)) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (or (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) (+ ~N~0 ~M~0)) (not (<= (+ ~M~0 1) 0)) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0))), 62410#(and (or (<= (+ ~M~0 1) 0) (= ~A~0.offset 0)) (or (<= (+ ~M~0 1) 0) (= ~res2~0 0)) (or (not (<= (+ ~M~0 1) 0)) (<= 2 ~N~0)) (or (< (* ~N~0 4) 8) (<= (+ ~M~0 1) 0) (not (= (+ ~A~0.offset (* ~M~0 4)) 0)) (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int| ~A~0.base) 4)) ~res1~0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (or (< (* ~N~0 4) 8) (<= (+ ~M~0 1) 0) (not (= (+ ~A~0.offset (* ~M~0 4)) 0)) (<= ~res1~0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int| ~A~0.base) 4))) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (or (<= (+ ~M~0 1) 0) (<= (* ~N~0 4) 8))), 62407#(and (or (<= (+ ~M~0 1) 0) (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 2147483647)) (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (+ |thread3Thread1of1ForFork2_~tmp~2#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) (* ~M~0 (- 4)) 4)))) (not (< 1 ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) 2147483647)) (not (= 0 (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset))) (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))))) (< 2 ~N~0)) (or (<= (+ ~M~0 1) 0) (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 2147483647)) (<= (+ |thread3Thread1of1ForFork2_~tmp~2#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) (* ~M~0 (- 4)) 4))) (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (not (< 1 ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) 2147483647)) (not (= 0 (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset))) (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))))) (< 2 ~N~0)) (or (<= (+ ~M~0 1) 0) (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 2147483647)) (not (< 1 ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) 2147483647)) (<= (+ (* ~N~0 4) (* ~M~0 4)) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) 8)) (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))))) (< 2 ~N~0)) (or (<= (+ ~M~0 1) 0) (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))) (= ~A~0.offset 0) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 2147483647)) (not (< 1 ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) 2147483647)) (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))))) (< 2 ~N~0)) (or (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 2147483647)) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 2) (+ ~N~0 ~M~0)) (not (<= (+ ~M~0 1) 0)) (not (< 1 ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) 2147483647)) (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))))) (< 2 ~N~0))), 62373#(or (= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (+ |thread3Thread1of1ForFork2_~tmp~2#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4)))) (< 2147483647 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (< (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 0) (not (< (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0)) (not (<= (+ |thread3Thread1of1ForFork2_~tmp~2#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4))) 2147483647)) (<= ~N~0 1) (< (+ |thread3Thread1of1ForFork2_~i~2#1| 2) ~N~0) (< (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648) 0) (not (<= 0 (+ |thread3Thread1of1ForFork2_~tmp~2#1| 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4))))) (< 2 ~N~0) (< 2147483647 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))))), 62344#(or (= ~res2~0 ~res1~0) (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)), 62354#(or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (not (< (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0)) (not (<= (+ |thread3Thread1of1ForFork2_~tmp~2#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4))) 2147483647)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (< (+ |thread3Thread1of1ForFork2_~i~2#1| 2) ~N~0) (= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ |thread3Thread1of1ForFork2_~tmp~2#1| (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4)))) (not (<= 0 (+ |thread3Thread1of1ForFork2_~tmp~2#1| 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~A~0.offset 4)))))), 62398#(and (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (not (<= (+ (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)) ~res2~0) 2147483647)) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (not (< (+ ~M~0 1) ~N~0)) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 2147483648))) (<= 2 ~N~0) (not (<= 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)) ~res2~0 2147483648))) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0) 2147483647))) (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (<= (+ ~M~0 1) 0) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (not (< (+ ~M~0 1) ~N~0)) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 2147483648))) (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ (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)) ~res2~0)) (not (<= 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)) ~res2~0 2147483648))) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0) 2147483647))) (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (<= (+ ~M~0 1) 0) (not (<= (+ (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)) ~res2~0) 2147483647)) (not (<= 0 (+ ~res1~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (not (< (+ ~M~0 1) ~N~0)) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 2147483648))) (< (+ (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)) ~res2~0) (+ ~res1~0 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0) 2147483647))))] [2022-03-15 19:22:08,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 89 states [2022-03-15 19:22:08,691 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:22:08,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2022-03-15 19:22:08,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=574, Invalid=11416, Unknown=0, NotChecked=0, Total=11990 [2022-03-15 19:22:08,692 INFO L87 Difference]: Start difference. First operand 557 states and 1810 transitions. Second operand has 89 states, 88 states have (on average 4.7272727272727275) internal successors, (416), 88 states have internal predecessors, (416), 0 states have call successors, (0), 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:12,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:28:12,408 INFO L93 Difference]: Finished difference Result 8382 states and 25193 transitions. [2022-03-15 19:28:12,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 567 states. [2022-03-15 19:28:12,409 INFO L78 Accepts]: Start accepts. Automaton has has 89 states, 88 states have (on average 4.7272727272727275) internal successors, (416), 88 states have internal predecessors, (416), 0 states have call successors, (0), 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 28 [2022-03-15 19:28:12,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:28:12,425 INFO L225 Difference]: With dead ends: 8382 [2022-03-15 19:28:12,425 INFO L226 Difference]: Without dead ends: 8291 [2022-03-15 19:28:12,449 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 866 GetRequests, 200 SyntacticMatches, 26 SemanticMatches, 640 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166792 ImplicationChecksByTransitivity, 346.6s TimeCoverageRelationStatistics Valid=31119, Invalid=380403, Unknown=0, NotChecked=0, Total=411522 [2022-03-15 19:28:12,450 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 5399 mSDsluCounter, 7018 mSDsCounter, 0 mSdLazyCounter, 25345 mSolverCounterSat, 592 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5399 SdHoareTripleChecker+Valid, 2785 SdHoareTripleChecker+Invalid, 25937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 592 IncrementalHoareTripleChecker+Valid, 25345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:28:12,450 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5399 Valid, 2785 Invalid, 25937 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [592 Valid, 25345 Invalid, 0 Unknown, 0 Unchecked, 22.2s Time] [2022-03-15 19:28:12,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8291 states. [2022-03-15 19:28:12,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8291 to 1141. [2022-03-15 19:28:12,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1141 states, 1140 states have (on average 3.5921052631578947) internal successors, (4095), 1140 states have internal predecessors, (4095), 0 states have call successors, (0), 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:12,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1141 states to 1141 states and 4095 transitions. [2022-03-15 19:28:12,534 INFO L78 Accepts]: Start accepts. Automaton has 1141 states and 4095 transitions. Word has length 28 [2022-03-15 19:28:12,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:28:12,534 INFO L470 AbstractCegarLoop]: Abstraction has 1141 states and 4095 transitions. [2022-03-15 19:28:12,535 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 89 states, 88 states have (on average 4.7272727272727275) internal successors, (416), 88 states have internal predecessors, (416), 0 states have call successors, (0), 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:12,535 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 4095 transitions. [2022-03-15 19:28:12,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 19:28:12,537 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:28:12,537 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, 1, 1, 1] [2022-03-15 19:28:12,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-03-15 19:28:12,751 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-03-15 19:28:12,751 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:28:12,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:28:12,752 INFO L85 PathProgramCache]: Analyzing trace with hash -803080967, now seen corresponding path program 3 times [2022-03-15 19:28:12,753 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:28:12,753 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716881270] [2022-03-15 19:28:12,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:28:12,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:28:12,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:28:13,100 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:28:13,100 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:28:13,100 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716881270] [2022-03-15 19:28:13,100 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716881270] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:28:13,100 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101064084] [2022-03-15 19:28:13,100 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:28:13,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:28:13,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:28:13,102 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:28:13,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-03-15 19:28:13,225 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 19:28:13,225 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:28:13,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 91 conjunts are in the unsatisfiable core [2022-03-15 19:28:13,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:28:13,628 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:28:13,628 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 31 Received shutdown request... [2022-03-15 19:32:31,248 WARN L244 SmtUtils]: Removed 2 from assertion stack [2022-03-15 19:32:31,249 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-03-15 19:32:31,251 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 19:32:31,251 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 19:32:31,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-03-15 19:32:31,450 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-03-15 19:32:31,450 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2,while TraceCheckSpWp was constructing forward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 7 for 3ms.. [2022-03-15 19:32:31,451 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 4 remaining) [2022-03-15 19:32:31,451 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 4 remaining) [2022-03-15 19:32:31,451 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (0 of 4 remaining) [2022-03-15 19:32:31,453 INFO L732 BasicCegarLoop]: Path program histogram: [9, 7, 3, 1, 1, 1, 1, 1, 1] [2022-03-15 19:32:31,454 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 19:32:31,454 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 19:32:31,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 07:32:31 BasicIcfg [2022-03-15 19:32:31,455 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 19:32:31,456 INFO L158 Benchmark]: Toolchain (without parser) took 763491.51ms. Allocated memory was 199.2MB in the beginning and 657.5MB in the end (delta: 458.2MB). Free memory was 149.1MB in the beginning and 270.1MB in the end (delta: -121.0MB). Peak memory consumption was 534.2MB. Max. memory is 8.0GB. [2022-03-15 19:32:31,456 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 199.2MB. Free memory is still 165.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 19:32:31,456 INFO L158 Benchmark]: CACSL2BoogieTranslator took 185.95ms. Allocated memory is still 199.2MB. Free memory was 149.0MB in the beginning and 173.2MB in the end (delta: -24.2MB). Peak memory consumption was 13.3MB. Max. memory is 8.0GB. [2022-03-15 19:32:31,456 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.20ms. Allocated memory is still 199.2MB. Free memory was 173.2MB in the beginning and 171.0MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 19:32:31,456 INFO L158 Benchmark]: Boogie Preprocessor took 36.36ms. Allocated memory is still 199.2MB. Free memory was 171.0MB in the beginning and 169.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 19:32:31,456 INFO L158 Benchmark]: RCFGBuilder took 555.58ms. Allocated memory is still 199.2MB. Free memory was 169.0MB in the beginning and 141.6MB in the end (delta: 27.4MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-03-15 19:32:31,456 INFO L158 Benchmark]: TraceAbstraction took 762656.98ms. Allocated memory was 199.2MB in the beginning and 657.5MB in the end (delta: 458.2MB). Free memory was 141.2MB in the beginning and 270.1MB in the end (delta: -128.9MB). Peak memory consumption was 526.1MB. Max. memory is 8.0GB. [2022-03-15 19:32:31,457 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.12ms. Allocated memory is still 199.2MB. Free memory is still 165.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 185.95ms. Allocated memory is still 199.2MB. Free memory was 149.0MB in the beginning and 173.2MB in the end (delta: -24.2MB). Peak memory consumption was 13.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.20ms. Allocated memory is still 199.2MB. Free memory was 173.2MB in the beginning and 171.0MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.36ms. Allocated memory is still 199.2MB. Free memory was 171.0MB in the beginning and 169.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 555.58ms. Allocated memory is still 199.2MB. Free memory was 169.0MB in the beginning and 141.6MB in the end (delta: 27.4MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * TraceAbstraction took 762656.98ms. Allocated memory was 199.2MB in the beginning and 657.5MB in the end (delta: 458.2MB). Free memory was 141.2MB in the beginning and 270.1MB in the end (delta: -128.9MB). Peak memory consumption was 526.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.1s, 154 PlacesBefore, 36 PlacesAfterwards, 156 TransitionsBefore, 30 TransitionsAfterwards, 1518 CoEnabledTransitionPairs, 8 FixpointIterations, 94 TrivialSequentialCompositions, 28 ConcurrentSequentialCompositions, 15 TrivialYvCompositions, 6 ConcurrentYvCompositions, 8 ChoiceCompositions, 151 TotalNumberOfCompositions, 2348 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1860, positive: 1791, positive conditional: 0, positive unconditional: 1791, negative: 69, negative conditional: 0, negative unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 800, positive: 784, positive conditional: 0, positive unconditional: 784, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1860, positive: 1007, positive conditional: 0, positive unconditional: 1007, negative: 53, negative conditional: 0, negative unconditional: 53, unknown: 800, unknown conditional: 0, unknown unconditional: 800] , Statistics on independence cache: Total cache size (in pairs): 74, Positive cache size: 69, Positive conditional cache size: 0, Positive unconditional cache size: 69, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 104]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2,while TraceCheckSpWp was constructing forward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 7 for 3ms.. - TimeoutResultAtElement [Line: 98]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2,while TraceCheckSpWp was constructing forward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 7 for 3ms.. - TimeoutResultAtElement [Line: 96]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2,while TraceCheckSpWp was constructing forward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 7 for 3ms.. - TimeoutResultAtElement [Line: 97]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2,while TraceCheckSpWp was constructing forward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 7 for 3ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 178 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 762.5s, OverallIterations: 25, TraceHistogramMax: 2, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.1s, AutomataDifference: 403.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.2s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9883 SdHoareTripleChecker+Valid, 34.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9883 mSDsluCounter, 5680 SdHoareTripleChecker+Invalid, 30.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17709 mSDsCounter, 1246 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 50703 IncrementalHoareTripleChecker+Invalid, 51949 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1246 mSolverCounterUnsat, 357 mSDtfsCounter, 50703 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5570 GetRequests, 3784 SyntacticMatches, 218 SemanticMatches, 1568 ConstructedPredicates, 19 IntricatePredicates, 0 DeprecatedPredicates, 191100 ImplicationChecksByTransitivity, 381.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1141occurred in iteration=24, InterpolantAutomatonStates: 1127, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 24 MinimizatonAttempts, 17951 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 16.9s InterpolantComputationTime, 1075 NumberOfCodeBlocks, 1075 NumberOfCodeBlocksAsserted, 59 NumberOfCheckSat, 1506 ConstructedInterpolants, 79 QuantifiedInterpolants, 14134 SizeOfPredicates, 359 NumberOfNonLiveVariables, 5317 ConjunctsInSsa, 745 ConjunctsInUnsatCore, 64 InterpolantComputations, 6 PerfectInterpolantSequences, 108/258 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown